3333 search results - page 108 / 667 » Abstract Proof Search |
170
Voted
ESOP
1992
Springer
15 years 7 months ago
1992
Springer
We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. The generated comp...
140
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,...
124
click to vote
DLT
2007
15 years 5 months ago
2007
Abstract. We study the dynamics of cellular automata, and more specifically their transitivity and expansivity, when the set of configurations is endowed with a shift-invariant (p...
121
Voted
CATS
2006
15 years 5 months ago
2006
In this paper, we study the formalization of one-pass call-by-value CPS compilation using higher-order abstract syntax. In particular, we verify mechanically that the source progr...