1894 search results - page 155 / 379 » A TLA Proof System |
143
click to vote
ASE
2002
15 years 3 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
137
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitioni...
127
Voted
CADE
2002
Springer
16 years 4 months ago
2002
Springer
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
175
click to vote
AFRICACRYPT
2010
Springer
15 years 10 months ago
2010
Springer
A fair blind signature is a blind signature with revocable anonymity and unlinkability, i.e., an authority can link an issuing session to the resulting signature and trace a signat...
136
Voted
TASE
2009
IEEE
15 years 10 months ago
2009
IEEE
—Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to...