Sciweavers

159 search results - page 4 / 32
» Semantics of Termination
Sort
View
DEXA
2009
Springer
70views Database» more  DEXA 2009»
14 years 2 months ago
On the Termination Problem for Declarative XML Message Processing
Abstract. We define a formal syntax and semantics for the Rule Definition Language (RDL) of DemaqLite, which is a fragment of the declarative XML message processing system Demaq....
Tadeusz Litak, Sven Helmer
PPDP
2007
Springer
14 years 2 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
ICFP
2007
ACM
14 years 8 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
AC
2000
Springer
14 years 9 days ago
Operational Semantics and Program Equivalence
This tutorial paper discusses a particular style of operational semantics that enables one to give a ‘syntax-directed’ inductive definition of termination which is very useful...
Andrew M. Pitts
FOSSACS
2004
Springer
14 years 1 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas