Sciweavers

2000 search results - page 8 / 400
» Program Transformation and Proof Transformation
Sort
View
ISMVL
1999
IEEE
90views Hardware» more  ISMVL 1999»
13 years 11 months ago
Transformations between Signed and Classical Clause Logic
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
TOPLAS
1998
133views more  TOPLAS 1998»
13 years 7 months ago
A Systematic Study of Functional Language Implementations
Abstract: We introduce a unified framework to describe, relate, compare and classify functional language implementations. The compilation process is expressed as a succession of p...
Rémi Douence, Pascal Fradet
POPL
2012
ACM
12 years 2 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
CASES
2010
ACM
13 years 5 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
MKM
2007
Springer
14 years 1 months ago
Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case
In this paper we address the problem of reconstructing a higher order, checkable proof object starting from a proof trace left by a first order automatic proof searching procedure...
Andrea Asperti, Enrico Tassi