1894 search results - page 49 / 379 » A TLA Proof System |
122
Voted
ICFP
2005
ACM
16 years 18 days ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
98
Voted
ESOP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
110
click to vote
CRYPTO
2008
Springer
15 years 2 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
106
Voted
RTA
2010
Springer
15 years 4 months ago
2010
Springer
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...
100
Voted
CCS
2009
ACM
16 years 1 months ago
2009
ACM
Distributed proof construction protocols have been shown to be valuable for reasoning about authorization decisions in open distributed environments such as pervasive computing sp...