Sciweavers

99 search results - page 11 / 20
» Proving Self-Stabilization with a Proof Assistant
Sort
View
PEPM
2010
ACM
13 years 9 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...
MICS
2008
129views more  MICS 2008»
13 years 7 months ago
ATP-based Cross-Verification of Mizar Proofs: Method, Systems, and First Experiments
Mizar is a proof assistant used for formalization and mechanical verification of mathematics. The main use of Mizar is in the development of the Mizar Mathematical Library (MML), i...
Josef Urban, Geoff Sutcliffe
TCS
2008
13 years 7 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd
COGSYS
2005
Springer
13 years 9 months ago
Natural Language Dialog with a Tutor System for Mathematical Proofs
Abstract. Natural language interaction between a student and a tutoring or an assistance system for mathematics is a new multi-disciplinary challenge that requires the interaction ...
Christoph Benzmüller, Helmut Horacek, Ivana K...
LPAR
2010
Springer
13 years 6 months ago
Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
Jasmin Christian Blanchette, Koen Claessen