142 search results - page 13 / 29 » A Small Framework for Proof Checking |
GI
2001
Springer
15 years 1 months ago
2001
Springer
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
106
click to vote
CSFW
2002
IEEE
15 years 2 months ago
2002
IEEE
We carry forward the work described in our previous papers [3, 14, 12] on the application of data independence to the model checking of cryptographic protocols using CSP [13] and ...
ISTCS
1995
Springer
15 years 1 months ago
1995
Springer
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...
183
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
POPL
2010
ACM
14 years 9 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...