12774 search results - page 380 / 2555 » A Framework for Proof Systems |
178
click to vote
CADE
2007
Springer
16 years 7 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...
168
click to vote
CADE
2002
Springer
16 years 7 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...
225
click to vote
AFRICACRYPT
2010
Springer
16 years 1 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...
178
click to vote
TASE
2009
IEEE
16 years 1 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...
165
click to vote
ICFEM
2009
Springer
16 years 1 months ago
2009
Springer
It is believed that reusability in formal development should reduce the time and cost of formal modelling within a production environment. Along with the ability to reuse formal mo...