Sciweavers

11740 search results - page 68 / 2348
» More Problems in Rewriting
Sort
View
GG
2010
Springer
13 years 11 months ago
Local Confluence for Rules with Nested Application Conditions
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
Hartmut Ehrig, Annegret Habel, Leen Lambers, Ferna...
ECEASST
2006
96views more  ECEASST 2006»
13 years 10 months ago
Optimizing Pattern Matching Compilation by Program Transformation
Motivated by the promotion of rewriting techniques and their use in major industrial applications, we have designed Tom: a pattern matching layer on top of conventional programming...
Emilie Balland, Pierre-Etienne Moreau
CADE
2010
Springer
13 years 9 months ago
Monotonicity Criteria for Polynomial Interpretations over the Naturals
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
Friedrich Neurauter, Aart Middeldorp, Harald Zankl
ICCS
2009
Springer
13 years 7 months ago
Dynamic Software Updates for Accelerating Scientific Discovery
Distributed parallel applications often run for hours or even days before arriving to a result. In the case of such long-running programs, the initial requirements could change aft...
Dong Kwan Kim, Myoungkyu Song, Eli Tilevich, Calvi...
ICSE
2001
IEEE-ACM
14 years 2 months ago
Using Transformation Systems for Software Maintenance and Reengineering
Software maintenance costs dominate software engineering costs, partly because most such engineering is done manually. Program Transformation tools leverage an engineer-provided b...
Ira D. Baxter