Skip to main content
SpringerLink
Log in
Book cover

International Static Analysis Symposium

SAS 2005: Static Analysis pp 303–319Cite as

Understanding the Origin of Alarms in Astrée

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3672))

Abstract

Static analyzers like Astrée are incomplete, hence, may produce false alarms. We propose a framework for the investigation of the alarms produced by Astrée , so as to help classifying them as true errors or false alarms that are due to the approximation inherent in the static analysis. Our approach is based on the computation of an approximation of a set of traces specified by an initial and a (set of) final state(s). Moreover, we allow for finer analyses to focus on some execution patterns or on some possible inputs. The underlying algorithms were implemented inside Astrée and used successfully to track alarms in large, critical embedded applications.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ball, T., Majumdar, R., Millstein, T., Rajamani, S.: Automatic predicate abstraction of C programs. In: PLDI (2001)

    Google Scholar 

  2. Ball, T., Naik, M., Rajamani, S.: From symptom to cause: Localizing errors in counterexample traces. In: POPL (2003)

    Google Scholar 

  3. Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., Rival, X.: A Static Analyzer for Large Safety Critical Software. In: PLDI (2003)

    Google Scholar 

  4. Canfora, G., Cimitille, A., Lucia, A.D.: Condition program slicing. Information and Software Technology; Special issue on Program Slicing (1998)

    Google Scholar 

  5. Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 752–794. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  6. Cousot, P.: Méthodes itératives de construction et d’approximation de points fixes d’opérateurs monotones sur un treillis, analyse sémantique des programmes. PhD thesis (1978)

    Google Scholar 

  7. Cousot, P.: Semantic foundations of program analysis. In: Muchnick, S., Jones, N. (eds.) Program Flow Analysis: Theory and Applications, pp. 303–342. Prentice-Hall, Inc., Englewood Cliffs (1981)

    Google Scholar 

  8. Cousot, P., Cousot, R.: Abstract Interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL (1977)

    Google Scholar 

  9. Cousot, P., Cousot, R.: Abstract Interpretation and Application to Logic Programs. Journal of Logic Programming 13(2-3), 103–179 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  10. Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., Rival, X.: The ASTRÉE analyzer. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 21–30. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Dor, N., Rodeh, M., Sagiv, M.: CSSV: Towards a realistic tool for statically detecting all buffer overflows in C. In: PLDI (2003)

    Google Scholar 

  12. Erez, G.: Generating counter examples for sound abstract interpretation. Master’s thesis (2004)

    Google Scholar 

  13. Feret, J.: Static analysis of digital filters. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 33–48. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Fox, C., Danicic, S., Harman, M., Hierons, R.: ConSIT: A Conditioned Program Slicing System. Software - Practice and Experience (2004)

    Google Scholar 

  15. Gaucher, F., Jahier, E., Jeannet, B., Maraninchi, F.: Automatic state reaching for debugging reactive programs. In: AADEBUG (2003)

    Google Scholar 

  16. Giacobazzi, R., Ranzato, F., Scozzari, F.: Making abstract interpretations complete. Journal of the ACM, 361–416 (2000)

    Google Scholar 

  17. Granger, P.: Improving the results of static analyses programs by local decreasing iteration. In: FSTTCS (1992)

    Google Scholar 

  18. Hierons, R., Harman, M., Fox, C., Ouarbya, L., Daoudi, D.: Conditioned slicing supports partition testing. Journal of Software Testing, Verification and Reliability (2002)

    Google Scholar 

  19. Horwitz, S., Reps, T., Binkley, D.: Interprocedural Slicing using Program Dependence Graphs. In: Programming Languages and Systems (1990)

    Google Scholar 

  20. Jeannet, B.: Dynamic partitioning in linear relation analysis. In: Formal Methods in System Design (2003)

    Google Scholar 

  21. Korel, B., Laski, J.: Dynamic Program Slicing. In: Information Processing Letters (1988)

    Google Scholar 

  22. Lev-Ami, T., Sagiv, M.: TVLA: A system for implementing static analyses. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol. 1824, pp. 280–302. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  23. Mauborgne, L., Rival, X.: Trace partitioning in abstract interpretation based static analyzers. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 5–20. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  24. Miné, A.: Relational abstract domains for the detection of floating-point run-time errors. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 3–17. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  25. Miné, A.: Weakly relational numerical abstract domains. PhD thesis (2004)

    Google Scholar 

  26. Pace, G., Halbwachs, N., Raymond, P.: Counter-example generation in symbolic abstract model-checking. In: 6th International Workshop on Formal Methods for Industrial Critical Systems, FMICS (2001)

    Google Scholar 

  27. Podelski, A.: Software model checking with abstraction refinement. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol. 2575, pp. 1–3. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  28. Venet, A., Brat, G.: Precise and efficient array bound checking for large embedded c programs. In: PLDI (2004)

    Google Scholar 

  29. Weiser, M.: Program slicing. In: Proceeding of the Fifth International Conference on Software Engineering, pp. 439–449 (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. École Normale Supérieure, 45, rue d’Ulm, 75230 cedex 5, Paris, France

    Xavier Rival

Authors
  1. Xavier Rival
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing, Imperial College London,  

    Chris Hankin

  2. Department of Computing, Imperial College London, 180 Queen’s Gate, SW7 2BZ, London, UK

    Igor Siveroni

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rival, X. (2005). Understanding the Origin of Alarms in Astrée . In: Hankin, C., Siveroni, I. (eds) Static Analysis. SAS 2005. Lecture Notes in Computer Science, vol 3672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11547662_21

Download citation

  • DOI: https://doi.org/10.1007/11547662_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28584-7

  • Online ISBN: 978-3-540-31971-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation