Sciweavers

426 search results - page 16 / 86
» Specification, Abduction, and Proof
Sort
View
IWFM
1998
13 years 11 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
TCS
2008
13 years 10 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
LISP
2008
165views more  LISP 2008»
13 years 10 months ago
Adapting functional programs to higher order logic
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
Scott Owens, Konrad Slind
FOCS
1992
IEEE
14 years 2 months ago
Probabilistic Checking of Proofs; A New Characterization of NP
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
Sanjeev Arora, Shmuel Safra
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 10 months ago
Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps
This paper presents a formalized proof of a discrete form of the Jordan Curve Theorem. It is based on a hypermap model of planar subdivisions, formal specifications and proofs assi...
Jean-François Dufourd