10 search results - page 2 / 2 » Caching and Lemmaizing in Model Elimination Theorem Provers |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The ...
POPL
2010
ACM
15 years 6 months ago
2010
ACM
This paper presents a method for creating formally correct just-intime (JIT) compilers. The tractability of our approach is demonstrated through, what we believe is the first, ver...
TPHOL
2007
IEEE
15 years 3 months ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
131
click to vote
CAV
1998
Springer
15 years 1 months 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...
ENTCS
2006
14 years 9 months ago
2006
Consistency checking in the CSP B approach verifies that an individual controller process, defined using a sequential non-divergent subset of CSP, never calls a B operation outsid...