Sciweavers

1914 search results - page 44 / 383
» Verification by Abstract Interpretation
Sort
View
221
Voted
POPL
2003
ACM
16 years 24 days ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
101
Voted
DATE
2008
IEEE
95views Hardware» more  DATE 2008»
15 years 7 months ago
Improving Constant-Coefficient Multiplier Verification by Partial Product Identification
Constant-coefficient multipliers are fundamental components in digital signal processing and arithmetic-based systems. Their verification, however, remains difficult and time-cons...
Chao-Yue Lai, Chung-Yang Huang, Kei-Yong Khoo
96
Voted
DSVIS
1998
Springer
15 years 4 months ago
The Role of Verification in Interactive Systems Design
Abstract. In this paper we argue that using verification in interactive systems development is more than just checking whether the specification of the system has all the required ...
José Creissac Campos, Michael D. Harrison
100
Voted
ICALP
2010
Springer
15 years 19 days ago
Towards a Theory of Time-Bounded Verification
Abstract. We propose a theory of time-bounded verification for realtime systems, in which verification queries are phrased over time intervals of fixed, bounded duration. We argue ...
Joël Ouaknine, James Worrell
88
Voted
CAV
2009
Springer
141views Hardware» more  CAV 2009»
16 years 1 months ago
Apron: A Library of Numerical Abstract Domains for Static Analysis
Library of Numerical Abstract Domains for Static Analysis Bertrand Jeannet1 and Antoine Min?e2 1 INRIA Rh^one-Alpes, Grenoble, France, Bertrand.Jeannet@inrialpes.fr 2 CNRS, ?Ecole ...
Antoine Miné, Bertrand Jeannet