Computer Aided Verification

@inproceedings{Clarke1998ComputerAV,
  title={Computer Aided Verification},
  author={Edmund M. Clarke and Robert P. Kurshan},
  booktitle={Lecture Notes in Computer Science},
  year={1998}
}
Theorem proving and model checking are powerful tools that can verify the logical correctness of today's ICs or find their hidden bugs. Today, the first computer-aided verification tools are becoming commercially available. They are based on methods that in many cases can reduce the complexity of verification (without sacrificing guaranteed correctness) to such a degree that it becomes computationally feasible. Among the most powerful of these methods are symbolic model-checking and homomorphic… 
Principles of model checking
TLDR
Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.
Formal specification and verification of safety interlock systems: A comparative case study
TLDR
The design of mathematical models as a basis for the implementation of error-free software for the safety interlock system at iThemba LABS and the comparison of formal method techniques that addresses the lack of much-needed empirical studies in the field of formal methods are addressed.
Linear-Time Model Checking: Automata Theory in Practice
TLDR
The fundamentals of automata-theoretic model checking are reviewed, the reduction of the theory to practice is reviewed, and areas that require further research are outlined.
Quantified Computation Tree Logic
A Study of Practice Issues in Model-Based Verification Using the Symbolic Model Verifier (SMV)
TLDR
A case study into practice issues involved in using the Symbolic Model Verifier (SMV) for model checking software systems of a Simplex implementation for reliable system upgrade.
Bisimulation and Model Checking
TLDR
It is concluded that bisimulation minimization does not appear to be viable in the context of invariance verification because performing the minimization requires as many, if not more, computational resources as model checking the unminimized system through backwards reachability.
Counter-Example Guided Predicate Abstraction of Hybrid Systems
TLDR
This paper presents the basic techniques for discovering new predicates that will rule out closely related spurious counter-examples, optimizations of these techniques, implementation of these in the verification tool, and case studies demonstrating the promise of the approach.
Predicate abstraction for reachability analysis of hybrid systems
TLDR
Algorithms and tools for reachability analysis of hybrid systems are presented by combining the notion of predicate abstraction with recent techniques for approximating the set of reachable states of linear systems using polyhedra, and it is shown that predicate abstraction of hybrid system can be used to prove bounded safety.
Efficient Reachability Analysis of Hierarchical Reactive Machines
TLDR
This work reports on an implementation of a visual hierarchical language with modular features such as nested modes, variable scoping, mode reuse, exceptions, group transitions, and history, and identifies a variety of heuristics to exploit these modular features during reachability analysis.
An environment for model-checking of logic control systems with hybrid dynamics
TLDR
The modeling environment VERDICT is presented which intends to make the method of formal verification applicable to logic controlled chemical plants, and offers textual and graphical editors to set up models of plant and controller.
...
...

References

SHOWING 1-2 OF 2 REFERENCES
Automatic verification of finite-state concurrent systems using temporal logic specifications
TLDR
It is argued that this technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite-state concurrent systems.
For a description of current technical activity in formal verification, see the Web site of the DIMACS Special Year on Logic and Algorithms
  • For a description of current technical activity in formal verification, see the Web site of the DIMACS Special Year on Logic and Algorithms