Context-sensitive multivariant assertion checking in modular programs
2006 (English)In: Logic for Programming, Artificial Intelligence, and Reasoning: 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006. Proceedings / [ed] Miki Hermann; Andrei Voronkov, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2006, 392-406 p.Conference paper (Refereed)
We propose a modular, assertion-based system for verification and debugging of large logic programs, together with several interesting models for checking assertions statically in modular programs, each with different characteristics and representing different trade-offs. Our proposal is a modular and multivariant extension of our previously proposed abstract assertion checking model and we also report on its implementation in the CiaoPP system. In our approach, the specification of the program, given by a set of assertions, may be partial, instead of the complete specification required by traditional verification systems. Also, the system can deal with properties which cannot always be determined at compile-time. As a result, the proposed system needs to work with safe approximations: all assertions proved correct are guaranteed to be valid and all errors actual errors. The use of modular, context-sensitive static analyzers also allows us to introduce a new distinction between assertions checked in a particular context or checked in general.
Place, publisher, year, edition, pages
Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2006. 392-406 p.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 4246
Research subject Embedded System
IdentifiersURN: urn:nbn:se:ltu:diva-27415DOI: 10.1007/11916277ScopusID: 33845225992Local ID: 0dbc13f0-c15a-11dd-a054-000ea68e967bISBN: 978-3-540-48281-9OAI: oai:DiVA.org:ltu-27415DiVA: diva2:1000599
International Conference on Logic for Programming, Aritficial Intelligence, and Reasoning : 13/11/2006 - 17/11/2006
Upprättat; 2006; 20081203 (ysko)2016-09-302016-09-30