6978 search results - page 206 / 1396 » On Proofs in System P |
190
click to vote
TYPES
2004
Springer
15 years 12 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...
181
click to vote
FORMATS
2008
Springer
15 years 8 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 ...
168
click to vote
CONCUR
1995
Springer
15 years 10 months 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...
140
click to vote
KIVS
2005
Springer
16 years 1 days ago
2005
Springer
: Almost all current P2P applications are built as monolithic systems: they tightly couple application software with an underlying P2P technology. For simple P2P applications like ...
159
click to vote
COCO
1994
Springer
15 years 10 months ago
1994
Springer
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...