TACAS 1998
29 papers
- A Proof of Burns N-Process Mutual Exclusion Algorithm Using Abstraction
- A Verified Model Checker for the Modal µ-calculus in Coq
- Automated Verification of Szymanski's Algorithm
- Combining Finite Automata, Parallel Programs and SDL Using Petri Nets
- Deciding Fixed and Non-fixed Size Bit-vectors
- Detecting Races in Relay Ladder Logic Programs
- Efficient Modeling of Memory Arrays in Symbolic Ternary Simulation
- Experience with Literate Programming in the Modelling and Validation of Systems
- Exploiting Symmetry in Linear Time Temporal Logic Model Checking: One Step Beyond
- Factotum: Automatic and Systematic Sharing Support for Systems Analyzers
- Formal Design and Analysis of a Gear Controller
- Formal Verification of Pipelined Processors
- Formal Verification of SDL Systems at the Siemens Mobile Phone Department
- Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract)
- MESA: Support for Scenario-Based Design of Concurrent Systems
- Model Checking of Real-Time Reachability Properties Using Abstractions
- Model Checking via Reachability Testing for Timed Automata
- Modeling and Verification of SC++ Applications
- Modular Model Checking of Software
- OPEN/CÆSAR: An OPen Software Architecture for Verification, Simulation, and Testing
- Practical Model-Checking Using Games
- Set-Based Analysis of Reactive Infinite-State Systems
- Static Partial Order Reduction
- Symbolic Exploration of transition Hierarchies
- Tamagotchis Need Not Die - Verification of STATEMENT Design
- Translation Validation
- Verification Based on Local States
- Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
- Verifying Networks of Timed Processes (Extended Abstract)