1894 search results - page 220 / 379 » A TLA Proof System |
156
click to vote
CCS
2003
ACM
15 years 9 months ago
2003
ACM
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...
147
click to vote
ICTCS
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
130
click to vote
ECBS
2000
IEEE
15 years 9 months ago
2000
IEEE
The design of a large component-based software system typically involves the composition of different components. Instead of relying on a free composition of components, we advoca...
142
click to vote
ICFP
2000
ACM
15 years 9 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
122
click to vote
CAV
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Any formalmethodor tool is almostcertainlymoreoftenapplied in situationswheretheoutcomeis failure(acounterexample)rather than success (a correctness proof). We present a ...