By Topic

Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007)

Date 10-14 Sept. 2007

Filter Results

Displaying Results 1 - 25 of 47
  • Fifth IEEE International Conference on Software Engineering and Formal Methods - Cover

    Publication Year: 2007, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (225 KB)
    Freely Available from IEEE
  • Fifth IEEE International Conference on Software Engineering and Formal Methods - Title page

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

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

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

    Publication Year: 2007, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (26 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committees

    Publication Year: 2007, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (46 KB)
    Freely Available from IEEE
  • Program Committees

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

    Publication Year: 2007, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (45 KB)
    Freely Available from IEEE
  • Specialising in Software Engineering

    Publication Year: 2007, Page(s): 3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    Developing a software-intensive system is engineering in the traditional sense: creating an artifact which transforms the physical world to meet some recognised need. The artifact is the hardware-software machine; the physical world is the system's environment; and the recognised need is the requirement. For a successful development the entailment must hold: "machine, environment, requirement". By... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verification of C Programs Using Automated Reasoning

    Publication Year: 2007, Page(s):7 - 14
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (318 KB) | HTML iconHTML

    Much of the embedded software development market has necessarily tight constraints on program size and processor power, hence developers use handwritten C rather than autocode. They rely primarily on testing to find errors in their code. We have an established software development tool known commercially as Perfect Developer, which uses a powerful automatic theorem prover and inference engine to r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Problem Oriented Software Engineering: A design-theoretic framework for software engineering

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

    A key challenge for software engineering is to learn how to reconcile the formal world of the machine and its software with the non-formal real world. In this paper, we discuss elements of problem oriented software engineering (POSE), an approach that brings both non- formal and formal aspects of software development together in a single theoretical framework for software engineering design. POSE ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formalising Design Patterns in Predicate Logic

    Publication Year: 2007, Page(s):25 - 36
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB) | HTML iconHTML

    Design patterns are traditionally outlined in an informal manner. If they could be formalised, we could derive tools that automatically recognise design patterns and refactor designs and code. Our approach is to deploy predicate logic to specify conditions on the class diagrams that describe design patterns. The structure of class diagrams is itself described with a novel meta-notation that can be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Retrenchment and the Atomicity Pattern

    Publication Year: 2007, Page(s):37 - 46
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (318 KB) | HTML iconHTML

    The issues surrounding the question of atomicity, both in the past and nowadays, are briefly reviewed, and a picture of an ACID (atomic, consistent, isolated, durable) transaction as a refinement problem is presented. An example of a simple air traffic control system is introduced, and the discrepancies that can arise when read-only operations examine the state at atomic and finegrained levels are... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verifying the Mondex Case Study

    Publication Year: 2007, Page(s):47 - 58
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB) | HTML iconHTML

    The Mondex Case study is still the most substantial contribution to the Grand Challenge repository. It has been the target of a number of formal verification efforts. Those efforts concentrated on correctness proofs for refinement steps of the specification in various specification formalisms using different verification tools. In this paper we report on a Java Card implementation of the Mondex pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-driven architecture for cancer research

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

    It is a common phenomenon for research projects to collect and analyse valuable data using ad-hoc information systems. These costly-to-build systems are often composed of incompatible variants of the same modules, and record data in ways that prevent any meaningful result analysis across similar projects. We present a framework that uses a combination of formal methods, model-driven development an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and Verification of TTCAN Startup Protocol Using Synchronous Calendar

    Publication Year: 2007, Page(s):69 - 79
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (314 KB) | HTML iconHTML

    We describe the modeling and verification of TTCAN startup protocol using SAL model checker. For the modeling purposes we propose a new modeling framework called Synchronous Calendar which can be seen as an adaptation of Calendar based models introduced by Duterte and Sorea. A Synchronous Calendar can express dense time systems without relying on continuously varying clocks and supports synchronou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to Test Program Generators? A Case Study using flex

    Publication Year: 2007, Page(s):80 - 92
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (315 KB) | HTML iconHTML

    We address the problem of rigorous testing of program generators. Program generators are software that take as input a model in a certain modeling language, and produce as output a program that captures the execution semantics of the input-model. In this sense, program generators are also programs and, at first sight, the traditional techniques for testing programs ought to be applicable to progra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proving Termination by Divergence

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

    We describe a simple and efficient algorithm for proving the termination of a class of loops with nonlinear assignments to variables. The method is based on divergence testing for each variable in the cone-of-influence of the loop's termination condition. The analysis allows us to automatically prove the termination of loops that cannot be handled using previous techniques. The paper closes with e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting Proof in a Reactive Development Environment

    Publication Year: 2007, Page(s):103 - 112
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (382 KB) | HTML iconHTML

    Reactive integrated development environments for software engineering have lead to an increase in productivity and quality of programs produced. They have done so by replacing the traditional sequential compile, test, debug development cycle with a more integrated and reactive development environment where these tools are run automatically in the background, giving the engineer instant feedback on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sound reasoning about unchecked exceptions

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

    In most software development projects, it is not feasible for developers to handle explicitly all possible unusual events which may occur during program execution, such as arithmetic overflow, highly unusual environment conditions, heap memory or call stack exhaustion, or asynchronous thread cancellation. Modern programming languages provide unchecked exceptions to deal with these circumstances sa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Role of Abstract Interpretation in Formal Methods

    Publication Year: 2007, Page(s):135 - 140
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (321 KB) | HTML iconHTML

    In computer science and software engineering, formal methods are mathematically-based techniques for the specification, development and verification of software and hardware systems. They therefore establish the satisfaction of a specification by a system semantics. Abstract interpretation is a theory of sound approximation of mathematical structures, in particular those involved in the descriptio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Dynamic Logic for Deductive Verification of Concurrent Programs

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

    In this paper, we present an approach aiming at full junctional deductive verification of concurrent Java programs, based on symbolic execution. We define a dynamic logic and a deductive verification calculus for a restricted fragment of Java with native concurrency primitives. Even though we cannot yet deal with non-atomic loops, employing the technique of symmetry reduction allows us to verify u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An ought-to-do deontic logic for reasoning about fault-tolerance: the diarrheic philosophers

    Publication Year: 2007, Page(s):151 - 160
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (399 KB) | HTML iconHTML

    In the present paper we use a variation of a well-known example (dining philosophers) to illustrate how deontic logics can be used to specify, and verify, systems with fault- tolerant characteristics. Towards this goal, we first introduce our own version of a prepositional deontic logic, and then some of its most important meta properties are described. Our main goal is to show that our deontic fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Integrated Specification Framework for Embedded Systems

    Publication Year: 2007, Page(s):161 - 172
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5973 KB) | HTML iconHTML

    In this paper, we address the complex issue of representation of continuous behaviour of the environment of the embedded controllers. In our approach, we propose two novel ideas. One is to consider the weak solutions to describe the evolution of the dynamical systems. The second novelty is to make available, at the design stage, the information about concurrent evolutions of the environment. We pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Thread-tag Based Semantics for Sequence Diagrams

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

    The sequence diagram is one of the most popular behaviour modelling languages which offers an intuitive and visual way of describing expected behaviour of object-oriented software. Much research work has investigated ways of providing a formal semantics for sequence diagrams. However, these proposed semantics may not properly interpret sequence diagrams when lifelines do not correspond to threads ... View full abstract»

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