Sciweavers

3658 search results - page 61 / 732
» The logic of proofs, semantically
Sort
View
ESOP
2009
Springer
14 years 4 months ago
Deny-Guarantee Reasoning
Abstract. Rely-guarantee is a well-established approach to reasoning about concurrent programs that use parallel composition. However, parallel composition is not how concurrency i...
Mike Dodds, Xinyu Feng, Matthew J. Parkinson, Vikt...
CADE
2008
Springer
14 years 9 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
CADE
2006
Springer
14 years 9 months ago
Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresulta...
Assia Mahboubi
RTA
1999
Springer
14 years 1 months ago
On the Strong Normalisation of Natural Deduction with Permutation-Conversions
We present a modular proof of the strong normalisation of intuitionistic logic with permutation-conversions. This proof is based on the notions of negative translation and CPS-simu...
Philippe de Groote
TPHOL
2005
IEEE
14 years 2 months ago
A Structured Set of Higher-Order Problems
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
Christoph Benzmüller, Chad E. Brown