12774 search results - page 92 / 2555 » A Framework for Proof Systems |
TYPES
2004
Springer
14 years 2 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
FORMATS
2008
Springer
13 years 10 months ago
2008
Springer
Verification of partially synchronous distributed systems is difficult because of inherent concurrency and the potentially large state space of the channels. This paper identifies ...
CONCUR
1995
Springer
14 years 15 days ago
1995
Springer
We develop a theory of bisimulation equivalence for the broadcast calculus CBS. Both the strong and weak versions of bisimulation congruence we study are justi ed in terms of a cha...
FSTTCS
2005
Springer
14 years 2 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
EUROCRYPT
2008
Springer
13 years 10 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...