Complexity of Model-Checking Call-by-Value Programs.
Takeshi TsukadaNaoki KobayashiPublished in: FoSSaCS (2014)
Keyphrases
- model checking
- pspace complete
- temporal logic
- formal verification
- temporal properties
- finite state machines
- formal specification
- finite state
- model checker
- symbolic model checking
- automated verification
- verification method
- timed automata
- transition systems
- reachability analysis
- partial order reduction
- bounded model checking
- asynchronous circuits
- epistemic logic
- satisfiability problem
- formal methods
- concurrent systems
- abstract interpretation
- computation tree logic
- process algebra
- np complete
- computational complexity
- decision problems
- alternating time temporal logic
- situation calculus
- software engineering