325 search results - page 17 / 65 » Rewriting Strategies in Java |
ICTAC
2004
Springer
15 years 3 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
CF
2008
ACM
14 years 11 months ago
2008
ACM
FM
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. This paper presents a Rewriting Logic framework that formalizes the interactions between Web servers and Web browsers through icating protocol abstracting HTTP. The propo...
FROCOS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
APN
2001
Springer
15 years 2 months ago
2001
Springer
We propose rewriting logic as a unifying framework for a wide range of Petri nets models. We treat in detail place/transition nets and important extensions of the basic model by in...