Sciweavers

157 search results - page 2 / 32
» Presenting Proofs with Adapted Granularity
Sort
View
IJCAI
1989
13 years 8 months ago
The Specialization and Transformation of Constructive Existence Proofs
The transformation of constructive program synthesis proofs is discussed and compared with the more traditional approaches to program transformation. An example system for adaptin...
Peter Madden
DASFAA
2009
IEEE
253views Database» more  DASFAA 2009»
13 years 11 months ago
Implementing and Optimizing Fine-Granular Lock Management for XML Document Trees
Abstract. Fine-grained lock protocols with lock modes and lock granules adjusted to the various XML processing models, allow for highly concurrent transaction processing on XML tre...
Sebastian Bächle, Theo Härder, Michael P...
KBSE
1999
IEEE
13 years 11 months ago
An Integration of Deductive Retrieval into Deductive Synthesis
Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of...
Bernd Fischer 0002, Jon Whittle
ITP
2010
161views Mathematics» more  ITP 2010»
13 years 11 months ago
Separation Logic Adapted for Proofs by Rewriting
We present a formalisation of separation logic which, by avoiding the use of existential quantifiers, allows proofs that only use standard equational rewriting methods as found in...
Magnus O. Myreen
BIRTHDAY
2005
Springer
14 years 1 months ago
Natural Language Proof Explanation
Abstract. State-of-the-art proof presentation systems suffer from several deficiencies. First, they simply present the proofs without motivating why the proof is done as it is do...
Armin Fiedler