{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T15:16:12Z","timestamp":1791299772538,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540285847","type":"print"},{"value":"9783540319719","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11547662_21","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:36:20Z","timestamp":1127817380000},"page":"303-319","source":"Crossref","is-referenced-by-count":56,"title":["Understanding the Origin of Alarms in Astr\u00e9e"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Rival","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Ball, T., Majumdar, R., Millstein, T., Rajamani, S.: Automatic predicate abstraction of C programs. In: PLDI (2001)","DOI":"10.1145\/378795.378846"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Ball, T., Naik, M., Rajamani, S.: From symptom to cause: Localizing errors in counterexample traces. In: POPL (2003)","DOI":"10.1145\/604131.604140"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Min\u00e9, A., Monniaux, D., Rival, X.: A Static Analyzer for Large Safety Critical Software. In: PLDI (2003)","DOI":"10.1145\/781131.781153"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Canfora, G., Cimitille, A., Lucia, A.D.: Condition program slicing. Information and Software Technology; Special issue on Program Slicing (1998)","DOI":"10.1016\/S0950-5849(98)00086-X"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E.M. Clarke","year":"2000","unstructured":"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.\u00a01855, pp. 752\u2013794. Springer, Heidelberg (2000)"},{"key":"21_CR6","unstructured":"Cousot, P.: M\u00e9thodes it\u00e9ratives de construction et d\u2019approximation de points fixes d\u2019op\u00e9rateurs monotones sur un treillis, analyse s\u00e9mantique des programmes. PhD thesis (1978)"},{"key":"21_CR7","first-page":"303","volume-title":"Program Flow Analysis: Theory and Applications","author":"P. Cousot","year":"1981","unstructured":"Cousot, P.: Semantic foundations of program analysis. In: Muchnick, S., Jones, N. (eds.) Program Flow Analysis: Theory and Applications, pp. 303\u2013342. Prentice-Hall, Inc., Englewood Cliffs (1981)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL (1977)","DOI":"10.1145\/512950.512973"},{"issue":"2-3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation and Application to Logic Programs. Journal of Logic Programming\u00a013(2-3), 103\u2013179 (1992)","journal-title":"Journal of Logic Programming"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-31987-0_3","volume-title":"Programming Languages and Systems","author":"P. Cousot","year":"2005","unstructured":"Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Min\u00e9, A., Monniaux, D., Rival, X.: The ASTR\u00c9E analyzer. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 21\u201330. Springer, Heidelberg (2005)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Dor, N., Rodeh, M., Sagiv, M.: CSSV: Towards a realistic tool for statically detecting all buffer overflows in C. In: PLDI (2003)","DOI":"10.1145\/781131.781149"},{"key":"21_CR12","unstructured":"Erez, G.: Generating counter examples for sound abstract interpretation. Master\u2019s thesis (2004)"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-24725-8_4","volume-title":"Programming Languages and Systems","author":"J. Feret","year":"2004","unstructured":"Feret, J.: Static analysis of digital filters. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.\u00a02986, pp. 33\u201348. Springer, Heidelberg (2004)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Fox, C., Danicic, S., Harman, M., Hierons, R.: ConSIT: A Conditioned Program Slicing System. Software - Practice and Experience (2004)","DOI":"10.1002\/spe.556"},{"key":"21_CR15","unstructured":"Gaucher, F., Jahier, E., Jeannet, B., Maraninchi, F.: Automatic state reaching for debugging reactive programs. In: AADEBUG (2003)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Giacobazzi, R., Ranzato, F., Scozzari, F.: Making abstract interpretations complete. Journal of the ACM, 361\u2013416 (2000)","DOI":"10.1145\/333979.333989"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Granger, P.: Improving the results of static analyses programs by local decreasing iteration. In: FSTTCS (1992)","DOI":"10.1007\/3-540-56287-7_95"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Hierons, R., Harman, M., Fox, C., Ouarbya, L., Daoudi, D.: Conditioned slicing supports partition testing. Journal of Software Testing, Verification and Reliability (2002)","DOI":"10.1002\/stvr.232"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Reps, T., Binkley, D.: Interprocedural Slicing using Program Dependence Graphs. In: Programming Languages and Systems (1990)","DOI":"10.1145\/77606.77608"},{"key":"21_CR20","unstructured":"Jeannet, B.: Dynamic partitioning in linear relation analysis. In: Formal Methods in System Design (2003)"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Korel, B., Laski, J.: Dynamic Program Slicing. In: Information Processing Letters (1988)","DOI":"10.1016\/0020-0190(88)90054-3"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-45099-3_15","volume-title":"Static Analysis","author":"T. Lev-Ami","year":"2000","unstructured":"Lev-Ami, T., Sagiv, M.: TVLA: A system for implementing static analyses. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol.\u00a01824, pp. 280\u2013302. Springer, Heidelberg (2000)"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-540-31987-0_2","volume-title":"Programming Languages and Systems","author":"L. Mauborgne","year":"2005","unstructured":"Mauborgne, L., Rival, X.: Trace partitioning in abstract interpretation based static analyzers. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 5\u201320. Springer, Heidelberg (2005)"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-24725-8_2","volume-title":"Programming Languages and Systems","author":"A. Min\u00e9","year":"2004","unstructured":"Min\u00e9, A.: Relational abstract domains for the detection of floating-point run-time errors. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.\u00a02986, pp. 3\u201317. Springer, Heidelberg (2004)"},{"key":"21_CR25","unstructured":"Min\u00e9, A.: Weakly relational numerical abstract domains. PhD thesis (2004)"},{"key":"21_CR26","unstructured":"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)"},{"key":"21_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36384-X_1","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. Podelski","year":"2002","unstructured":"Podelski, A.: Software model checking with abstraction refinement. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol.\u00a02575, pp. 1\u20133. Springer, Heidelberg (2002)"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Venet, A., Brat, G.: Precise and efficient array bound checking for large embedded c programs. In: PLDI (2004)","DOI":"10.1145\/996841.996869"},{"key":"21_CR29","unstructured":"Weiser, M.: Program slicing. In: Proceeding of the Fifth International Conference on Software Engineering, pp. 439\u2013449 (1981)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11547662_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:40:27Z","timestamp":1605624027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11547662_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285847","9783540319719"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11547662_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}