Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05)

7-9 Sept. 2005

Filter Results

Displaying Results 1 - 25 of 55
  • Third IEEE International Conference on Software Engineering and Formal Methods

    Publication Year: 2005
    Request permission for commercial reuse | PDF file iconPDF (663 KB)
    Freely Available from IEEE
  • Third IEEE International Conference on Software Engineering and Formal Methods - Title Page

    Publication Year: 2005, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (125 KB)
    Freely Available from IEEE
  • Third IEEE International Conference on Software Engineering and Formal Methods - Copyright

    Publication Year: 2005, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (97 KB)
    Freely Available from IEEE
  • Third IEEE International Conference on Software Engineering and Formal Methods - Table of contents

    Publication Year: 2005, Page(s):v - ix
    Request permission for commercial reuse | PDF file iconPDF (143 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2005, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (144 KB) | HTML iconHTML
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2005, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (135 KB)
    Freely Available from IEEE
  • Steering Committee

    Publication Year: 2005, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (130 KB)
    Freely Available from IEEE
  • External referees

    Publication Year: 2005, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (78 KB)
    Freely Available from IEEE
  • Conference Chairs

    Publication Year: 2005, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (131 KB)
    Freely Available from IEEE
  • Towards the formal verification of a C0 compiler: code generation and implementation correctness

    Publication Year: 2005, Page(s):2 - 11
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    In the spirit of the famous CLI stack project the Verisoft project aims at the pervasive verification of entire computer systems including hardware, system software, compiler, and communicating applications, with a special focus on industrial applications. The main programming language used in the Verisoft project is C0 (a subset of C which is similar to MISRA C). This paper reports on (i) an oper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Use of verification for testing and debugging of complex reactive systems

    Publication Year: 2005, Page(s):13 - 22
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    Safety-critical reactive systems are characterized by a complex behavior, making their testing and debugging a very difficult task. Observed incorrect behavior might be hard to reproduce: even small changes in order or in time at which input events occur may have a significant impact on system reaction. The challenge is how to utilize (typically, partial) information about failed system run to rep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experimental evaluation of FSM-based testing methods

    Publication Year: 2005, Page(s):23 - 32
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    The development of test cases is an important issue for testing software, communication protocols and other reactive systems. A number of methods are known for the development of a test suite based on a formal specification given in the form of a finite state machine. Well-known methods are called the W, Wp, UIO, UIOv, DS, H and HIS test derivation methods. These methods have been extensively used... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Putting detectors in their place [program monitoring]

    Publication Year: 2005, Page(s):33 - 42
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    In this paper, we address the problem of locating detectors in a given program under resource constraints. A detector is a program component that asserts the validity of a predicate in a program. The detector location problem is to identify which program actions need to be monitored by detectors such that certain given dependability properties are met. In this paper, we focus on the following depe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Timed automata with data structures for distributed systems design and analysis

    Publication Year: 2005, Page(s):44 - 53
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (343 KB) | HTML iconHTML

    Systems of data management timed automata (SDM-TAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the decidability of reachability. As an application, we model and analyze a cryptographic protocol. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Operational semantics for real-time processes with action refinement

    Publication Year: 2005, Page(s):54 - 63
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    In this paper we propose an event-based operational interleaving semantics for a real-time process algebra, for which action refinement and a denotational true concurrency semantics have been developed and defined in terms of timed event structures. We characterize the timed event traces that are generated by the operational semantics in a denotational way, and show that this operational semantics... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specifying urgency in timed I/O automata

    Publication Year: 2005, Page(s):64 - 73
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    Tools and techniques based on timed automata (such as Uppaal and the timed I/O automata framework) have proven to be extremely useful for the analysis of protocols and control software for real-time systems. However, a significant limitation of these approaches is that, due to the expressiveness of the modeling languages, timelocks - degenerate states in which time is unable to pass - can freely a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A cloverleaf of software engineering

    Publication Year: 2005, Page(s):75 - 84
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    We shall touch upon four issues of software engineering (SE): domain engineering, formal techniques, SE sociology, and academic software architects. First, before software can be designed one must understand its requirements; but before requirements can be formulated one must understand the domain. So we assume that requirements development is based on first having established models of the (appli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Precise analysis of memory consumption using program logics

    Publication Year: 2005, Page(s):86 - 95
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    Memory consumption policies provide a means to control resource usage on constrained devices, and play an important role in ensuring the overall quality of software systems, and in particular resistance against resource exhaustion attacks. Such memory consumption policies have been previously enforced through static analysis, which yield automatic bounds at the cost of precision, or run-time analy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using dominators to extract observable protocol contexts

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

    While verifying complex protocols, it is often fruitful to consider all protocol contexts in which an interesting set of transitions may appear. The contexts are represented as yet another protocol called observable protocol that may be further analyzed. An efficient approach based on static analysis to compute an over-approximated protocol that includes all the runs of an observable protocol is d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Counting interface automata and their application in static analysis of actor models

    Publication Year: 2005, Page(s):106 - 115
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB) | HTML iconHTML

    We present an interface theory based approach to static analysis of actor models. We first introduce a new interface theory, which is based on interface automata, and which is capable of counting with numbers. Using this new interface theory, we can capture temporal and quantitative aspects of an actor interface as well as an actor's token exchange rate. We will show, how to extract this informati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating Relational Database Transactions From Recursive Functions Defined on EB^3 Traces

    Publication Year: 2005, Page(s):117 - 126
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB) | HTML iconHTML

    EB3 is a trace-based formal language created for the specification of information systems (IS). Attributes, linked to entities and associations of an IS, are computed in EB3 by recursive functions on the valid traces of the system. We aim at synthesizing relational database transactions that correspond to EB3 attribute definitions. Each EB3 action is tra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Workflow enactment based on a chemical metaphor

    Publication Year: 2005, Page(s):127 - 136
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB) | HTML iconHTML

    Executing workflows on large-scale heterogeneous distributed computing systems is a challenging task. Albeit there have been many well elaborated approaches, they are often motivated by a certain class of applications and focus on some implementation specific problems. The work presented in this paper aimed at establishing a highly abstract coordination model for distributed workflow enactment whe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Safe concurrency for aggregate objects with invariants

    Publication Year: 2005, Page(s):137 - 146
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    Developing safe multithreaded software systems is difficult due to the potential unwanted interference among concurrent threads. This paper presents a flexible methodology for object-oriented programs that protects object structures against inconsistency due to race conditions. It is based on a recent methodology for single-threaded programs where developers define aggregate object structures usin... View full abstract»

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

    Publication Year: 2005
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB) | HTML iconHTML

    The last decade has displayed a trend for automatic reasoning techniques to operate on demand. Examples of this trend are counterexample-driven predicate refinement, as used in software model checking, and lemmas on demand, as used in automatic theorem proving. In line with this trend, the author shows a technique that combines abstract interpretation and theorem proving, inferring program invaria... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Omnibus verification policies: a flexible, configurable approach to assertion-based software verification

    Publication Year: 2005, Page(s):150 - 159
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB) | HTML iconHTML

    The three main assertion-based verification approaches are: design by contract (DBC), extended static checking (ESC) and verified design by contract (VDBC). Each approach offers a different balance between rigour and ease of use making them appropriate in different situations. Our goal is to explore the use of these approaches together in a flexible way, enabling an application to be broken down i... View full abstract»

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