88 research outputs found

    Formal aspects of component software (FACS 2010 selected and extended papers)

    Get PDF
    This issue includes extended versions of selected best papers from the 7th International Workshop on Formal Aspects of Component Software (FACS 2010) held in Guimarães, Portugal on October 14–16, 2010. The component-based software development approach has emerged as a promising paradigm to cope with an ever increasing complexity of present-day software solutions by bringing sound production and engineering principles into software engineering. However, many conceptual and technological issues remain that challenge component-based software development theory and practice. To address these issues, FACS seeks to provide a forum for researchers and practitioners in the areas of component software and formal methods to foster a better understanding of the component-based paradigm and its applications as well as how formal methods can or should be used to make component-based software development succeed

    Proposal for a Council Decision adopting the new provisions relating to Chapter VI "Supplies" of the Treaty establishing the European Atomic Energy Community. COM (82) 732 final, 3 December 1982

    Get PDF
    Many competing definitions of software components have been proposed over the years, but still today there is only partial agreement over such basic issues as granularity (are components bigger or smaller than objects, packages, or application?), instantiation (do components exist at run-time or only at compile-time?), and state (should we distinguish between components and ``instances" of components?). We adopt a minimalist view in which components can be distinguished by \emphcomposable interfaces. We have identified a number of key features and mechanisms for expressing composable software, and propose a calculus for modeling components, based on the asynchronous pi calculus extended with explicit namespaces, or ``forms". This calculus serves as a semantic foundation and an executable abstract machine for Piccola, an experimental composition language. The calculus also enables reasoning about compositional styles and evaluation strategies for Piccola. We present the design rationale for the Piccola calculus, and briefly outline some of the results obtained

    On secure mobile ad hoc routing

    No full text
    International audienceMany plain routing protocols have been proposed for mobile ad hoc net- works. These protocols all assume cooperative networks and focus only on routing effectiveness and efficiency. However, mobile ad hoc networks are not a friendly environment for various reasons in nature. Routing Proto- cols without any security feature can put entire network at risk. As security becomes an increasingly important issue, secure mobile ad hoc routing is attracting more and more research attention. In this paper, we make a comprehensive investigation on the issue of network security and conduct an up-to-date survey of secure mobile ad hoc routing protocols
    corecore