Tools and algorithms for the construction and analysis of sytems : 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
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 invit...
Salvato in:
| Enti autori: | , |
|---|---|
| Altri autori: | |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
1384 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Tools and algorithms for the construction and analysis of sytems, 4th International Conference, TACAS '98, held as part of the joint European Conferences on Theory and Practice of Software, ETAPS '98, Lisbon, Portugal, March/April 1998, proceedings, Bernhard Steffen (ed.), 1998, Berlin, Springer, 1 vol. ( XIII-455 p.), Lecture notes in computer science, 3-540-64356-7 • Tools and Algorithms for the Construction and Analysis of Systems, Texte imprimé, 9783662214688 |
Sommario:
- 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.