Sciweavers

4767 search results - page 7 / 954
» Structures for Abstract Rewriting
Sort
View
ALP
1992
Springer
13 years 11 months ago
Definitional Trees
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
Sergio Antoy
RTA
2005
Springer
14 years 28 days ago
Proving Positive Almost-Sure Termination
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
Olivier Bournez, Florent Garnier
GG
2004
Springer
14 years 25 days ago
Parallel Independence in Hierarchical Graph Transformation
Abstract. Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical...
Annegret Habel, Berthold Hoffmann
CSFW
2002
IEEE
14 years 13 days ago
A Formal Analysis of Some Properties of Kerberos 5 Using MSR
We formalize aspects of the Kerberos 5 authentication protocol in the Multi-Set Rewriting formalism (MSR) on two levels of detail. The more detailed formalization reflects the in...
Frederick Butler, Iliano Cervesato, Aaron D. Jagga...