Approximate reachability don't cares for CTL model checking.
In-Ho MoonJae-Young JangGary D. HachtelFabio SomenziJun YuanCarl PixleyPublished in: ICCAD (1998)
Keyphrases
- model checking
- temporal logic
- computation tree logic
- temporal properties
- finite state
- formal verification
- automated verification
- formal specification
- finite state machines
- model checker
- partial order reduction
- bounded model checking
- pspace complete
- symbolic model checking
- formal methods
- transition systems
- timed automata
- verification method
- reachability analysis
- concurrent systems
- state space
- linear temporal logic
- process algebra
- abstract interpretation
- inference rules
- decision problems
- temporal epistemic