4767 search results - page 143 / 954 » Structures for Abstract Rewriting |
128
click to vote
RTA
2010
Springer
15 years 6 months ago
2010
Springer
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...
127
click to vote
ICFEM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
AMAST
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Motivated by the proliferation and usefulness of Domain Specific Languages as well as the demand in enriching well established languages by high level capabilities like p...
138
Voted
AIMSA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
113
click to vote
DAGSTUHL
2007
15 years 3 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...