Sciweavers

107 search results - page 8 / 22
» Improving Abstract Interpretations by Combining Domains
Sort
View
ACSD
2006
IEEE
76views Hardware» more  ACSD 2006»
13 years 11 months ago
Specification and Verification of Dynamic Communication Systems
Dynamic communication systems (DCS) are complex because of their unboundedness in several dimensions. They have an unbounded and changing number of objects, a dynamically changing...
Jörg Bauer, Ina Schaefer, Tobe Toben, Bernd W...
SAS
2005
Springer
135views Formal Methods» more  SAS 2005»
14 years 1 months ago
Taming False Alarms from a Domain-Unaware C Analyzer by a Bayesian Statistical Post Analysis
Abstract. We present our experience of combining, in a realistic setting, a static analyzer with a statistical analysis. This combination is in order to reduce the inevitable false...
Yungbum Jung, Jaehwang Kim, Jaeho Shin, Kwangkeun ...
CORR
2004
Springer
85views Education» more  CORR 2004»
13 years 7 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
AGP
1999
IEEE
13 years 11 months ago
Enhancing Sharing for Precision
Regarding the precision of combined domains including Jacobs and Langen's Sharing there is a core of techniques, such as the standard integration with freeness and linearity ...
Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 7 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...