Generalizing the template polyhedral domain

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

Volumn 6602 LNCS, Issue , 2011, Pages 176-195

  Colón, Michael A ^a   Sankaranarayanan, Sriram ^b  

^a NAVAL RESEARCH LABORATORY   (United States)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK SYSTEM; BILINEAR FORM; EXPERIMENTAL EVALUATION; LINEAR EXPRESSION; LINEAR RELATION; POLYHEDRAL DOMAINS; POLYNOMIAL-TIME; PROGRAM VARIABLES; SPECIAL PROPERTIES; TWO PARAMETER; UNKNOWN PARAMETERS;

GEOMETRY; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION;

TIME DOMAIN ANALYSIS;

EID: 79953196162     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19718-5_10     Document Type: Conference Paper

References (38)

1. Adj́e, A., Gaubert, S., Goubault, E.: Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 23-42. Springer, Heidelberg (2010)
2. Bagnara, R., Ricci, E., Zaffanella, E., Hill, P.M.: Possibly not closed convex polyhedra and the Parma Polyhedra Library. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol. 2477, pp. 213-229. Springer, Heidelberg (2002)
3. Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: fast accelereation of symbolic transition systems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 118-121. Springer, Heidelberg (2003)
4. Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Mińe, A., Monniaux, D., Rival, X.: Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software (invited chapter). In: Mogensen, T.Æ., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol. 2566, pp. 85-108. Springer, Heidelberg (2002)
5. Boyd, S., Vandenberghe, S.: Convex Optimization. Cambridge University Press, Cambridge (2004), http://www.stanford.edu/~boyd/cvxbook.html
6. Chatterjee, S., Lahiri, S.K., Qadeer, S., Rakamaric, Z.: A reachability predicate for analyzing low-level software. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 19-33. Springer, Heidelberg (2007)
7. Clariśo, R., Cortadella, J.: The octahedron abstract domain. Science of Computer Programming 64(1), 115-139 (2007)
8. Coĺon, M.A.: Deductive Techniques for Program Analysis. PhD thesis, Stanford University (2003)
9. Corman, T., Leiserson, C.F., Rivest, R.: Introduction to Algorithms. McGraw Hill, New York (1990)
10. Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: Proc. ISOP 1976, Dunod, Paris, France, pp. 106-130 (1976)
11. Cousot, P., Cousot, R.: Abstract Interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238-252 (1977)
12. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among the variables of a program. In: POPL 1978, pp. 84-97 (January 1978)
13. de Moura, L.M., Bjørner, N.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
14. Ferrara, P., Logozzo, F., F̈ahndrich, M.: Safer unsafe code for .NET. In: OOPSLA, pp. 329-346. ACM, New York (2008)
15. Gaubert, S., Goubault, E., Taly, A., Zennou, S.: Static analysis by policy iteration on relational domains. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 237-252. Springer, Heidelberg (2007)
16. Gawlitza, T., Seidl, H.: Precise fixpoint computation through strategy iteration. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 300-315. Springer, Heidelberg (2007)
17. Gupta, A., Rybalchenko, A.: InvGen: An efficient invariant generator. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 634-640. Springer, Heidelberg (2009)
18. Halbwachs, N., Proy, Y.-E., Roumanoff, P.: Verification of real-time systems using linear relation analysis. Formal Methods in System Design 11(2), 157-185 (1997)
19. Henzinger, T.A., Ho, P.: HyTech: The Cornell hybrid technology tool. In: Antsaklis, P.J., Kohn, W., Nerode, A., Sastry, S.S. (eds.) HS 1994. LNCS, vol. 999, pp. 265-293. Springer, Heidelberg (1995)
20. Howe, J., King, A.: Logahedra: A new weakly relational domain. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 306-320. Springer, Heidelberg (2009)
21. Ivančíc, F., Sankaranarayanan, S., Shlyakhter, I., Gupta, A.: Buffer overflow analysis using environment refinement 2009. Draft (2009)
22. Ivančíc, F., Shlyakhter, I., Gupta, A., Ganai, M.K.:Model checking C programs using F-SOFT. In: ICCD, pp. 297-308. IEEE Computer Society, Los Alamitos (2005)
23. Jarvis, R.A.: On the identification of the convex hull of a finite set of points in the plane. Information Processing Letters 2(1), 18-21 (1973)
24. Jeannet, B., Mińe, A.: Apron: A library of numerical abstract domains for static analysis. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 661-667. Springer, Heidelberg (2009)
25. Kanade, A., Alur, R., Ivančíc, F., Ramesh, S., Sankaranarayanan, S., Sashidhar, K.: Generating and analyzing symbolic traces of Simulink/Stateflow models. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 430-445. Springer, Heidelberg (2009)
26. Logozzo, F., F̈ahndrich, M.: Pentagons: A weakly relational abstract domain for the efficient validation of array accesses. Sci. Comp. Prog. 75(9), 796-807 (2010)
27. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, New York (1995)
28. Mińe, A.: A new numerical abstract domain based on difference-bound matrices. In: Danvy, O., Filinski, A. (eds.) PADO 2001. LNCS, vol. 2053, pp. 155-172. Springer, Heidelberg (2001)
29. Mińe, A.: Symbolic methods to enhance the precision of numerical abstract domains. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 348-363. Springer, Heidelberg (2005)
30. Monniaux, D.: Automatic modular abstractions for template numerical constraints. Logical Methods in Computer Science 6(3) (2010)
31. Motzkin, T.S., Raiffa, H., Thompson, G.L., Thrall, R.M.: The double description method. In: Contributions to the theory of games. Annals of Mathematics Studies, vol. 2, pp. 51-73. Princeton University Press, Princeton (1953)
32. Sankaranarayanan, S., Coĺon, M.A., Sipma, H., Manna, Z.: Efficient strongly relational polyhedral analysis. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 111-125. Springer, Heidelberg (2006)
33. Sankaranarayanan, S., Ivančíc, F., Gupta, A.: Program analysis using symbolic ranges. In: Riis Nielson, H., Fiĺe, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 366-383. Springer, Heidelberg (2007)
34. Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Scalable analysis of linear systems using mathematical programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 25-41. Springer, Heidelberg (2005)
35. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)
36. Simon, A.: Value-Range Analysis of C Programs: Towards Proving the Absence of Buffer Overflow Vulnerabilities. Springer, Heidelberg (2008)
37. Simon, A., King, A., Howe, J.M.: Two variables per linear inequality as an abstract domain. In: Leuschel, M. (ed.) LOPSTR 2002. LNCS, vol. 2664, pp. 71-89. Springer, Heidelberg (2003)
38. Srivastava, S., Gulwani, S.: Program verification using templates over predicate abstraction. In: PLDI 2009, pp. 223-234. ACM, New York (2009)