Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CADE
2007
Springer
12 years 11 hour ago
Formal Device and Programming Model for a Serial Interface
Abstract. The verification of device drivers is essential for the pervasive verification of an operating system. To show the correctness of device drivers, devices have to be forma...
Eyad Alkassar, Mark A. Hillebrand, Steffen Knapp, ...
CADE
2007
Springer
12 years 11 hour ago
A Termination Checker for Isabelle Hoare Logic
Abstract. Hoare logic is widely used for software specification and verification. Frequently we need to prove the total correctness of a program: to prove that the program not only...
Jia Meng, Lawrence C. Paulson, Gerwin Klein
CADE
2007
Springer
12 years 11 hour ago
MaLARea: a Metasystem for Automated Reasoning in Large Theories
MaLARea (a Machine Learner for Automated Reasoning) is a simple metasystem iteratively combining deductive Automated Reasoning tools (now the E and the SPASS ATP systems) with a m...
Josef Urban
CADE
2007
Springer
12 years 11 hour ago
First Order Reasoning on a Large Ontology
We present results of our work on using first order theorem proving to reason over a large ontology (the Suggested Upper Merged Ontology ? SUMO), and methods for making SUMO suita...
Adam Pease, Geoff Sutcliffe
CADE
2007
Springer
12 years 11 hour ago
Certified Size-Change Termination
We develop a formalization of the Size-Change Principle in Isabelle/HOL and use it to construct formally certified termination proofs for recursive functions automatically.
Alexander Krauss
CADE
2007
Springer
12 years 11 hour ago
Predictive Labeling with Dependency Pairs Using SAT
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
Adam Koprowski, Aart Middeldorp
CADE
2007
Springer
12 years 11 hour ago
Automated Reasoning in Kleene Algebra
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
Georg Struth, Peter Höfner
CADE
2007
Springer
12 years 11 hour ago
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitioni...
Samuli Heilala, Brigitte Pientka
CADE
2007
Springer
12 years 11 hour ago
Formalization of Continuous Probability Distributions
Continuous probability distributions are widely used to mathematically describe random phenomena in engineering and physical sciences. In this paper, we present a methodology that ...
Osman Hasan, Sofiène Tahar
books