Applications of polyhedral computations to the analysis and verification of hardware and software systems
type: Item
instance of: scholarly article
title: Applications of polyhedral computations to the analysis and verification of hardware and software systems
zbMATH Open document ID: 1187.68311
author: Roberto Bagnara
author: Patricia M. Hill
author: Enea Zaffanella
published in: Theoretical Computer Science
publication date: 2009-11-04T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68T37
zbMATH DE Number: 5624945
zbMATH Keywords: static analysis
zbMATH Keywords: computer-aided verification
zbMATH Keywords: abstract interpretation
describes a project that uses: PHAVer
describes a project that uses: PPL
describes a project that uses: ASTREE
describes a project that uses: SPHIN
describes a project that uses: SPIN
describes a project that uses: HyTech
describes a project that uses: PolyLib
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.07.033
OpenAlex ID: W2088667970
cites work: Q3345690
cites work: The algorithmic analysis of hybrid systems
cites work: Q4518988
cites work: How good are convex hull algorithms?
cites work: A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
cites work: Grids: A Domain for Analyzing the Distribution of Numerical Values
cites work: Precise widening operators for convex polyhedra
cites work: Not necessarily closed convex polyhedra and the double description method
cites work: Static Analysis
cites work: Q3241581
cites work: Convexity recognition of the union of polyhedra
cites work: Q5532570
cites work: Q4414726
cites work: Algorithm for discovering the set of all the solutions of a linear programming problem
cites work: Q2769578
cites work: Combinations of abstract domains for logic programming: Open product and generic pattern construction
cites work: Verification, Model Checking, and Abstract Interpretation
cites work: ``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs
cites work: Abstract Interpretation Frameworks
cites work: Grammar semantics, analysis and parsing by abstract interpretation
cites work: Constraint propagation with interval labels
cites work: Q4778703
cites work: Formal Modeling and Analysis of Timed Systems
cites work: Hybrid Systems: Computation and Control
cites work: A framework for numeric analysis of array operations
cites work: Tools and Algorithms for the Construction and Analysis of Systems
cites work: Some ways to reduce the space dimension in polyhedra computations
cites work: Q4804911
cites work: Q4503930
cites work: HyTech: A model checker for hybrid systems
cites work: Q3805933
cites work: Affine relationships among variables of a program
cites work: A unifying framework for several cutting plane methods for semidefinite programming
cites work: On Fourier's algorithm for linear arithmetic constraints
cites work: cTI: a constraint-based termination inference tool for ISO-Prolog
cites work: Q5817857
cites work: Two Variables per Linear Inequality as an Abstract Domain
cites work: SPHIN: a model checker for reconfigurable hybrid systems based on SPIN
cites work: Q5603731
cites work: Verifying Generalized Soundness of Workflow Nets
DOI: 10.1016/J.TCS.2009.07.033
description: scientific article; zbMATH DE number 5624945