Sciweavers

425 search results - page 19 / 85
» The TPS Theorem Proving System
Sort
View
IJAIT
2006
106views more  IJAIT 2006»
14 years 9 months ago
An Empirical Evaluation of Automated Theorem Provers in Software Certification
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...
Ewen Denney, Bernd Fischer 0002, Johann Schumann
96
Voted
TCS
2008
14 years 9 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
61
Voted
BIRTHDAY
2010
Springer
14 years 7 months ago
Strict Canonical Constructive Systems
We define the notions of a canonical inference rule and a canonical constructive system in the framework of strict single-conclusion Gentzen-type systems (or, equivalently, natural...
Arnon Avron, Ori Lahav
AAI
2010
94views more  AAI 2010»
14 years 4 months ago
Sequence-Indexed Linear-Time Temporal Logic: Proof System and Application
In this paper, we propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequence-indexed linear-time temp...
Ken Kaneiwa, Norihiro Kamide
CADE
2012
Springer
13 years 1 days ago
Taming Past LTL and Flat Counter Systems
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
Stéphane Demri, Amit Kumar Dhar, Arnaud San...