A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings and Narrowings

Su, Zhendong; Wagner, David

doi:10.1007/978-3-540-24730-2_23

Cited by 15 publications

(13 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On this protocol, the CQDD method can compute the exact reachability set n≥0 a n c n , whereas we approximate it, using ∇ k , by This comparison is experimental, and should be completed in the future with larger examples. However, it is very difficult to prove the superiority of an analysis that uses a widening operator, as pointed out by [33]. From a theoretical point of view, we can make two statements.…”

Section: Relational Analysismentioning

confidence: 98%

Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues

Gall¹,

Jeannet²,

Jéron³

2006

Algebraic Methodology and Software Technology

View full text Add to dashboard Cite

Abstract. We address the verification of communication protocols or distributed systems that can be modeled by Communicating Finite State Machines (CFSMs), i.e. a set of sequential machines communicating via unbounded FIFO channels. Unlike recent related works based on acceleration techniques, we propose to apply the Abstract Interpretation approach to such systems, which consists in using approximated representations of sets of configurations. We show that the use of regular languages together with an extrapolation operator provides a simple and elegant method for the analysis of CFSMs, which is moreover often as accurate as acceleration techniques, and in some cases more expressive. Last, when the system has several queues, our method can be implemented either as an attribute-independent analysis or as a more precise (but also more costly) attribute-dependent analysis.

show abstract

Section: Relational Analysismentioning

confidence: 98%

Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues

Gall¹,

Jeannet²,

Jéron³

2006

Algebraic Methodology and Software Technology

View full text Add to dashboard Cite

show abstract

“…In the lattice of intervals, the problem is studied in [57], [26] and [33]. [53] proposes a direct method to solve polyhedra fixpoint equations through the use of Farkas lemma and quantifier elimi-nation.…”

Section: Other Approaches To Compute Invariantsmentioning

confidence: 99%

Abstract acceleration in linear relation analysis

Gonnord

Schrammel

2014

Science of Computer Programming

View full text Add to dashboard Cite

Linear Relation Analysis [28,39] is now a classical abstract interpretation based on an approximation of reachable numerical states of a program by convex polyhedra. Since it works with a lattice of infinite depth, it makes use of a widening operator to enforce the convergence of fixpoint computations. This paper takes place in the many attempts to improve the precision of the results reached using such a widening. It will first present an extended survey of the existing approaches in that direction. Then it will investigate the cases where the exact (abstract) effect of a loop can be computed. This technique is fully compatible with the use of widening, and whenever it applies, it generally improves both the precision and the performances of the analysis.

show abstract

“…Having performed this static approximation, one is left with the problem of solving (1). The paper focuses on this problem.…”

Section: Introduction and Related Workmentioning

confidence: 99%

Widening with Thresholds for Programs with Complex Control Graphs

Lakhdar-Chaouch

Jeannet

Girault

2011

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings and Narrowings

Cited by 15 publications

References 34 publications

Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues

Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues

Abstract acceleration in linear relation analysis

Widening with Thresholds for Programs with Complex Control Graphs

Contact Info

Product

Resources

About