Deadlock and starvation free reentrant readers-writers: A case study combining model checking with theorem proving.
Bernard van GastelLeonard LensinkSjaak SmetsersMarko C. J. D. van EekelenPublished in: Sci. Comput. Program. (2011)
Keyphrases
- model checking
- theorem proving
- timed automata
- temporal logic
- automated reasoning
- automated verification
- theorem prover
- formal specification
- formal verification
- first order logic
- inference rules
- parallel search
- model checker
- epistemic logic
- decision procedures
- temporal properties
- finite state machines
- computation tree logic
- verification method
- symbolic model checking
- geometry theorem proving
- formal methods
- bounded model checking
- consequence finding
- transition systems
- proof planning
- proof search
- knowledge base
- pspace complete
- reasoning tasks