A Reachability Predicate for Analyzing Low-Level Software-Reference-Cited by-同舟云学术

A Reachability Predicate for Analyzing Low-Level Software

Published: Issue: Volume: Page:19-33
ISSN:
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Chatterjee Shaunak,Lahiri Shuvendu K.,Qadeer Shaz,Rakamarić Zvonimir

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-71209-1_4.pdf

Reference23 articles.

1. Lecture Notes in Computer Science;I. Balaban,2005

2. Ball, T., et al.: Automatic predicate abstraction of C programs. In: Programming Language Design and Implementation (PLDI ’01), pp. 203–213 (2001)

3. Barnett, M., Leino, K.R.M.: Weakest-precondition of unstructured programs. In: ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering (PASTE ’05), pp. 82–87. ACM Press, New York (2005)

4. Lecture Notes in Computer Science;M. Barnett,2005

5. Lecture Notes in Computer Science;J. Bingham,2005

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

1. P4b: A Translator from P4 Programs to Boogie;Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2023-11-30

2. Identifying Overly Restrictive Matching Patterns in SMT-Based Program Verifiers;Formal Methods;2021

3. Leveraging Compiler Intermediate Representation for Multi- and Cross-Language Verification;Lecture Notes in Computer Science;2020

4. solc-verify: A Modular Verifier for Solidity Smart Contracts;Lecture Notes in Computer Science;2020

5. A Context-Sensitive Memory Model for Verification of C/C++ Programs;Static Analysis;2017