Multivariant Assertion-Based Guidance in Abstract Interpretation

Garcia-Contreras, Isabel; Morales, José F.; Hermenegildo, Manuel V.

doi:10.1007/978-3-030-13838-7_11

Cited by 4 publications

(7 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, assertions ensure that certain executions never occur. This information is included in the analysis in the following way (adapted from [8]):…”

Section: Theorem 1 (Correctness Of Incanalyze From Scratch)mentioning

confidence: 99%

Incremental Analysis of Logic Programs with Assertions and Open Predicates

Garcia-Contreras

Hermenegildo

2020

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

Generic components are a further abstraction over the concept of modules, introducing dependencies on other (not necessarily available) components implementing specified interfaces. They have become a key concept in large and complex software applications. Despite undeniable advantages, generic code is also anti-modular. Precise analysis (e.g., for detecting bugs or optimizing code) requires such code to be instantiated with concrete implementations, potentially leading to expensive combinatorial explosion. In this paper we claim that incremental, whole program analysis can be very beneficial in this context, and alleviate the anti-modularity nature of generic code. We propose a simple Horn-clause encoding of generic programs, using open predicates and assertions, and we introduce a new incremental, multivariant analysis algorithm that reacts incrementally not only to changes in program clauses, but also to changes in the assertions, upon which large parts of the analysis graph may depend. We also discuss the application of the proposed techniques in a number of practical use cases. In addition, as a realistic case study , we apply the proposed techniques in the analysis of the LPdoc documentation system. W e argue that the proposed traits are a convenient and elegant abstraction for modular generic programming, and that our preliminary results support our thesis that the new incrementality-related features added to the analysis bring promising advantages in this context.Research partially funded by MINECO TIN2015-67522-C3-1-R TRACES project, FPU grant 16/04811, and the Madrid P2018/TCS-4339 BLOQUES-CM program. W e are also grateful to the anonymous reviewers for their useful comments.

show abstract

“…Additionally, assertions ensure that certain executions never occur. This information is included in the analysis in the following way (adapted from [8]):…”

Section: Theorem 1 (Correctness Of Incanalyze From Scratch)mentioning

confidence: 99%

Incremental Analysis of Logic Programs with Assertions and Open Predicates

Garcia-Contreras

Hermenegildo

2020

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

show abstract

“…(P, A c ) c 1 -^ (Q, A c ') G g : there are two nodes (k = (P, A c ) and k' = (Q, A c ')) in g and there is an annotated edge from k to k'. xor (8,8,8).…”

Section: Graph Consultation Operationsmentioning

confidence: 99%

“…We want to take advantage of the existing algorithms to design an analyzer that is sensible to changes in assertions also. We will use as a black box the combination of the algorithms to analyze incrementally a logic program [13], and the analyzer that is guided by assertions [8]. We will refer to it with the function s/' = INCANALYZE(P, B a , Aois, *?…”

Section: Incremental Analysis Of Programs With Assertionsmentioning

confidence: 99%

“…Functions apply_call(P, A c , As) and apply_succ(P, A c , A s , As) abstract the meaning of the assertion conditions (respectively calls and success conditions). Further details of these functions are described in Appendix A and in [8]. These operations are assumed to be monotonic and to correctly overapproximate their correspondent concrete version.…”

Section: Incremental Analysis Of Programs With Assertionsmentioning

confidence: 99%

“…Additionally, assertions ensure that certain executions never occur. This information is included in the analysis in the following way (adapted from [8]): a , 0, 0).…”

Section: Theorem 1 (Correctness Of Incanalyze From Scratch) Let P Bementioning

confidence: 99%

See 2 more Smart Citations

Logic-Based Program Synthesis and Transformation

Gabbrielli¹

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Generic components are a further abstraction over the concept of modules, introducing dependencies on other (not necessarily available) components implementing specified interfaces. They have become a key concept in large and complex software applications. Despite undeniable advantages, generic code is also anti-modular. Precise analysis (e.g., for detecting bugs or optimizing code) requires such code to be instantiated with concrete implementations, potentially leading to expensive combinatorial explosion. In this paper we claim that incremental, whole program analysis can be very beneficial in this context, and alleviate the anti-modularity nature of generic code. We propose a simple Horn-clause encoding of generic programs, using open predicates and assertions, and we introduce a new incremental, multivariant analysis algorithm that reacts incrementally not only to changes in program clauses, but also to changes in the assertions, upon which large parts of the analysis graph may depend. We also discuss the application of the proposed techniques in a number of practical use cases. In addition, as a realistic case study , we apply the proposed techniques in the analysis of the LPdoc documentation system. W e argue that the proposed traits are a convenient and elegant abstraction for modular generic programming, and that our preliminary results support our thesis that the new incrementality-related features added to the analysis bring promising advantages in this context. Research partially funded by MINECO TIN2015-67522-C3-1-R TRACES project, FPU grant 16/04811, and the Madrid P2018/TCS-4339 BLOQUES-CM program. W e are also grateful to the anonymous reviewers for their useful comments.

show abstract

Testing Your (Static Analysis) Truths

Casso

Morales

López-García

et al. 2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Static analysis is nowadays an essential component of many software development toolsets. Despite some notorious successes in the validation of compilers, comparatively little work exists on the systematic validation of static analyzers, whose correctness and reliability is critical if they are to be inserted in production environments. Contributing factors may be the intrinsic difficulty of formally verifying code that is quite complex and of finding suitable oracles for testing it. In this paper, we propose a simple, automatic method for testing abstract interpretationbased static analyzers. Broadly, it consists in checking, over a suite of benchmarks, that the properties inferred statically are satisfied dynamically. The main advantage of our approach is its simplicity, which stems directly from framing it within the Ciao assertion-based validation framework, and its blended static/dynamic assertion checking approach. We show that in this setting, the analysis can be tested with little effort by combining the following components already present in the framework: the static analyzer, the assertion run-time checking mechanism, the random test case generator, and the unit-test framework . Together they compose a tool that can effectively discover and locate errors in the different components of the analysis framework. We apply our approach to test some of CiaoPP's analysis domains over a wide range of programs, successfully finding non-trivial, previously undetected bugs, with a low degree of effort.logic programming Partially funded by MICINN PID2019-108528RB-C21 ProCode and the Madrid P2018/TCS-4339 BLOQUES-CM program.

show abstract

Multivariant Assertion-Based Guidance in Abstract Interpretation

Cited by 4 publications

References 27 publications

Incremental Analysis of Logic Programs with Assertions and Open Predicates

Incremental Analysis of Logic Programs with Assertions and Open Predicates

Logic-Based Program Synthesis and Transformation

Testing Your (Static Analysis) Truths

Contact Info

Product

Resources

About