Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programs-Reference-Cited by-同舟云学术

Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programs

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2019
language:
Short-container-title:

Author:

Nguyễn Phúc C.¹,Gilray Thomas²,Tobin-Hochstadt Sam³,Van Horn David¹

Affiliation:

1. University of Maryland at College Park, USA

2. University of Alabama at Birmingham, USA

3. Indiana University, USA

Funder

National Science Foundation

Publisher

ACM Press

Reference55 articles.

1. Elvira Albert, Puri Arenas, Michael Codish, Samir Genaim, Germán Puebla, and Damiano Zanardini. 2008. Termination analysis of Java bytecode. In International Conference on Formal Methods for Open Object-Based Distributed Systems. Springer, 2–18.

2. Thomas Arts and Jürgen Giesl. 2000. Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 1-2 (2000), 133–178.

3. James Bailey, Alexandra Poulovassilis, and Peter Newson. 2000. A Dynamic Approach to Termination Analysis for Active Database Rules. In Computational Logic —

4. CL 2000, John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luís Moniz Pereira, Yehoshua Sagiv, and Peter J. Stuckey (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 1106–1120.

5. Josh Berdine, Byron Cook, Dino Distefano, and Peter W O’hearn. 2006. Automatic termination proofs for programs with shape-shifting heaps. In International Conference on Computer Aided Verification. Springer, 386–400.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. FLOREnce: A Hybrid Logic-Functional Reactive Programming Language;Proceedings of the 9th ACM SIGPLAN International Workshop on Reactive and Event-Based Languages and Systems;2022-11-29

2. Checking equivalence in a non-strict language;Proceedings of the ACM on Programming Languages;2022-10-31

3. Deep and shallow types for gradual languages;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09

4. Gradualizing the Calculus of Inductive Constructions;ACM Transactions on Programming Languages and Systems;2022-04-06

5. Refinement Types: A Tutorial;Foundations and Trends® in Programming Languages;2021