Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004.

30-30 Sept. 2004

Filter Results

Displaying Results 1 - 25 of 53
  • Proceedings of the Second International Conference on Software Engineering and Formal Methods

    Publication Year: 2004
    Request permission for reuse | PDF file iconPDF (163 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 2004, Page(s): 0_2
    Request permission for reuse | PDF file iconPDF (160 KB)
    Freely Available from IEEE
  • Proceedings of the Second International Conference on Software Engineering and Formal Methods

    Publication Year: 2004, Page(s): 0_3
    Request permission for reuse | PDF file iconPDF (213 KB)
    Freely Available from IEEE
  • Copyright page

    Publication Year: 2004, Page(s): 0_4
    Request permission for reuse | PDF file iconPDF (193 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2004, Page(s):0_5 - 0_8
    Request permission for reuse | PDF file iconPDF (191 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2004, Page(s): 0_9
    Request permission for reuse | PDF file iconPDF (173 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference chairs

    Publication Year: 2004, Page(s): 0_10
    Request permission for reuse | PDF file iconPDF (168 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2004, Page(s): 0_11
    Request permission for reuse | PDF file iconPDF (167 KB)
    Freely Available from IEEE
  • External referees

    Publication Year: 2004, Page(s): 0_12
    Request permission for reuse | PDF file iconPDF (167 KB)
    Freely Available from IEEE
  • A programming model for the orchestration of Web services

    Publication Year: 2004, Page(s):2 - 11
    Cited by:  Papers (9)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (313 KB) | HTML iconHTML

    We explore the following quintessential problem: given a set of basic computing elements how do we compose them to yield interesting computation patterns. Our goal is to study composition operators which apply across a broad spectrum of computing elements, from sequential programs to distributed transactions over computer networks; so, our theory makes very few assumptions about the nature of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstraction of parallel uniform processes with data

    Publication Year: 2004, Page(s):14 - 23
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (381 KB) | HTML iconHTML

    In practice, distributed systems are quite often composed by an arbitrarily large but finite number of processes that execute a similar program. Abstract interpretation is an effective technique to fight state explosion problems. In this paper, we propose a general framework for abstracting parallel composition of uniform processes with data, in the setting of a process algebraic language /spl mu/... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Properties of a formal method for prediction of emergent behaviors in swarm-based systems

    Publication Year: 2004, Page(s):24 - 33
    Cited by:  Papers (15)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (409 KB) | HTML iconHTML

    Autonomous intelligent swarms of satellites are being proposed for NASA missions that have complex behaviors and interactions. The emergent properties of swarms make these missions powerful, but at the same time more difficult to design and assure that proper behaviors will emerge. This paper gives the results of research into formal methods techniques for verification and validation of NASA swarm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding the causes of unrealizability of reactive system formal specifications

    Publication Year: 2004, Page(s):34 - 43
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    Reactive systems are the systems that maintain some interaction with their environment. Temporal logic is one of the methods for formal specification descriptions of reactive systems. The formal specifications of reactive systems enables to check the consistency of the specifications and whether they contain defects. By using a synthesis algorithm we also obtain reactive system programs from the f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards mobile processes in unifying theories

    Publication Year: 2004, Page(s):44 - 53
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (340 KB) | HTML iconHTML

    The paper presents a denotational semantics of mobile processes in Hoare & He's Unifying Theories of Programming (UTP). Process mobility is captured by the mobile assignment or communication of higher-order variables, in which both the source and the target are process-valued variables. Processes are moved around in the system by updating the target and losing the value of the source. The sema... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbolic verification of infinite systems using a finite union of DFAs

    Publication Year: 2004, Page(s):56 - 66
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (404 KB) | HTML iconHTML

    We address the verification problem of FIFO channel systems by applying the symbolic analysis principle. Communication protocols can be modelled by a finite set of finite-state machines (CFSMs) that communicate between each other by exchanging messages via unbounded FIFO channels/queues. A Finite Union of Deterministic Finite Automata (FUDFA) is used to represent (possibly) infinite set of queue c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global vs. local model checking: a comparison of verification techniques for infinite state systems

    Publication Year: 2004, Page(s):67 - 76
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (364 KB) | HTML iconHTML

    Global and local model checking procedures follow radically different paradigms: while global approaches are based on fixpoint computation, local approaches are related to deduction and induction. For the verification finite state systems, this may result in different runtimes. For the verification of infinite state systems, however the differences are far more important. Since most problems are u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proof reuse for deductive program verification

    Publication Year: 2004, Page(s):77 - 86
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (354 KB) | HTML iconHTML

    We present a proof reuse mechanism for deductive program verification calculi. After a program amendment, it reuses a previous proof incrementally (one proof step at a time), employing a similarity measure for the points (formulas, terms, programs) where a rule is applied The method is flexible, as the reuse mechanism does not need knowledge about particularities of the target programming language... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Checking extended CTL properties using guarded quotient structures

    Publication Year: 2004, Page(s):87 - 94
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (371 KB) | HTML iconHTML

    We extend CTL logic to a logic called COUNT CTL (CCTL) for specifying properties of concurrent programs with large number of processes. We present a model checking algorithm for symmetric or partially symmetric systems when their correctness specification is given in CCTL. The model-checking algorithm employs Guarded Quotient Structures introduced in [9]. The GQS structures can be succinct represe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Property-driven development

    Publication Year: 2004, Page(s):96 - 102
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (379 KB) | HTML iconHTML

    Early test development and specification enhance the quality and robustness of software as experience with agile software development methods shows. The methods propagate test-first techniques and early prototyping through executable design models. We propose to enhance test-driven development to a more general property-driven development technique: Property-driven development ties together automa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From requirements change to design change: a formal path

    Publication Year: 2004, Page(s):104 - 113
    Cited by:  Papers (10)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    The ideal we seek when responding to a change in the functional requirements for a system is that we can quickly determine; (1) where to make the change; (2) how the change affects the architecture of the existing system; (3) which components of the system are affected by the change; (4) and, what behavioral changes will need to be made to the components (and their interfaces) that are affected by... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decidability results for parametric probabilistic transition systems with an application to security

    Publication Year: 2004, Page(s):114 - 121
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (466 KB) | HTML iconHTML

    We develop a model of parametric probabilistic transition systems. In this model probabilities associated with transitions may be parameters, and we show how to find instances of parameters that satisfy a given property and instances that either maximize or minimize the probability of reaching a given state. We show, as an application, the model of a probabilistic non repudiation protocol. The the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards formalizing behavioral substitutability in component frameworks

    Publication Year: 2004, Page(s):122 - 131
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (434 KB) | HTML iconHTML

    When using a component framework, developers need to respect the behavior implemented by the components. Static information about the component interface is not sufficient. Dynamic information such as the description of valid sequences of operations is required. In this paper we propose a mathematical model and a formal language to describe the knowledge about behavior We rely on a hierarchical mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource models and pre-compiler specification for hardware/software co-design language

    Publication Year: 2004, Page(s):132 - 141
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    Traditional specifications abstract from features of low-level computing environment. It is the responsibility of compilers to make the final implementation codes satisfying low-level environment constraints, in addition the compiler shall guarantee that the behavior of the low-level codes preserve what a high-level program specifies. In this paper we provide a method for building up compiler spec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling peer-to-peer service goals in UML

    Publication Year: 2004, Page(s):144 - 153
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (560 KB) | HTML iconHTML

    In this paper we present a method for describing Service Goals for peer-to-peer systems using UML 2. 0. We propose how to model services at a higher level than protocols and state machines, and how this modeling can relate to lower layers of abstraction. We show how this novel way of service specification can contribute to service validation and to dynamic discovery of peer-to-peer services. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Past- and future-oriented time-bounded temporal properties with OCL

    Publication Year: 2004, Page(s):154 - 163
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (370 KB) | HTML iconHTML

    We present the syntax and semantics of a past- and future-oriented temporal extension of the Object Constraint Language (OCL). Our extension supports designers to express time-bounded properties over a state-oriented UML model of a system under development. The semantics is formally defined over the system states of a mathematical object model. Additionally, we present a mapping to Clocked Linear ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.