Templates and recurrences: better together-Reference-Cited by-同舟云学术

Templates and recurrences: better together

Published:2020-06-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation
language:
Short-container-title:

Author:

Breck Jason¹,Cyphert John¹,Kincaid Zachary²,Reps Thomas¹

Affiliation:

1. University of Wisconsin-Madison, USA

2. Princeton University, USA

Funder

Office of Naval Research

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3385412.3386035

Reference32 articles.

1. E. Albert P. Arenas and S. Genaim. 2011. Closed-Form Upper Bounds in Static Cost Analysis. J. Autom. Reasoning (2011). E. Albert P. Arenas and S. Genaim. 2011. Closed-Form Upper Bounds in Static Cost Analysis. J. Autom. Reasoning (2011).

2. E. Albert S. Genaim and A. Masud. 2013. On the Inference of Resource Usage Upper and Lower Bounds. In ACM. Trans. Comput. Logic. E. Albert S. Genaim and A. Masud. 2013. On the Inference of Resource Usage Upper and Lower Bounds. In ACM. Trans. Comput. Logic.

3. J. Breck J. Cyphert Z. Kincaid and T. Reps. 2020. CHORA repository. https://github.com/jbreck/duet-jbreck J. Breck J. Cyphert Z. Kincaid and T. Reps. 2020. CHORA repository. https://github.com/jbreck/duet-jbreck

4. J. Breck J. Cyphert Z. Kincaid and T. Reps. 2020. Templates and Recurrences: Better Together. (2020). arXiv: 2003.13515 [cs.PL] J. Breck J. Cyphert Z. Kincaid and T. Reps. 2020. Templates and Recurrences: Better Together. (2020). arXiv: 2003.13515 [cs.PL]

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

1. Synthesis of Sound and Precise Storage Cost Bounds via Unsound Resource Analysis and Max-SMT;Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis;2024-09-11

2. Requirement-Dependent Extra Invariant Patterns in Deductive Verification of PoST Programs;2024 IEEE 25th International Conference of Young Professionals in Electron Devices and Materials (EDM);2024-06-28

3. Newtonian Program Analysis of Probabilistic Programs;Proceedings of the ACM on Programming Languages;2024-04-29

4. Empirically Scalable Invariant Generation Leveraging Divide-and-Conquer with Pruning;Lecture Notes in Computer Science;2024

5. Inferring Complexity Bounds from Recurrence Relations;Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2023-11-30