Exploiting Heap Symmetries in Explicit-State Model Checking of Software.
Radu IosifPublished in: ASE (2001)
Keyphrases
- model checking
- temporal logic
- finite state machines
- transition systems
- formal verification
- temporal properties
- formal methods
- model checker
- automated verification
- formal specification
- finite state
- symbolic model checking
- verification method
- computation tree logic
- reactive systems
- reachability analysis
- partial order reduction
- data structure
- software systems
- process algebra
- deterministic finite automaton
- timed automata
- asynchronous circuits
- software architecture
- source code
- pspace complete
- concurrent systems
- epistemic logic
- state space