Sciweavers

13383 search results - page 166 / 2677
» Abstractions from proofs
Sort
View
VMCAI
2007
Springer
16 years 19 days ago
Constraint Solving for Interpolation
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...
Andrey Rybalchenko, Viorica Sofronie-Stokkermans
IWFM
1998
15 years 7 months ago
Formal Engineering of the Bitonic Sort using PVS
In this paper, we present a proof that the bitonic sort is sound using PVS, a powerful specification and verification environment. First, we briefly introduce this well-known para...
Raphaël Couturier
FMSD
2006
103views more  FMSD 2006»
15 years 6 months ago
Cones and foci: A mechanical framework for protocol verification
We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between ...
Wan Fokkink, Jun Pang, Jaco van de Pol
JAPLL
2007
86views more  JAPLL 2007»
15 years 6 months ago
Using logical relevance for question answering
We propose a novel method of determining the appropriateness of an answer to a question through a proof of logical relevance rather than a logical proof of truth. We define logic...
Marco De Boni
LPAR
2010
Springer
15 years 4 months ago
On the Equality of Probabilistic Terms
We consider a mild extension of universal algebra in which terms are built both from deterministic and probabilistic variables, and are interpreted as distributions. We formulate a...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...