Sciweavers

1189 search results - page 29 / 238
» The Quotient of an Abstract Interpretation
Sort
View
CAV
2009
Springer
141views Hardware» more  CAV 2009»
14 years 10 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
FM
1999
Springer
161views Formal Methods» more  FM 1999»
14 years 2 months ago
On-the-Fly Controller Synthesis for Discrete and Dense-Time Systems
We present novel techniques for efficient controller synthesis for untimed and timed systems with respect to invariance and reachability properties. In the untimed case, we give al...
Stavros Tripakis, Karine Altisen
FOCS
1997
IEEE
14 years 2 months ago
Computable Obstructions to Wait-free Computability
Abstract. We show how to associate e ectively computableobstructions to a waitfree distributed decision task (I;O; ) in the asynchronous shared-memory, readwrite model. The key new...
John Havlicek
MMB
2010
Springer
185views Communications» more  MMB 2010»
13 years 12 months ago
Correctness Issues of Symbolic Bisimulation Computation for Markov Chains
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
Ralf Wimmer, Bernd Becker
FCS
2008
13 years 11 months ago
Why Brouwer Was Justified in his Objection to Hilbert's Unqualified Interpretation of Quantification
Abstract We define a finitary model of firstorder Peano Arithmetic in which quantification is interpreted constructively in terms of Turingcomputability, and show that it is incons...
Bhupinder Singh Anand