By Topic

Formal Engineering Methods, 2000. ICFEM 2000. Third IEEE International Conference on

Date 4-6 Sept. 2000

Filter Results

Displaying Results 1 - 24 of 24
  • Third IEEE International Conference on Formal Engineering Methods

    Publication Year: 2000, Page(s):iii - vi
    Request permission for commercial reuse | PDF file iconPDF (159 KB)
    Freely Available from IEEE
  • The use of mathematics in software engineering

    Publication Year: 2000, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (42 KB)

    First Page of the Article
    View full abstract»

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

    Publication Year: 2000, Page(s): 209
    Request permission for commercial reuse | PDF file iconPDF (36 KB)
    Freely Available from IEEE
  • Formal foundations of object-oriented modeling notations

    Publication Year: 2000, Page(s):101 - 110
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    Describes and classifies the different solutions that have been proposed to realize the integration of graphic modeling languages, which are known and accepted by software developers, with formal modeling languages having analysis and verification tools. Inspired by that classification, we define a new integration proposal, based on first-order dynamic logic. The principal benefits of the proposed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Filter promotion transformation strategies for deriving efficient programs from Z specifications

    Publication Year: 2000, Page(s):157 - 167
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    In recent years there has been growing interest in systematic methods for refining Z specifications into programs. We consider a transformational programming strategy known as filter promotion and examine its use for refining a class of Z specifications into sequential as well as parallel programs. This strategy is particularly useful for transforming specification of generate and test problems in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mechanical verification of transaction processing systems

    Publication Year: 2000, Page(s):89 - 97
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    Concerns the formal specification and mechanical verification of transaction processing systems aimed at distributed databases. In such systems, a standard set of ACID (Atomicity, Consistency, Isolation and Durability) properties must be ensured by a combination of concurrency control and recovery protocols. In the existing literature, these protocols are often studied in isolation, making strong ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal treatment of a family of fixed-point problems on graphs by CafeOBJ

    Publication Year: 2000, Page(s):67 - 74
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    A family of well-known problems on graphs, including the shortest path problem and the data flow analysis problem, can be uniformly formulated as a fixed-point problem on graphs. We specify this problem and its solution algorithm in a highly abstract manner, fully exploiting the parametrized module construct of CafeOBJ, an algebraic specification language. The objective of our research is to explo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structuring reactive systems in B AMN

    Publication Year: 2000, Page(s):25 - 33
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    B has been widely used for high-integrity systems development, for example in the railway industry. However, there are few published guidelines on how to structure B specifications for particular types of system, such as reactive control systems. In this paper, we describe a method to support the graphical design of systems using the B abstract machine notation (AMN), and we develop guidelines for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Offering formal verification capabilities for industry standard case tools: challenges and results

    Publication Year: 2000, Page(s): 153
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (24 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A case study in partial specification: consistency and refinement for Object-Z

    Publication Year: 2000, Page(s):177 - 185
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    The `viewpoint' approach, in which a system is described by several partial specifications, has been proposed as a way of making complex computing systems more understandable. The ISO's Open Distributing Processing (ODP) framework is an architecture for open distributed systems, involving five named viewpoints. This paper compares two partial specifications of a lending library-from the ODP's Ente... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SPIN vs. VIS: a case study on the formal verification of the ATMR protocol

    Publication Year: 2000, Page(s):79 - 87
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    Nowadays, there exist a wide variety of verification tools. Some, like the SPIN model checker, are designed and mainly used for the verification of interleaving software systems, such as communication protocols. Others, like VIS (Verification Interacting with Synthesis), are designed and used for synchronous hardware systems verification. In this paper, we compare and contrast SPIN and VIS. In par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An animatable operational semantics of the Verilog hardware description language

    Publication Year: 2000, Page(s):199 - 207
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    An operational semantics of a significant subset of the Verilog hardware description language (HDL) is presented. The semantics is encoded using the logic programming language Prolog in a literate programming style. This allows the associated documentation to be maintained in step with the semantics, and the printed version to be presented in a standard mathematical operational semantics style. It... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified algebraic framework for specifying communication protocols

    Publication Year: 2000, Page(s):57 - 65
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    Provides a unified framework for the specification of communication protocols. This framework enables one to integrate different formalisms within algebraic specifications, permitting the description of the dynamic aspects of distributed systems, such as temporal logic, Petri nets and process algebra. These integrations provide different languages, allowing specifications which may include both th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding formally proved code in a smart card: converting B to C

    Publication Year: 2000, Page(s):15 - 22
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    Smart cards are small embedded devices with strong security requirements. To fulfil those requirements, formal methods appear as promising techniques. The B method has already been used to model smart-card components. However, smart cards have also very strong programming constraints, both for memory usage and computing power. Currently, the code generated from a B specification does not meet thos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fragmented retrenchment, concurrency and fairness

    Publication Year: 2000, Page(s):143 - 151
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early preformal stages of development, and briefly justified. Fragmented retrenchment permits the granularity of actions to decrease across a development step, many concrete steps retrenching a single abstract one. This generates the usual proliferation of interleavin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using use cases in Executable Z

    Publication Year: 2000, Page(s):111 - 119
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    Use cases are a widespread informal method for specifying the requirements of a technical system in the early development phase. Z is a formal notation which aims to support, beside others, the specification of early requirements. We develop a representation of use cases in Z and apply it to several examples. Our focus is on instrumenting the formalization for black-box test evaluation in Executab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ClawZ: control laws in Z

    Publication Year: 2000, Page(s):169 - 176
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    ClawZ is a prototype tool whose objective is to link the Simulink(R) control engineering tool from MathWorks, with the ProofPower(R) dialect of Z. It provides a bridge between the use of Simulink to define control law diagrams and a tool to formally prove compliance between Ada and Z. The tool has been used as part of the formal proof of a nonlinear dynamic inversion flight control system comprisi... View full abstract»

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

    Publication Year: 2000, Page(s): 75
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (24 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Highly reliable component-based software development by using algebraic behavioral specification

    Publication Year: 2000, Page(s):35 - 43
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    Component-based software development, in which software is developed by combining components and connectors, has gained in popularity because it can increase software productivity. To increase software productivity, components must be re-used, but to do so, we must select a software architecture. We propose a new software architecture called a “tree architecture”. It is represented by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An integrated CSP-based tool for the visualisation, animation and performance evaluation of message passing algorithms

    Publication Year: 2000, Page(s):189 - 198
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1468 KB)

    This paper presents ongoing research and development on an integrated tool for the visualisation and animation of message-passing communicating systems described in Hoare's CSP (Communicating Sequential Processes). It introduces major new developments to the original VisualNets implemented in C++ and reported in (Abdallah, 1998). The new tool is implemented partly in Java and partly in the functio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Translating UAN into CSP

    Publication Year: 2000, Page(s):121 - 129
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    We define a translation from the User Action Notation (UAN) to the process algebra Communicating Sequential Processes (CSP). UAN is an informal notation, used for task modeling and design. Translating a UAN task description to CSP provides a base for rigorous development of an interactive system. The resulting CSP description is a suitable abstract starting point for development, as it describes e... View full abstract»

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

    Publication Year: 2000, Page(s):45 - 53
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    As systems become increasingly complex and existing methodologies become insufficient to handle the complexity, the design community is beginning to look at formal methods for a possible solution. Techniques involving a limited use of formal techniques (such as semi-formal methods and equivalence checking) have given a glimpse of what full usage of formal techniques can achieve. For the use of for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal derivation of multilayered hardware/software structures

    Publication Year: 2000, Page(s):5 - 13
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    Presents a formal method for synthesising multi-layered regular processor arrays from algorithm specifications. A multi-layered array is a structure where 2D sub-arrays are connected into a 3D array only by one edge, and thus it fits, for example, the structure of a motherboard with FPGA daughter-boards. The synthesis of multi-layerd structures requires the extensive use of algebraic transformatio... View full abstract»

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

    Publication Year: 2000, Page(s):133 - 142
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    The more obvious and well known drawbacks of using refinement as the sole means of progressing from an abstract model to a concrete implementation are reviewed. Retrenchment is presented in a simple partial correctness framework as a more flexible development concept for formally capturing the early and otherwise preformal stages of development, and briefly justified. Given a retrenchment from an ... View full abstract»

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