1322 search results - page 75 / 265 » Unsound Theorem Proving |
110
click to vote
IJAIT
2006
14 years 12 months ago
2006
We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligatio...
107
click to vote
TCS
2008
14 years 11 months ago
2008
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...
DAM
1998
14 years 11 months ago
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
108
click to vote
MPC
2010
Springer
15 years 4 months ago
2010
Springer
We show a new and constructive proof of the two-squares theorem, based on a somewhat unusual, but very effective, way of rewriting the so-called extended Euclid’s algorithm. Rat...
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...