191 search results - page 28 / 39 » Propositional theories are strongly equivalent to logic prog... |
113
click to vote
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
111
Voted
VMCAI
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
181
Voted
POPL
2009
ACM
15 years 10 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
TLDI
2009
ACM
15 years 6 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
71
Voted
FUIN
2010
14 years 8 months ago
2010
Abstract. Current methods for solving games embody a form of “procedural rationality” that invites logical analysis in its own right. This paper is a brief case study of Backwa...