Practical run-time checking via unobtrusive property caching. Issue 4 (3rd September 2015)

• Record Type: Journal Article
• Authors: STULOVA, NATALIIA; MORALES, JOSÉ F.; HERMENEGILDO, MANUEL V.
• Editors: Eiter, Thomas; Toni, Francesca
• Is Part Of: Theory and practice of logic programming. Volume 15:Issue 4/5(2015)
• Page Start: 726
• Page End: 741
• Publication Date: 2015-09-03
• Subjects: Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068415000344
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: The use of annotations, referred to as assertions or contracts, to describe program properties for which run-time tests are to be generated, has become frequent in dynamic programing languages. However, the frameworks proposed to support such run-time testing generally incur high time and/or space overheads over standard program execution. We present an approach for reducing this overhead that is based on the use of memoization to cache intermediate results of check evaluation, avoiding repeated checking of previously verified properties. Compared to approaches that reduce checking frequency, our proposal has the advantage of being exhaustive (i.e., all tests are checked at all points) while still being much more efficient than standard run-time checking. Compared to the limited previous work on memoization, it performs the task without requiring modifications to data structure representation or checking code. While the approach is general and system-independent, we present it for concreteness in the context of the Ciao run-time checking framework, which allows us to provide an operational semantics with checks and caching. We also report on a prototype implementation and provide some experimental results that support that using a relatively small cache leads to significant decreases in run-time checking overhead.