KBSE
1999
IEEE
14 years 3 months ago
1999
IEEE
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
ECOOP
2001
Springer
14 years 4 months ago
2001
Springer
Abstract. The application field of static analysis techniques for objectoriented programming is getting broader, ranging from compiler optimizations to security issues. This leads...
ICISS
2009
Springer
14 years 4 months ago
2009
Springer
In this paper we introduce a distortion free watermarking e for relational databases based on the Abstract Interpretation framework. The watermarking technique is partition based. ...
LPAR
2004
Springer
14 years 4 months ago
2004
Springer
ion-Carrying Code Elvira Albert1 , Germ´an Puebla2 , and Manuel Hermenegildo2,3 1 DSIP, Universidad Complutense Madrid 2 Facultad de Inform´atica, Technical University of Madrid ...
LOPSTR
2004
Springer
14 years 4 months ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
ICESS
2004
Springer
14 years 4 months ago
2004
Springer
Recent work showed that staging and abstract interpretation can be used to derive correct families of combinatorial circuits, and illustrated this technique with an in-depth analys...
CAV
2004
Springer
14 years 4 months ago
2004
Springer
This paper reviews the principles behind the paradigm of “abstract interpretation via § -valued logic,” discusses recent work to extend the approach, and summarizes ongoing re...
ICLP
2005
Springer
14 years 5 months ago
2005
Springer
The relationship between abstract interpretation and partial deduction has received considerable attention and (partial) integrations have been proposed starting from both the part...
ESOP
2005
Springer
14 years 5 months ago
2005
Springer
Additional Key Words and Phrases: program analysis, modular arithmetic, abstract interpretation, affine relation, interprocedural analysis
CONCUR
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. In this paper we show how to compress efficiently the statespace of a concurrent system (here applied to a simple shared memory model, but this is no way limited to that ...