Sciweavers

28 search results - page 1 / 6
» Pattern-based Rewriting through Abstraction
Sort
View
CADE
2008
Springer
14 years 5 months ago
Modularity of Confluence
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...
Vincent van Oostrom
ECSA
2007
Springer
13 years 11 months ago
Pattern-Based Evolution of Software Architectures
Abstract. We propose a pattern-based software development method comprising analysis (using problem frames) and design (using architectural and design patterns), of which especiall...
Isabelle Côté, Maritta Heisel, Ina We...
PLILP
1995
Springer
13 years 8 months ago
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming
Abstract. Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature la...
Koichi Nakahara, Aart Middeldorp, Tetsuo Ida
ASIAN
1998
Springer
101views Algorithms» more  ASIAN 1998»
13 years 9 months ago
The Rewriting Calculus as a Semantics of ELAN
call it, provides abstraction through the rewriting arrow and explicit rule application. It also embeds the notion of sets of results to deal with non-deterministic computations. F...
Horatiu Cirstea, Claude Kirchner
AMAST
2006
Springer
13 years 8 months ago
State Space Reduction of Rewrite Theories Using Invisible Transitions
Abstract. State space explosion is the hardest challenge to the effective application of model checking methods. We present a new technique for achieving drastic state space reduct...
Azadeh Farzan, José Meseguer