Sciweavers

500 search results - page 88 / 100
» ACD Term Rewriting
Sort
View
AGP
1997
IEEE
15 years 1 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
94
Voted
RTA
2010
Springer
15 years 1 months ago
Certified Subterm Criterion and Certified Usable Rules
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
Christian Sternagel, René Thiemann
FSEN
2009
Springer
15 years 1 months ago
Executable Interface Specifications for Testing Asynchronous Creol Components
We propose and explore a formal approach for black-box testing asynchronously communicating components in open environments. Asynchronicity poses a challenge for validating and tes...
Immo Grabe, Marcel Kyas, Martin Steffen, Arild B. ...
EDOC
2004
IEEE
15 years 1 months ago
Formalizing ODP Computational Viewpoint Specifications in Maude
The ODP computational viewpoint describes the functionality of a system and its environment, in terms of a configuration of objects which interact at interfaces. Computational obj...
José Raúl Romero, Antonio Vallecillo
VLDB
1995
ACM
150views Database» more  VLDB 1995»
15 years 1 months ago
Procedures in Object-Oriented Query Languages
We follow the stack-baaed approach to query languages which is a new formal and intellectual paradigm for integrating querying and programming for object-oriented databases. Queri...
Kazimierz Subieta, Yahiko Kambayashi, Jacek Leszcz...