20 search results - page 2 / 4 » Formalizing Rewriting in the ACL2 Theorem Prover |
CAV
1998
Springer
14 years 23 days ago
1998
Springer
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...
ITP
2010
14 years 13 days ago
2010
We present a formalisation of separation logic which, by avoiding the use of existential quantifiers, allows proofs that only use standard equational rewriting methods as found in...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
FMCAD
2008
Springer
13 years 10 months ago
2008
Springer
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...
CADE
2002
Springer
14 years 8 months ago
2002
Springer
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...