2009 Seventh IEEE International Conference on Software Engineering and Formal Methods

23-27 Nov. 2009

Filter Results

Displaying Results 1 - 25 of 42
  • [Front cover]

    Publication Year: 2009, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (4519 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2009, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (11 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2009, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (69 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (104 KB)
    Freely Available from IEEE
  • Table of contents

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

    Publication Year: 2009, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (74 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Organizers

    Publication Year: 2009, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (67 KB)
    Freely Available from IEEE
  • Program Committee

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

    Publication Year: 2009, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (47 KB)
    Freely Available from IEEE
  • Software Verification and System Assurance

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

    Littlewood introduced the idea that software may be possibly perfect and that we can contemplate its probability of (im)perfection. We review this idea and show how it provides a bridge between correctness, which is the goal of software verification (and especially formal verification), and the probabilistic properties such as reliability that are the targets for system-level assurance. We enumera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrated Modeling and Verification of Real-Time Systems through Multiple Paradigms

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

    A core problem in formal methods is the transition from informal requirements to formal specifications. Especially when specifying reactive systems, many formalisms require the user to either understand a complex mathematical theory and notation or to derive details not given in the requirements, such as the state space of the problem. While formalizing a real-world requirements document, we devel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation Correctness of a Real-Time Operating System

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

    In the modern car, electronic devices are even employed for safety-critical missions like brake control, where failures might cost human lives. Among various approaches to increase the reliability of those devices, pervasive formal verification most securely rules out all systematic failures. The main target of the Verisoft project is the development of technology for pervasive verification. Its a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LARVA --- Safer Monitoring of Real-Time Java Programs (Tool Paper)

    Publication Year: 2009, Page(s):33 - 37
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    The use of runtime verification, as a lightweight approach to guarantee properties of systems, has been increasingly employed on real-life software. In this paper, we present the tool LARVA, for the runtime verification of properties of Java programs, including real-time properties. Properties can be expressed in a number of notations, including timed-automata enriched with stopwatches, Lustre, an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation Relations for Systems with Distributed Interfaces

    Publication Year: 2009, Page(s):41 - 50
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (329 KB) | HTML iconHTML

    In this paper we define simulation relations for distributed systems. Taking as starting point our previous work on the distributed testing architecture, we introduce novel simulation relations that can be used to define, given a specification, what a good implementation is. We approach the problem from two different perspectives. First, we consider that different ports of the system cannot share ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Automated Approach to Verifying Diagnosability in Multi-agent Systems

    Publication Year: 2009, Page(s):51 - 60
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB) | HTML iconHTML

    We propose a general analysis method for recursive, concurrent programs that tracks effectively procedure calls and returns in a concurrent context, even in the presence of unbounded recursion and infinite-state variables like integers. This method generalizes the relational interprocedural analysis of sequential programs to the concurrent case. We implemented it for programs with scalar variables... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specifying Interacting Components with Coordinated Concurrent Scenarios

    Publication Year: 2009, Page(s):61 - 69
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (349 KB) | HTML iconHTML

    We introduce a visual notation for local specification of concurrent components based on message sequence charts (MSCs). Each component is a finite-state machine whose actions are MSCs that specify its local view of the overall communication in the system. These local MSCs are composed into coherent global scenarios using a separately specified set of transactions. Intuitively, each MSC represents... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying Formal Passive Testing to Study Temporal Properties of the Stream Control Transmission Protocol

    Publication Year: 2009, Page(s):73 - 82
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB) | HTML iconHTML

    In this paper we present a formal passive testing framework and use it to analyze time aspects in the stream control transmission protocol (SCTP). This protocol presents different phases where time aspects are critical. In order to represent temporal requirements we use so-called timed invariants since they allow us to easily verify that the traces collected from the observation of the protocol fu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relational Interprocedural Verification of Concurrent Programs

    Publication Year: 2009, Page(s):83 - 92
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (409 KB) | HTML iconHTML

    We propose a general analysis method for recursive, concurrent programs that tracks effectively procedure calls and returns in a concurrent context, even in the presence of unbounded recursion and infinite-state variables like integers. This method generalizes the relational interprocedural analysis of sequential programs to the concurrent case. We implemented it for programs with scalar variables... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Change Impact Analysis to Select Tests for Extended Finite State Machines

    Publication Year: 2009, Page(s):93 - 102
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (363 KB) | HTML iconHTML

    A formal approach to select tests for regression testing of changes performed in a system evolution step is proposed. Systems are modeled as extended finite state machines (EFSMs) supporting several commonly used data types including Booleans, numbers, arrays, queues and records. Tests are described using a sequence of input and expected output messages with concrete parameter values. Changes add/... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overflow and Roundoff Error Analysis via Model Checking

    Publication Year: 2009, Page(s):105 - 114
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (530 KB) | HTML iconHTML

    This paper proposes a framework for statically analyzing overflow and roundoff errors of C programs. First, a new range representation, "extended affine interval", is proposed to estimate overflow and roundoff errors. Second, the overflow and roundoff error analysis problem is encoded as a weighted model checking problem. To avoid widening, currently we focus on programs with bounded loops, which ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Probabilistic Model Checking to Evaluate GUI Testing Techniques

    Publication Year: 2009, Page(s):115 - 124
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (523 KB) | HTML iconHTML

    Different testing techniques are being proposed in software testing to improve systems quality and increase development productivity. However, it is difficult to determine from a given set of testing techniques, which is the most effective testing technique for a certain domain, particularly if they are random-based. We are proposing a strategy and a framework that can evaluate such testing techni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heuristic Sensitivity in Guided Random-Walk Based Model Checking

    Publication Year: 2009, Page(s):125 - 134
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB) | HTML iconHTML

    In this work we combine the complementary worlds of model checking and simulation. Model checking is used to verify that a model of a system satisfies some property. In general it considers all inputs. In simulation, a model of a system is executed for particular inputs. Our combined approach, referred to here as formal model simulation, uses the same formal model as model checking, but abandons t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Behavioral Specification of Reactive Systems Using Stream-Based I/O Tables

    Publication Year: 2009, Page(s):137 - 146
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    A core problem in formal methods is the transition from informal requirements to formal specifications. Especially when specifying reactive systems, many formalisms require the user to either understand a complex mathematical theory and notation or to derive details not given in the requirements, such as the state space of the problem. While formalizing a real-world requirements document, we devel... View full abstract»

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

    Publication Year: 2009, Page(s):147 - 156
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (546 KB) | HTML iconHTML

    Scenario-based specifications have gained wide acceptance in requirements engineering. However, scenarios are not appropriate to describe global, system-wide invariants. Thus, a specification often consists of scenarios and universal properties. In order to obtain a consistent specification, the scenarios must be integrated in a way which does not violate the properties. However, manual integratio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Checking Sequence Construction Using Adaptive and Preset Distinguishing Sequences

    Publication Year: 2009, Page(s):157 - 166
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (343 KB) | HTML iconHTML

    Methods for testing from finite state machine-based specifications often require the existence of a preset distinguishing sequence for constructing checking sequences. It has been shown that an adaptive distinguishing sequence is sufficient for these methods. This result is significant because adaptive distinguishing sequences are strictly more common and up to exponentially shorter than preset on... View full abstract»

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