Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs

DOI10.1016/j.entcs.2010.09.009zbMath1342.68100OpenAlexW2062182603MaRDI QIDQ2814110

Bertrand Jeannet, Peter Schrammel

Publication date: 17 June 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2010.09.009

zbMATH Keywords

accelerationstatic analysisabstract interpretationlinear relation analysis

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration ⋮ Acceleration of the abstract fixpoint computation in numerical program analysis ⋮ Applying abstract acceleration to (co-)reachability analysis of reactive programs ⋮ Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach

Uses Software

• Aspic
• LUSTRE
• FAST

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic partitioning in linear relation analysis: application to the verification of reactive systems
• Using forward reachability analysis for verification of lossy channel systems
• Combining Widening and Acceleration in Linear Relation Analysis
• Abstract interpretation and application to logic programs
• Automated Technology for Verification and Analysis
• Tools and Algorithms for the Construction and Analysis of Systems
• Proving safety properties of infinite state systems by compilation into Presburger arithmetic

This page was built for publication: Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs