Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs-Reference-Cited by-同舟云学术

Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs

Published:2015 Issue: Volume: Page:183-204
ISSN:0302-9743
Container-title:Programming Languages and Systems
language:
Short-container-title:

Author:

David Cristina,Kroening Daniel,Lewis Matt

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-46669-8_8

Reference35 articles.

1. David, C., Kroening, D., Lewis, M.: Second-order propositional satisfiability. CoRR abs/1409.4925 (2014)

2. Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42, 230–265 (1936)

3. Lecture Notes in Computer Science;A. Podelski,2004

4. Lecture Notes in Computer Science;A.R. Bradley,2005

5. Codish, M., Genaim, S.: Proving termination one loop at a time. In: WLPE, pp. 48–59 (2003)

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

1. Synbit: synthesizing bidirectional programs using unidirectional sketches;Formal Methods in System Design;2024-01-29

2. Data-driven Recurrent Set Learning For Non-termination Analysis;2023 IEEE/ACM 45th International Conference on Software Engineering (ICSE);2023-05

3. Using graph neural networks for program termination;Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2022-11-07

4. Synbit: synthesizing bidirectional programs using unidirectional sketches;Proceedings of the ACM on Programming Languages;2021-10-20

5. Program Synthesis for Program Analysis;ACM Transactions on Programming Languages and Systems;2018-06-30