1894 search results - page 159 / 379 » A TLA Proof System |
118
click to vote
LICS
1990
IEEE
15 years 8 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
158
click to vote
CSFW
2007
IEEE
15 years 8 months ago
2007
IEEE
We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-l...
127
Voted
STOC
1995
ACM
15 years 7 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
148
click to vote
ESOP
2008
Springer
15 years 5 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
120
click to vote
ESORICS
2008
Springer
15 years 5 months ago
2008
Springer
In authorization, there is often a wish to shift the burden of proof to those making requests, since they may have more resources and more specific knowledge to construct the requi...