FM’99 — Formal Methods

@inproceedings{Wing1999FM99F,
  title={FM’99 — Formal Methods},
  author={Jeannette M. Wing and Jim Woodcock and Jim Davies},
  booktitle={Lecture Notes in Computer Science},
  year={1999}
}
State Machines (ASM) and Algebraic Methods in Software Technology (AMAST) A Termination Detection Algorithm: Specification and Verification . . . . . .1720 R. Eschbach Logspace Reducibility via Abstract State Machines . . . . . . . . . . . . . . . . . . . .1738 E. Grädel and M. Spielmann Formal Methods for Extensions to CAS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .1758 M. N. Dunstan, T. Kelsey, U. Martin, and S. Linton An Algebraic Framework for Higher-Order Modules… 

B: towards zero defect software

This paper introduces B, a mathematically based method and a computer based tool-kit for software engineering. The B-Method provides a notation and a method for the formal specification and design of

Towards Component Verification in the Generic Component Framework

Towards a mobile temporal logic of actions

This thesis introduces a spatio-temporal logic called MTLA whose temporal part is based on Lamport’s Temporal Logic of Actions (TLA) and defines spatial modalities to describe the structure of the system and its modifications.

Formal Specification and Rule-Based Refinement of Software Components

A formal component technique is presented, that is based on the transformation-based framework for components, but that formalizes that framework by using category theory, which allows the development of component transformations, rule-based refinement of components and the corresponding results.

Hardware Compilation : Verification and Rapid-prototyping

It is demonstrated that the compilation process can be verified, increasing the confidence in its correctness, and that it can be very directly automated using the logic programming language Prolog.

The event-B Modelling Method: Concepts and Case Studies

Classical B is a state-based method developed by Abrial for specifying, designing and coding software systems. It is based on Zermelo—Fraenkel set theory with the axiom of choice. Sets are used for

The ODL Operation Definition Language and the AutoFocus/Quest Application Framework AQuA Programming Processes

A language for the description of general high-level operations on models called ODL (operation description language) is introduced and a framework is introduced for the evaluation of ODL expressions.

Herbrand theorems in arbitrary institutions

A New Quality Model for Natural Language Requirements Specifications

This paper describes an extension to the natural language requirements specification quality model that is the basis for the QuARS (Quality Analyzer of Requirements Specification) tool. The extension

A Calculus of Space, Time, and Causality: Its Algebra, Geometry, Logic

The calculus formalises human intuition and common sense about space, time, and causality in the natural world. Its intention is to assist in the design and implementation of programs, of programming

References

SHOWING 1-2 OF 2 REFERENCES

Papers Theories of Programming: Top-Down and Bottom-Up Meeting in the

  • Papers Theories of Programming: Top-Down and Bottom-Up Meeting in the

Schneider Formal Analysis of a Secure Communication Channel: Secure Core

  • Volume I Verifying a Distributed Database Lookup Manager Written in Erlang . . . . 682 T. Arts and M. Dam Security Secure Interoperation of Secure Distributed Databases Scedrov A Uniform Approach for the Definition of Security Properties . . . . . . . . . . . 794 R. Focardi and F. Martinelli Group P