Sciweavers

5 search results - page 1 / 1
» Widening Polyhedra with Landmarks
Sort
View
APLAS
2006
ACM
13 years 10 months ago
Widening Polyhedra with Landmarks
The abstract domain of polyhedra is sufficiently expressive to be deployed in verification. One consequence of the richness of this domain is that long, possibly infinite, sequen...
Axel Simon, Andy King
VMCAI
2004
Springer
13 years 10 months ago
Widening Operators for Powerset Domains
Abstract. The finite powerset construction upgrades an abstract domain by allowing for the representation of finite disjunctions of its elements. In this paper we define three g...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
SAS
1999
Springer
13 years 9 months ago
Polyhedral Analysis for Synchronous Languages
We define an operational semantics for the Signal language and design an analysis which allows to verify properties pertaining to the relation between values of the numeric and bo...
Frédéric Besson, Thomas P. Jensen, J...
ASIAN
2006
Springer
152views Algorithms» more  ASIAN 2006»
13 years 8 months ago
Inferring Disjunctive Postconditions
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...
Corneliu Popeea, Wei-Ngan Chin
SAS
2004
Springer
136views Formal Methods» more  SAS 2004»
13 years 10 months ago
Constraint-Based Linear-Relations Analysis
Abstract. Linear-relations analysis of transition systems discovers linear invariant relationships among the variables of the system. These relationships help establish important s...
Sriram Sankaranarayanan, Henny B. Sipma, Zohar Man...