Abstract
Transfinite semantics have been argued to be a proper framework for reasoning about correctness of certain program transformation techniques, e.g. program slicing. But transfinite semantics work fine only for non-recursive programs because of infinity being “one-way”.
This paper presents transfinite trace semantics in a different form which we call fractional semantics. The components of traces are indexed with rational numbers rather than ordinals. Rational numbers form both infinite ascending and infinite descending chains, so the principal obstacle of handling recursion disappears.
Although we have not yet found a fractional semantics appropriate for all cases of recursion, the approach seems to be promising. Another contribution achieved with help of fractional semantics is presenting both standard and transfinite trace semantics uniformly using fixpoints.
Partially supported by Estonian Science Foundation under grant no. 6713.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Binkley, D.W., Gallagher, K.B.: Program Slicing. Advances in Computers 43, 1–50 (1996)
Cousot, P.: Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation. Electronic Notes in Theoretical Computer Science 6, 25 (1997)
Danicic, S., Harman, M., Howroyd, J., Ouarbya, L.: A Lazy Semantics for Program Slicing. In: Proceedings of the 1st International Workshop on Programming Language Interference and Dependence (2004), available at http://profs.sci.univr.it/~mastroen/download/PLID/Proceedings/Proceedings.html
Giacobazzi, R., Mastroeni, I.: Non-Standard Semantics for Program Slicing. Higher-Order Symbolic Computation 16, 297–339 (2003)
Kennaway, R., Klop, J.W., Sleep, R., de Vries, F.-J.: Transfinite Reductions in Orthogonal Term Rewriting Systems. Information and Computation 119(1), 18–38 (1995)
Nestra, H.: Transfinite Corecursion. Nordic Journal of Computing 12(2), 133–156 (2005)
Nestra, H.: Transfinite Semantics in Program Slicing. Proceedings of the Estonian Academy of Sciences. Engineering 11(4), 313–328 (2005)
Nielson, H.R., Nielson, F.: Semantics with Applications: A Formal Introduction, Wiley Professional Computing. Wiley, Chichester (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nestra, H. (2006). Fractional Semantics. In: Johnson, M., Vene, V. (eds) Algebraic Methodology and Software Technology. AMAST 2006. Lecture Notes in Computer Science, vol 4019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11784180_22
Download citation
DOI: https://doi.org/10.1007/11784180_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35633-2
Online ISBN: 978-3-540-35636-3
eBook Packages: Computer ScienceComputer Science (R0)