Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking-Reference-Cited by-同舟云学术

Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking

Published:2001 Issue: Volume: Page:356-373
ISSN:0302-9743
Container-title:Static Analysis
language:
Short-container-title:

Author:

Giacobazzi Roberto,Quintarelli Elisa

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-47764-0_20

Reference22 articles.

1. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent system using temporal logic specification. ACM Trans. Program. Lang. Syst., 8(2):244–263, 1986.

2. Lect Notes Comput Sci;E. M. Clarke,2000

3. E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. ACM Trans. Program. Lang. Syst., 16(5):1512–1542, 1994.

4. P. Cousot. Types as abstract interpretations (Invited Paper). In Conference Record of the 24th ACM Symp. on Principles of Programming Languages (POPL’ 97), pages 316–331. ACM Press, New York, 1997.

5. Lecture Notes in Artificial Intelligence;P. Cousot,2000

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

1. Local Completeness in Abstract Interpretation;Intelligent Systems Reference Library;2023

2. A Formal Framework to Measure the Incompleteness of Abstract Interpretations;Static Analysis;2023

3. Reverse Template Processing Using Abstract Interpretation;Static Analysis;2023

4. Abstract interpretation repair;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09

5. Improving Dynamic Code Analysis by Code Abstraction;Electronic Proceedings in Theoretical Computer Science;2021-09-06