A static analyzer for large safety-critical software

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2003, Pages 196-207

  Blanchet, Bruno ^a   Mauborgne, Laurent ^a   Cousot, Patrick ^a   Miné, Antoine ^a   Cousot, Radhia ^b   Monniaux, David ^a   Feret, Jérôme ^a   Rival, Xavier ^a  

^a UNIVERSITÉ DE LYON   (France)

^b ECOLE POLYTECHNIQUE   (France)

Author keywords

Abstract Domains; Abstract Interpretation; Embedded; Floating Point; Reactive; Real Time; Safety Critical Software; Static Analysis; Verification

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES; LARGE SCALE SYSTEMS; REAL TIME SYSTEMS;

FALSE ALARMS;

COMPUTER SOFTWARE;

EID: 0038039865     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/781131.781153     Document Type: Conference Paper

References (34)

1. S. Adams, T. Ball, M. Das, S. Lerner, K. Rajamani, M. Seigle, and W. Weimer. Speeding up dataflow analysis using flow-insensitive pointer analysis. SAS (2002), LNCS 2477, Springer, 117-132.
2. T. Ball, R. Majumdar, T. Millstein, and S. Rajamani. Automatic predicate abstraction of C programs. PLDI. ACM SIGPLAN Not. 36(5) (2001), 203-213.
3. T. Ball, A. Podelski, and S. Rajamani. Relative completeness of abstraction refinement for software model checking. TACAS (2002), LNCS 2280, Springer, 158-172.
4. th ACM POPL (2002), 1-3.
5. B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux, and X. Rival. Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software. The Essence of Computation: Complexity, Analysis, Transformation. (2002), LNCS 2566, Springer, 85-108.
6. R. Bryant. Graph based algorithms for boolean function manipulation. IEEE Trans. Comput. C-35 (1986), 677-691.
7. P. Cousot. Partial completeness of abstract fixpoint checking. SARA (2000), LNAI 1864, Springer, 1-25.
8. th ACM POPL (1977), 238-252.
9. th ACM POPL (1979), 269-282.
10. P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. J. of Logic Prog. 2-3, 13 (1992), 103-179.
11. P. Cousot and R. Cousot. Abstract interpretation frameworks. J. Logic and Comp. 2, 4 (1992), 511-547.
12. P. Cousot and R. Cousot. Comparing the Galois connection and widening/narrowing approaches to abstract interpretation. PLILP (1992), LNCS 631, Springer, 269-295.
13. th ACM POPL (1978), 84-97.
14. th PLDI (2002), 58-70.
15. D. Engler, B. Chelf, A. Chou, and S. Hallem. Checking system rules using system-specific, programmer-written compiler extensions. USENIX Association, OSDI 2000, 1-16.
16. C. Ferdinand, R. Heckmann, M. Langenbach, F. Martin, M. Schmidt, H. Theiling, S. Thesing, and R. Wilhelm. Reliable and precise WCET determination for a real-life processor. ESOP (2001), LNCS 2211, Springer, 469-485.
17. C. Flanagan, K. R. M. Leino, M. Lillibridge, G. Nelson, J. Saxe, and R. Stata. Extended static checking for Java. PLDI. ACM SIGPLAN Not. 37(5) (2002), 234-245.
18. R. Giacobazzi and E. Quintarelli. Incompleteness, counterexamples and refinements in abstract model-checking. SAS (2001), LNCS 126, Springer, 356-373.
19. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. CAV (1997), LNCS 1254, Springer, 72-83.
20. N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous dataflow programming language LUSTRE. Proc. of the IEEE 79, 9 (1991), 1305-1320.
21. th ACM POPL (2002), 58-70.
22. G. Holzmann. The model checker SPIN. IEEE Trans. Softw. Eng. 23, 5 (1997), 279-295.
23. IEEE Computer Society. IEEE standard for binary floating-point arithmetic. Tech. rep., ANSI/IEEE Std 745-1985, 1985.
24. st ACM POPL (1973.), 194-206.
25. X. Leroy, D. Doligez, J. Garrigue, D. Rémy, and J. Vouillon. The Objective Caml system, documentation and user's manual (release 3.06). Tech. rep., INRIA, Rocquencourt, France, 2002.
26. R. Manevich, G. Ramalingam, J. Field, D. Goyal, and M. Sagiv. Compactly representing first-order structures for static analysis. SAS (2002), LNCS 2477, Springer, 196-212.
27. M. Martel. Static analysis of the numerical stability of loops. SAS (2002), LNCS 2477, Springer, 133-150.
28. A. Miné. The octagon abstract domain library. http://www.di.ens.fr/̃mine/oct/.
29. A. Miné. A new numerical abstract domain based on difference-bound matrices. PADO (2001), LNCS 2053, Springer, 155-172.
30. A. Miné. The octagon abstract domain. IEEE AST in WCRE (2001), 310-319.
31. M. Musuvathi, D. Park, A. Chou, D. Engler, and D. Dill. CMC: A pragmatic approach to model checking real code. USENIX Association, OSDI 2002.
32. S. Owre, N. Shankar, and D. Stringer-Calvert. PVS: An experience report. FM-Trends'98 (1999), LNCS 1641, Springer, 117-132.
33. The Coq Development Team. The Coq proof assistant reference manual (version 7,4). Tech. rep., INRIA, Rocquencourt, France, 2003.
34. M. Weiser. Program slicing. IEEE Transactions on Software Engineering SE-10, 4 (1984), 352-357.