First-order finite satisfiability vs tree automata in safety verification
Alexei LisitsaPublished in: CoRR (2011)
Keyphrases
- tree automata
- finite automata
- linear temporal logic
- bounded model checking
- closure properties
- model checking
- finite state
- regular expressions
- temporal logic
- satisfiability problem
- tree languages
- syntactic pattern recognition
- grammatical inference
- first order logic
- context free grammars
- context free
- finite automaton
- phase transition
- np complete
- knowledge based systems
- context sensitive
- quantified boolean formulas
- object oriented
- search space
- knowledge base
- propositional theories
- learning algorithm