Sciweavers

981 search results - page 157 / 197
» Symbolic pointer analysis
Sort
View
STTT
2008
95views more  STTT 2008»
13 years 8 months ago
FAST: acceleration from theory to practice
Abstract. Fast is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing the reachability set of the system under stud...
Sébastien Bardin, Alain Finkel, Jér&...
IJDAR
2000
85views more  IJDAR 2000»
13 years 8 months ago
Mathematical expression recognition: a survey
Abstract. Automatic recognition of mathematical expressions is one of the key vehicles in the drive towards transcribing documents in scientific and engineering disciplines into el...
Kam-Fai Chan, Dit-Yan Yeung
ENTCS
2002
139views more  ENTCS 2002»
13 years 8 months ago
Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
Conrado Daws, Marta Z. Kwiatkowska, Gethin Norman
SCP
1998
134views more  SCP 1998»
13 years 8 months ago
Abstract Interpretation Using Typed Decision Graphs
Interpretation Using Typed Decision Graphs Laurent Mauborgne LIENS, ´Ecole Normale Sup´erieure, 45 rue d’Ulm, 75230 Paris cedex 05, France Abstract. This article presents a way...
Laurent Mauborgne
LPAR
2010
Springer
13 years 6 months ago
Interpolating Quantifier-Free Presburger Arithmetic
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
Daniel Kroening, Jérôme Leroux, Phili...