Sciweavers

490 search results - page 13 / 98
» Automated Generalization of Translation Examples
Sort
View
CORR
2007
Springer
80views Education» more  CORR 2007»
13 years 7 months ago
Polygraphs for termination of left-linear term rewriting systems
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
Yves Guiraud
POPL
2010
ACM
14 years 5 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner
CADE
2008
Springer
14 years 8 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
GG
2010
Springer
13 years 6 months ago
Formal Analysis of Functional Behaviour for Model Transformations Based on Triple Graph Grammars
Abstract. Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already cruc...
Frank Hermann, Hartmut Ehrig, Fernando Orejas, Ulr...
ICCV
2003
IEEE
14 years 9 months ago
An affine invariant deformable shape representation for general curves
Automatic construction of Shape Models from examples has been the focus of intense research during the last couple of years. These methods have proved to be useful for shape segme...
Anders Ericsson, Kalle Åström