Sciweavers

837 search results - page 62 / 168
» Proof Development with OMEGA
Sort
View
ECAI
2004
Springer
14 years 1 months ago
Lakatos-Style Automated Theorem Modification
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
Simon Colton, Alison Pease
ASE
2002
160views more  ASE 2002»
13 years 9 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
CADE
2003
Springer
14 years 10 months ago
Proving Pointer Programs in Higher-Order Logic
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
Farhad Mehta, Tobias Nipkow
ITP
2010
137views Mathematics» more  ITP 2010»
14 years 1 months ago
Importing HOL Light into Coq
Abstract. We present a new scheme to translate mathematical developments from HOL Light to Coq, where they can be re-used and rechecked. By relying on a carefully chosen embedding ...
Chantal Keller, Benjamin Werner
ENTCS
2007
104views more  ENTCS 2007»
13 years 10 months ago
An Algebra of Pure Quantum Programming
We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previou...
Thorsten Altenkirch, Jonathan Grattage, Juliana Ka...