2000 search results - page 120 / 400 » Program Transformation and Proof Transformation |
123
click to vote
VL
2002
IEEE
15 years 8 months ago
2002
IEEE
Many systems require data transformation – the conversion of complex data from one format to another. Most current approaches require programming, scripting bstract visual speci...
130
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
138
Voted
RTA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
128
Voted
LICS
1991
IEEE
15 years 7 months ago
1991
IEEE
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
133
Voted
EPIA
2005
Springer
15 years 9 months ago
2005
Springer
Theoretical research has spent some years facing the problem of how to represent and provide semantics to updates of logic programs. This problem is relevant for addressing highly ...