Sciweavers

5499 search results - page 21 / 1100
» Generalized Rewrite Theories
Sort
View
ENTCS
2007
93views more  ENTCS 2007»
13 years 7 months ago
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...
Dominique Duval, Rachid Echahed, Fréd&eacut...
LICS
2005
IEEE
14 years 1 months ago
Reactive Systems over Cospans
The theory of reactive systems, introduced by Leifer and Milner and previously extended by the authors, allows the derivation of well-behaved labelled transition systems (LTS) for...
Vladimiro Sassone, Pawel Sobocinski
ICFP
2008
ACM
14 years 7 months ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss
POPL
2005
ACM
14 years 8 months ago
Context logic and tree update
Spatial logics have been used to describe properties of treelike structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separatio...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
TAGT
1994
Springer
154views Graph Theory» more  TAGT 1994»
13 years 11 months ago
Issues in the Practical Use of Graph Rewriting
Graphs are a popular data structure, and graph-manipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graph-rewriting notat...
Dorothea Blostein, Hoda Fahmy, Ann Grbavec