Context-sensitive multivariant assertion checking in modular programs


Autoria(s): Pietrzak, Pawel; Correas Fernandez, Jesús; Puebla Sánchez, Alvaro Germán; Hermenegildo, Manuel V.
Data(s)

2006

Resumo

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 extensión 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 raditional 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.

Formato

application/pdf

Identificador

http://oa.upm.es/14338/

Idioma(s)

eng

Publicador

Facultad de Informática (UPM)

Relação

http://oa.upm.es/14338/1/HERME_ARC_2006-1.pdf

http://link.springer.com/chapter/10.1007/11916277_27

Direitos

http://creativecommons.org/licenses/by-nc-nd/3.0/es/

info:eu-repo/semantics/openAccess

Fonte

Logic for Programming, Artificial Intelligence, and Reasoning | 13th International Conference, LPAR 2006 | November 13-17, 2006 | Phnom Penh, Cambodia

Palavras-Chave #Informática
Tipo

info:eu-repo/semantics/conferenceObject

Ponencia en Congreso o Jornada

PeerReviewed