Combining Shape Analyses by Intersecting Abstractions-Reference-Cited by-同舟云学术

Combining Shape Analyses by Intersecting Abstractions

Published:2005 Issue: Volume: Page:33-48
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Arnold Gilad,Manevich Roman,Sagiv Mooly,Shaham Ran

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11609773_3.pdf

Reference11 articles.

1. Arnold, G., Manevich, R., Sagiv, M., Shaham, R.: Intersecting heap abstractions with applications to compile-time memory management. Technical Report TR-2005-04-135520, Tel Aviv University (April 2005), Available at, http://www.cs.tau.ac.il/rumster/TR-2005-04-135520.pdf

2. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In: Symp. on Princ. of Prog. Lang., pp. 238–252. ACM Press, New York (1977)

3. Jeannet, B., Alexey, L., Reps, T., Sagiv., M.: A relational approach to interprocedural shape analysis. In: Proc. Static Analysis Symp. Springer, Heidelberg (2004)

4. Lecture Notes in Computer Science;V. Kuncak,2004

5. Lev-Ami, T., Sagiv, M.: TVLA: A system for implementing static analyses. In: Proc. Static Analysis Symp, pp. 280–301 (2000)

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

1. Software Model Checking;Proceedings of the 19th Workshop on Formal Techniques for Java-like Programs;2017-06-18

2. Heap Abstractions for Static Analysis;ACM Computing Surveys;2016-11-11

3. Automating Abstract Interpretation;Lecture Notes in Computer Science;2015-12-25

4. A Forward Analysis for Recurrent Sets;Static Analysis;2015

5. Satisfiability modulo abstraction for separation logic with linked lists;Proceedings of the 2014 International SPIN Symposium on Model Checking of Software;2014-07-21