3552 search results - page 209 / 711 » Proof theory in the abstract |
175
click to vote
RTA
2010
Springer
15 years 10 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...
164
click to vote
LICS
1991
IEEE
15 years 10 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,...
162
click to vote
DLT
2007
15 years 8 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...
156
click to vote
CATS
2006
15 years 8 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...
192
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral proper...