Sciweavers

301 search results - page 13 / 61
» On extensions of a theorem of Baxter
Sort
View
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 5 months ago
Rewriting and Well-Definedness within a Proof System
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
Issam Maamria, Michael Butler
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 7 months ago
On combinations of local theory extensions
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
Viorica Sofronie-Stokkermans
TPHOL
1999
IEEE
13 years 11 months ago
Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
Mark Aagaard, Robert B. Jones, Carl-Johan H. Seger
IANDC
2008
81views more  IANDC 2008»
13 years 7 months ago
Universal extensions to simulate specifications
A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi and Lamport and proved the formalism to be semantically complete: every simulat...
Wim H. Hesselink
AMAI
2007
Springer
13 years 7 months ago
Decision procedures for extensions of the theory of arrays
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...