Sciweavers

6978 search results - page 294 / 1396
» On Proofs in System P
Sort
View
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
JUCS
2008
182views more  JUCS 2008»
15 years 6 months ago
Modularizing Theorems for Software Product Lines: The Jbook Case Study
: A goal of software product lines is the economical assembly of programs in a family of programs. In this paper, we explore how theorems about program properties may be integrated...
Don S. Batory, Egon Börger
STOC
2004
ACM
78views Algorithms» more  STOC 2004»
16 years 7 months ago
Robust pcps of proximity, shorter pcps and applications to coding
We continue the study of the trade-off between the length of PCPs and their query complexity, establishing the following main results (which refer to proofs of satisfiability of c...
Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, M...
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
16 years 8 days ago
Derandomized Squaring of Graphs
We introduce a “derandomized” analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squar...
Eyal Rozenman, Salil P. Vadhan
TAPSOFT
1987
Springer
15 years 10 months ago
Induction Principles Formalized in the Calculus of Constructions
The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn [2, 3], Girard [12], Martin...
Gérard P. Huet