442 search results - page 19 / 89 » Proof Abstraction for Imperative Languages |
103
Voted
ASIACRYPT
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...
126
click to vote
LACL
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
104
click to vote
ESOP
2001
Springer
15 years 6 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...
206
Voted
POPL
2007
ACM
16 years 2 months ago
2007
ACM
Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent da...
136
Voted
ASM
2010
ASM
15 years 4 months ago
2010
ASM
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...