Sciweavers

173 search results - page 9 / 35
» A Proof of the Two-path Conjecture
Sort
View
RSA
2011
106views more  RSA 2011»
12 years 10 months ago
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
Luc Devroye, Svante Janson
FSTTCS
2008
Springer
13 years 8 months ago
Sound Lemma Generation for Proving Inductive Validity of Equations
ABSTRACT. In many automated methods for proving inductive theorems, finding a suitable generalization of a conjecture is a key for the success of proof attempts. On the other hand...
Takahito Aoto
CADE
2003
Springer
14 years 7 months ago
IsaPlanner: A Prototype Proof Planner in Isabelle
IsaPlanner is a generic framework for proof planning in the interactive theorem prover Isabelle. It facilitates the encoding of reasoning techniques, which can be used to conjectur...
Lucas Dixon, Jacques D. Fleuriot
ENDM
2007
104views more  ENDM 2007»
13 years 7 months ago
Matching graphs of Hypercubes and Complete Bipartite Graphs
Kreweras’ conjecture [9] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle of Qd. We [5] proved this conjecture but here we present ...
Jirí Fink
ICFEM
2004
Springer
14 years 25 days ago
Formal Proof from UML Models
Abstract. We present a practical approach to a formal analysis of UMLbased models. This is achieved by an underlying formal representation in Z, which allows us to pose and dischar...
Nuno Amálio, Susan Stepney, Fiona Polack