5499 search results - page 21 / 1100 » Generalized Rewrite Theories |
ENTCS
2007
15 years 1 months ago
2007
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...
107
click to vote
LICS
2005
IEEE
15 years 7 months ago
2005
IEEE
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...
112
click to vote
ICFP
2008
ACM
16 years 1 months ago
2008
ACM
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...
217
click to vote
POPL
2005
ACM
16 years 2 months ago
2005
ACM
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...
115
click to vote
TAGT
1994
Springer
15 years 6 months ago
1994
Springer
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...