Steffen

Tools and Algorithms for the Construction and Analysis of Systems

4th International Conference, TACAS'98, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings
Mitarbeit:Steffen, Bernhard

• Broschiertes Buch

Produktbeschreibung

This book constitutes the refereed proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS'98, held in conjunction with ETAPS in Lisbon, Portugal, in March/April 1998. The 28 revised full papers presented together with an invited talk were selected from a total of 78 submissions. The volume is devoted to conceptual foundations, development, and applications of tools and algorithms for the specification, verification, analysis, and construction of software and hardware systems. The papers are organized in sections on model checking, design and architecture, various applications, fielded applications, verification of real-time systems, mixed analysis techniques, and case studies and experience. TOC:The 28 revised full papers presented together with an invited talk were selected from a total of 78 submissions. The volume is devoted to conceptual foundations, development, and applications of tools and algorithms for the specification, verification, analysis, and construction of software and hardware systems. The papers are organized in sections on model checking, design and architecture, various applications, fielded applications, verification of real-time systems, mixed analysis techniques, and case studies and experience.

Produktdetails

• Lecture Notes in Computer Science Nr.1384
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 10632045, 978-3-540-64356-2
• 1998.
• Seitenzahl: 484
• Erscheinungstermin: 18. März 1998
• Englisch
• Abmessung: 235mm x 155mm x 27mm
• Gewicht: 620g
• ISBN-13: 9783540643562
• ISBN-10: 3540643567
• Artikelnr.: 09187833

Autorenporträt

Bernhard Steffen studierte Mathematik an der Christian-Albrechts Universität zu Kiel, wo er anschließend auch in der Informatik promovierte. Nach Forschungsaufenthalten am Laboratory for Foundations in Computer Science in Edinburgh und an der Universität Aarhus, wurde er 1990 an die RWTH Aachen berufen, von wo er 1993 an die Universität Passau auf den Lehrstuhl für Programmiersysteme wechselte. Seit 1997 leitet er den Lehrstuhl für Programmiersysteme und Compilerbau an der TU-Dortmund. Bernhard Steffen ist Gründer der internationalen Konferenz über Tools and Algorithm for the Conbstruction and Analysis of Systems (TACAS) und des internationalen Journals über Software Tools for Technology Transfer (STTT).

Inhaltsangabe

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/CÆSAR: 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.