3552 search results - page 71 / 711 » Proof theory in the abstract |
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
159
click to vote
SAGT
2009
Springer
16 years 22 days ago
2009
Springer
Roberts’ theorem from 1979 states that the only incentive compatible mechanisms over a full domain and range of at least 3 are weighted variants of the VCG mechanism termed affin...
151
click to vote
APLAS
2005
ACM
15 years 11 months ago
2005
ACM
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
174
click to vote
CSFW
2010
IEEE
15 years 9 months ago
2010
IEEE
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...
138
click to vote
ASM
2005
ASM
15 years 11 months ago
2005
ASM
lation of BGS model of Abstract State Machines Comandur Seshadhri1 , Anil Seth2 , and Somenath Biswas2 1 Department of Computer Science Princeton University, Princeton NJ 08544, US...