Sciweavers

14 search results - page 1 / 3
» On Terminating Lemma Speculations
Sort
View
BIRTHDAY
2010
Springer
13 years 5 months ago
Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
Moa Johansson, Lucas Dixon, Alan Bundy
IANDC
2000
46views more  IANDC 2000»
13 years 5 months ago
On Terminating Lemma Speculations
Christoph Walther, Thomas Kolbe
SBACPAD
2007
IEEE
129views Hardware» more  SBACPAD 2007»
13 years 11 months ago
Predicting Loop Termination to Boost Speculative Thread-Level Parallelism in Embedded Applications
The necessity of devising novel thread-level speculation (TLS) techniques has become extremely important with the growing acceptance of multi-core architectures by the industry. H...
Md. Mafijul Islam
ENTCS
2006
125views more  ENTCS 2006»
13 years 5 months ago
An Even Closer Integration of Linear Arithmetic into Inductive Theorem Proving
To broaden the scope of decision procedures for linear arithmetic, they have to be integrated into theorem provers. Successful approaches e.g. in NQTHM or ACL2 suggest a close int...
Tobias Schmidt-Samoa
LOGCOM
2007
126views more  LOGCOM 2007»
13 years 5 months ago
A Structural Proof of the Soundness of Rely/guarantee Rules
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
Joey W. Coleman, Cliff B. Jones