425 search results - page 69 / 85 » The TPS Theorem Proving System |
132
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...
105
click to vote
KBSE
2000
IEEE
15 years 1 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
142
click to vote
PEPM
2007
ACM
16 years 7 months ago
2007
ACM
programming languages community is vigorously pursuing ways to incorporate F!-style indexed types into programming languages. This paper advocates Concoqtion, a practical approach ...
LICS
2003
IEEE
15 years 2 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
88
Voted
CAV
2001
Springer
15 years 2 months ago
2001
Springer
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...