The Theory of Timed I/O Automata Page 1 |I|T Computer Science and Artificial lntelligence
Laboratory Technical Report MIT-CSA||L-TR-2003-01 August 27, 2003 M|T-LCS-TR-917 The …

A general refinement methodology is presented based on ideas of E. Stark, and it is
explained how these can be used for the systematic development of fault-tolerant systems …

Formal design verification is a methodology for detecting logical errors in systems. In formal
design verification, the designer describes a system in a language with a mathematical …

A general refinement methodology is presented based on ideas of Stark, and it is explained
how these can be used for the systematic development of fault-tolerant systems. Highlights …

The rely/guarantee approach set out to extend operation decomposition methods for
sequential programs to cover concurrent shared-variable systems. The essential step was to …

Abstract Model checking algorithms for the verification of reactive systems proceed by a
systematic and exhaustive exploration of the system state space. They do not scale to large …

This dissertation investigates game-theoretic approaches to the algorithmic analysis of
concurrent, reactive systems. A concurrent system comprises a number of components …

This paper presents a proposal for extending the Ravenscar Tasking Profile with
annotations that can be used to express temporal properties. An approach using model …

Formal methods to specify and verify concurrent programs with synchronous message
passing are discussed. We stress the development towards compositional methods, ie …

Pour satisfaire aux nouveaux besoins de flexibilité, modularité, d'adaptabilité et de
distribution des applications, les paradigmes composants et services ont été déclinés dans …