12 search results - page 1 / 3 » Zapato: Automatic Theorem Proving for Predicate Abstraction ... |
CAV
2004
Springer
13 years 10 months ago
2004
Springer
JAR
2006
13 years 5 months ago
2006
We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem proving systems such as AC...
ENTCS
2008
13 years 5 months ago
2008
Petri nets are a formalism for modelling and validating critical systems. Generally, the approach to specification starts from an abstract view of the system under study. Once val...
TACAS
2010
Springer
13 years 2 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
CADE
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...