5499 search results - page 39 / 1100 » Generalized Rewrite Theories |
IJRR
2011
13 years 2 months ago
2011
SAC
2009
ACM
14 years 2 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
JUCS
2006
13 years 7 months ago
2006
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
FM
2009
Springer
13 years 5 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...
ENTCS
2007
13 years 7 months ago
2007
Soft constraints extend classical constraints to deal with non-functional requirements, overconstrained problems and preferences. Bistarelli, Montanari and Rossi have developed a ...