Automatic incrementalization of prolog based static analyses

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4354 LNCS, Issue , 2007, Pages 109-123

  Eichberg, Michael ^a   Kahl, Matthias ^a   Saha, Diptikalyan ^b   Mezini, Mira ^a   Ostermann, Klaus ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INCREMENTALIZATION; LOGIC PROGRAMS; MODERN DEVELOPMENT;

LOGIC PROGRAMMING;

STATIC ANALYSIS;

EID: 84887361981     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69611-7-7     Document Type: Conference Paper

References (37)

1. K. Ashcraft and D. Engler. Using programmer-written compiler extensions to catch security holes. In Proceedings of the Symposium on Security and Privacy. IEEE, 2002.
2. T. Ball, B. Cook, V. Levin, and S. K. Rajamani. Slam and static driver verifier: Technology transfer of formal methods inside Microsoft. In Proceedings of IFM. Springer, 2004.
3. F. Besson and T. P. Jensen. Modular class analysis with datalog. In Proceedings of SAS. Springer, 2003.
4. A. Blewitt, A. Bundy, and I. Stark. Automatic verification of java design patterns. In Proceedings of ASE. IEEE, 2001.
5. R. Bol and L. Degerstadt. Tabulated resolution for well-founded semantics. In Proceedings of ILPS. MIT Press, 1993.
6. M. Burke. An interval-based approach to exhaustive and incremental interprocedural dataflow analysis. TOPLAS, 12(3), 1990.
7. M. G. Burke and B. G. Ryder. A critical analysis of incremental iterative data flow analysis algorithms. IEEE Transactions on Software Engineering, 16(7), 1990.
8. M. D. Carroll and B. G. Ryder. Incremental data flow analysis via dominator and attribute update. In Proceedings of POPL. ACM, 1988.
9. W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1), 1996.
10. C. L. Conway, K. S. Namjoshi, D. Dams, and S. A. Edwards. Incremental algorithms for inter-procedural analysis of safety properties. In Proceedings of CAV. Springer, 2005.
11. R. F. Crew. Astlog: A language for examining abstract syntax trees. In Proceedings of DSL. USENIX, 1997.
12. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4), 1991.
13. S. Dawson, C. R. Ramakrishnan, and D. S. Warren. Practical program analysis using general purpose logic programming systems - a case study. In Proceedings of PLDI. ACM, 1996.
14. M. Eichberg, M. Mezini, K. Ostermann, and T. Schäfer. Xirc: A kernel for cross-artifact information engineering in software development environments. In Proceedings of WCRE. IEEE, 2004.
15. M. Eichberg, T. Schäfer, and M. Mezini. Using annotations to check structural properties of classes. In Proceedings of FASE. Springer, 2005.
16. Michael Eichberg, Matthias Kahl, Diptikalyan Saha, Mira Mezini, and Klaus Ostermann. Automatic incrementalization of static analyses. Technical report, 2006. (http://www.st.informatik.tu-darmstadt.de/Magellan).
17. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison Wesley, 1995.
18. Elnar Hajiyev, Mathieu Verbaere, and Oege de Moor. Codequest: Scalable source code queries with datalog. In Proceedings of ECOOP. Springer, 2006.
19. D. Hovemeyer and W. Pugh. Finding bugs is easy. SIGPLANNot., 39(12), 2004.
20. W. Landi and B. G. Ryder. A safe approximate algorithm for interprocedural pointer aliasing. In Proceedings of PLDI. ACM, 1992.
21. Y. A. Liu, T. Rothamel, F. Yu, S. D. Stoller, and N. Hu. Parametric regular path queries. In Proceedings of PLDI. ACM, 2004.
22. T. J. Marlowe and B. G. Ryder. An efficient hybrid algorithm for incremental data flow analysis. In Proceedings of POPL. ACM, 1990.
23. M. Martin, B. Livshits, and M. S. Lam. Finding application errors and security flaws using PQL: a program query language. In Proceedings of OOPSLA. ACM, 2005.
24. L. L. Pollock and M. L. Soffa. An incremental version of iterative data flow analysis. IEEE Transactions on Software Engineering, 15(12), 1989.
25. B. G. Ryder and M. C. Paull. Incremental data-flow analysis algorithms. ACM Transactions on Programming Languages and Systems, 10(1), 1988.
26. D. Saha and C. R. Ramakrishnan. Incremental evaluation of tabled logic programs. In Proceedings of ICLP. Springer, 2003.
27. D. Saha and C. R. Ramakrishnan. Incremental and demand-driven points-to analysis using logic programming. In Proceedings of PPDP. ACM, 2005.
28. D. Saha and C. R. Ramakrishnan. Symbolic support graph: A space-efficient data structure for incremental tabled evaluation. In Proceedings of ICLP. Springer, 2005.
29. D. Saha and C. R. Ramakrishnan. Incremental evaluation of tabled prolog: Beyond pure logic programs. In Proceedings of PADL. Springer, 2006.
30. D. Saha and C. R. Ramakrishnan. A local algorithm for incremental evaluation of logic programs. In Proceedings of ICLP. Springer, 2006.
31. H. Tamaki and T. Sato. OLDT resolution with tabulation. In Proceedings of ICLP. Springer, 1986.
32. J. Vitek and B. Bokowski. Confined types injava. Software Practice and Experience, 31(6), 2001.
33. F. Vivien and M. C. Rinard. Incrementalized pointer and escape analysis. In Proceedings of PLDI. ACM, 2001.
34. J. Whaley and M. S. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In Proceedings of PLDI. ACM, 2004.
35. R. Wuyts. Declarative reasoning about the structure of object-oriented systems. In Proceedings of TOOLS-USA. IEEE, 1998.
36. J. Yur, B. G. Ryder, W. Landi, and P. Stocks. Incremental analysis of side effects for C software system. In Proceedings of ICSE. ACM, 1997.
37. J. Yur, B. G. Ryder, and W. A. Landi. An incremental flow- and context-sensitive pointer aliasing analysis. In Proceedings of ICSE. IEEE, 1999.