Affiliation:
1. University of Nantes, France / LS2N CNRS, France / Inria, France
Abstract
We propose a framework to study contextual equivalence of programs written in a call-by-value functional language with local integer references. It reduces the problem of contextual equivalence to the problem of non-reachability in a transition system of memory configurations. This reduction is complete for recursion-free programs.
Restricting to programs that do not allocate references inside the body of functions, we encode this non-reachability problem as a set of constrained Horn clause that can then be checked for satisfiability automatically. Restricting furthermore to a language with finite data-types, we also get a new decidability result for contextual equivalence at any type.
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Operationally-based program equivalence proofs using LCTRSs;Journal of Logical and Algebraic Methods in Programming;2023-10
2. Operational Algorithmic Game Semantics;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
3. From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques;Tools and Algorithms for the Construction and Analysis of Systems;2022
4. On sequentiality and well-bracketing in the π-calculus;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29
5. Compositional relational reasoning via operational game semantics;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29