429 search results - page 23 / 86 » Theorem Proving Languages for Verification |
FMCAD
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We present a simple method for verifying the safety properties of cache coherence protocols with arbitrarily many nodes. Our presentation begins with two examples. The fi...
76
Voted
TAPSOFT
1991
Springer
15 years 2 months ago
1991
Springer
An operational and a denotational semantic model are presented for a real-time programming language incorporating the concept of integration. This concept of integration, which ha...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
125
click to vote
JAR
2008
14 years 11 months ago
2008
This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Be...
165
Voted
POPL
2008
ACM
15 years 11 months ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...