Elementary first-order model checking for sparse graphs.
Jakub GajarskýMichal PilipczukMarek SokolowskiGiannos StamoulisSzymon TorunczykPublished in: LICS (2024)
Keyphrases
- model checking
- linear temporal logic
- temporal logic
- temporal epistemic
- formal verification
- finite state
- temporal properties
- model checker
- finite state machines
- verification method
- symbolic model checking
- partial order reduction
- formal specification
- automated verification
- epistemic logic
- timed automata
- concurrent systems
- formal methods
- process algebra
- reachability analysis
- computation tree logic
- pspace complete
- transition systems
- bounded model checking
- first order logic
- graph theory
- modal logic
- asynchronous circuits
- artificial intelligence
- set theory
- specification language
- planning domains