1894 search results - page 99 / 379 » A TLA Proof System |
94
Voted
IJFCS
2008
15 years 24 days ago
2008
Abstract. We present an approach to verification of parameterized systems, which is based on program transformation technique known as supercompilation. In this approach the statem...
109
Voted
JCS
2007
15 years 21 days ago
2007
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have specified an information flow ty...
104
Voted
CRYPTO
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. This paper introduces simulatable verifiable random functions (sVRF). VRFs are similar to pseudorandom functions, except that they are also verifiable: corresponding to...
119
click to vote
CORR
2010
Springer
15 years 26 days ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
91
Voted
AMAI
2005
Springer
15 years 21 days ago
2005
Springer
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...