Inferring Sufficient Conditions with Backward Polyhedral Under-Approximations-Reference-Cited by-同舟云学术

Inferring Sufficient Conditions with Backward Polyhedral Under-Approximations

Published:2012-11 Issue: Volume:287 Page:89-100
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Miné Antoine

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference17 articles.

1. J. Bertrane, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, and X. Rival. Static analysis and verification of aerospace software by abstract interpretation. AIAA Infotech@Aerospace, number 2010–3385 pages 1–38. AIAA, Apr. 2010.

2. Abstract debugging of higher-order imperative languages;Bourdoncle,1993

3. Inferring definite counterexamples through under-approximation.;Brauer,2012

4. P. Cousot. Méthodes itératives de construction et dʼapproximation de points fixes dʼopérateurs monotones sur un treillis, analyse sémantique de programmes (in French). Thèse dʼÉtat ès sciences mathématiques, Université scientifique et médicale de Grenoble, Grenoble, France, 21 Mar. 1978.

5. An abstract interpretation framework for termination;Cousot,2012

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A lightweight approach to nontermination inference using Constrained Horn Clauses;Software and Systems Modeling;2024-03-14

2. The Systematic Design of Responsibility Analysis by Abstract Interpretation;ACM Transactions on Programming Languages and Systems;2022-03-31

3. Transformation-Enabled Precondition Inference;Theory and Practice of Logic Programming;2021-09-23

4. Lightweight Nontermination Inference with CHCs;Software Engineering and Formal Methods;2021

5. An iterative approach to precondition inference using constrained Horn clauses;Theory and Practice of Logic Programming;2018-07