Sciweavers

425 search results - page 18 / 85
» The TPS Theorem Proving System
Sort
View
CADE
1990
Springer
15 years 5 months ago
Presenting Intuitive Deductions via Symmetric Simplification
In automated deduction systems that are intended for human use, the presentation of a proof is no less important than its discovery. For most of today's automated theorem pro...
Frank Pfenning, Dan Nesmith
221
Voted
PADL
2009
Springer
16 years 2 months ago
Declarative Network Verification
Abstract. In this paper, we present our initial design and implementation of a declarative network verifier (DNV). DNV utilizes theorem proving, a well established verification tec...
Anduo Wang, Prithwish Basu, Boon Thau Loo, Oleg So...
COMBINATORICS
2002
70views more  COMBINATORICS 2002»
15 years 1 months ago
Set-Systems with Restricted Multiple Intersections
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, ...
Vince Grolmusz
EUC
2005
Springer
15 years 7 months ago
Dependable Polygon-Processing Algorithms for Safety-Critical Embedded Systems
Algorithms that process geometric objects become more and more important for many safety-critical embedded systems, e.g. for motion planning or collision detection, where correctne...
Jens Brandt, Klaus Schneider
CIIA
2009
15 years 2 months ago
LCF-style for Secure Verification Platform based on Multiway Decision Graphs
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
Sa'ed Abed, Otmane Aït Mohamed