Lazy Theorem Proving for Bounded Model Checking over Infinite Domains.
Leonardo Mendonça de MouraHarald RueßMaria SoreaPublished in: CADE (2002)
Keyphrases
- theorem proving
- bounded model checking
- automated deduction
- model checking
- first order logic
- automated reasoning
- formal verification
- decision procedures
- term rewriting
- theorem prover
- proof planning
- inference rules
- automatic programming
- parallel search
- linear temporal logic
- automated theorem proving
- geometry theorem proving
- consequence finding
- timed automata
- equational theories
- combinatorial search
- temporal logic
- proof procedure
- proof search
- logical inference
- multi agent
- heuristic search
- simulated annealing
- domain specific