Tools and Algorithms for the Construction and Analysis of Systems

Formal verification of pipelined processors.- Fully local and efficient evaluation of alternating fixed points.- Modular model checking of software.- Verification based on local states.- Exploiting symmetry in linear time temporal logic model checking: One step beyond.- OPEN/CAeSAR: An open software architecture for verification, simulation, and testing.- Practical model-checking using games.- Combining finite automata, parallel programs and SDL using Petri nets.- Mesa: Support for scenario-based design of concurrent systems.- Efficient modeling of memory arrays in symbolic ternary simulation.- Translation validation.- A verified model checker for the modal ?-calculus in Coq.- Detecting races in relay ladder logic programs.- Verification of large state/event systems using compositionality and dependency analysis.- Tamagotchis need not die - Verification of statemate designs.- Modeling and verification of sC++ applications.- Factotum: Automatic and systematic sharing support for systems analyzers.- Model checking via reachability testing for timed automata.- Formal design and analysis of a gear controller.- Verifying networks of timed processes.- Model checking of real-time reachability properties using abstractions.- Symbolic exploration of transition hierarchies.- Static partial order reduction.- Set-based analysis of reactive infinite-state systems.- Deciding fixed and non-fixed size bit-vectors.- Experience with literate programming in the modelling and validation of systems.- A proof of burns N-process mutual exclusion algorithm using abstraction.- Automated verification of Szymanski's algorithm.- Formal verification of SDL systems at the siemens mobile phone department.

[1]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[2]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[3]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[4]  George S. Avrunin,et al.  Patterns in property specifications for finite-state verification , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[5]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[6]  Kim G. Larsen,et al.  Modal Specifications , 1989, Automatic Verification Methods for Finite State Systems.

[7]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[8]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[9]  Wil M. P. van der Aalst,et al.  Verification of Workflow Nets , 1997, ICATPN.