36 search results - page 1 / 8 » Automated Reasoning in Reduction Rings Using the Theorema Sy... |
LICS
1991
IEEE
13 years 9 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,...
CSL
2004
Springer
13 years 11 months ago
2004
Springer
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, ¢¡ , comprised of finite, but arbitrarily many,...
LICS
2010
IEEE
13 years 4 months ago
2010
IEEE
ing the differential semantics of rule-based models: exact and automated model reduction (Invited Lecture) Vincent Danos∗§, J´erˆome Feret†, Walter Fontana‡, Russell Harme...
ESSLLI
2009
Springer
13 years 4 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
ALP
1997
Springer
13 years 10 months ago
1997
Springer
We de ne a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. Levy's ordering 2 on reductions) in nite reductions in Conditional Orthogonal ...