Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion.
Jan van den HeuvelStephan KreutzerMichal PilipczukDaniel A. QuirozRoman RabinovichSebastian SiebertzPublished in: LICS (2017)
Keyphrases
- model checking
- linear temporal logic
- temporal logic
- bounded degree
- formal verification
- finite state
- linear time temporal logic
- temporal properties
- automated verification
- model checker
- formal specification
- symbolic model checking
- verification method
- process algebra
- reachability analysis
- horn clauses
- epistemic logic
- transition systems
- timed automata
- formal methods
- bounded model checking
- bounded treewidth
- concurrent systems
- computation tree logic
- first order logic
- graph theory
- np complete
- reactive systems
- asynchronous circuits
- action theories