Tools and Algorithms for the Construction and Analysis of Systems
Editat de Bernhard Steffenen Limba Engleză Paperback – 18 mar 1998
Preț: 331.59 lei
Preț vechi: 414.49 lei
-20%
Puncte Express: 497
Carte tipărită la comandă
Livrare economică 08-22 iunie
Specificații
ISBN-13: 9783540643562
ISBN-10: 3540643567
Pagini: 484
Ilustrații: XV, 461 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.73 kg
Ediția:1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540643567
Pagini: 484
Ilustrații: XV, 461 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.73 kg
Ediția:1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.