960,818 Hits in 4.8 sec

Making abstract interpretations complete

Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari
2000 Journal of the ACM  
Our primary goal is then to solve the problem of making abstract interpretations complete by minimally extending or restricting the underlying abstract domains.  ...  COMPLETENESS IN ABSTRACT INTERPRETATION.  ...  FIXPOINT COMPLETE CORES. Let us now face the problem of making abstract interpretations fixpoint complete.  ... 
doi:10.1145/333979.333989 fatcat:uiwdkf7ptja5fg2cdzj2k43sum

Abstract Interpretation-Based Protection [chapter]

Roberto Giacobazzi
2010 Lecture Notes in Computer Science  
) O as suitable abstract interpreters.  ...  Hiding information means both hiding as making it imperceptible and obscuring as making it incomprehensible [9] .  ...  We show how obfuscation can be viewed as a program transformation making abstractions incomplete and at the same time we show how watermark extraction can be viewed as a complete abstract interpretation  ... 
doi:10.1007/978-3-642-11319-2_4 fatcat:ecyxmhfuujbl7ovgtg6ntdtb54

Hiding Information in Completeness Holes: New Perspectives in Code Obfuscation and Watermarking

Roberto Giacobazzi
2008 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods  
In this paper we show how abstract interpretation, and more specifically completeness, provides an adequate model for reasoning about code obfuscation and watermarking.  ...  Here abstract interpretation provides the model of the attacker (malicious host) and abstract interpretation transformers provide driving methods for understanding and designing new obfuscation and watermarking  ...  Failing precision means failing completeness, therefore: obfuscating programs is making abstract interpreters incomplete The larger is the set of incomplete interpreters the stronger is the obfuscation  ... 
doi:10.1109/sefm.2008.41 dblp:conf/sefm/Giacobazzi08a fatcat:chu3znvyinfa3odsbnjxgqm7nu

States vs. Traces in Model Checking by Abstract Interpretation [chapter]

Roberto Giacobazzi, Francesco Ranzato
2002 Lecture Notes in Computer Science  
In POPL'00, Cousot and Cousot showed that the classical state-based model checking of a very general temporal language called µ -calculus is an incomplete abstract interpretation of its trace-based semantics  ...  which is trace-complete.  ...  This work has been partially supported by the Italian MIUR Cofin2000 project "Abstract interpretation, type systems and control-flow analysis".  ... 
doi:10.1007/3-540-45789-5_32 fatcat:mn7rsnqalzdn7fwbpmfwbojhwa

Sound up-to techniques and Complete abstract domains [article]

Filippo Bonchi, Pierre Ganty, Roberto Giacobazzi, Dusko Pavlovic
2018 arXiv   pre-print
For completeness, the setting is switched: up-to techniques are always complete, while abstract domains are not.  ...  While abstract interpretation is always sound by definition, the soundness of up-to techniques needs some ingenuity to be proven.  ...  But the latter condition is anyway necessary to make abstract interpretation meaningful (see e.g. Lemma 4.1) .  ... 
arXiv:1804.10507v2 fatcat:2go2ofzmh5h6hlqbmucitzmyey

Complete abstract interpretations made constructive [chapter]

Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari
1998 Lecture Notes in Computer Science  
power of abstract interpretations.  ...  Completeness is a desirable, although uncommon, property of abstract interpretations, formalizing the intuition that, relatively to the underlying abstract domains, the abstract semantics is as precise  ...  We wish to thank Enea Zaffanella for his helpful remarks on quotients of abstract interpretations and an anonymous referee for his/her useful comments.  ... 
doi:10.1007/bfb0055786 fatcat:bafbn7uzsnhdzlvesqve4nq3wm

Making Abstract Domains Condensing [article]

R. Giacobazzi, F. Ranzato, F. Scozzari
2002 arXiv   pre-print
We prove that condensation is an abstract domain property and that the problem of making an abstract domain condensing boils down to the problem of making the domain complete with respect to unification  ...  In a general abstract interpretation setting we show that when concrete domains and operations give rise to quantales, i.e. models of propositional linear logic, objects in a complete refined abstract  ...  Completeness in abstract interpretation Completeness in abstract interpretation uniquely depends upon the abstraction map [Giacobazzi and Ranzato 1997 ].  ... 
arXiv:cs/0204016v1 fatcat:weqtvrio2vcndmohyvchpctj64

Adjoining Declassification and Attack Models by Abstract Interpretation [chapter]

Roberto Giacobazzi, Isabella Mastroeni
2005 Lecture Notes in Computer Science  
This is achieved by interpreting the well known Joshi and Leino's semantic approach to non-interference as a problem of making an abstraction complete relatively to a program's semantics.  ...  called public observable, both modeled as abstractions of the program's semantics, are respectively the adjoint solutions of a completeness problem in standard abstract interpretation theory.  ...  Abstract Non-interference as Completeness Joshi and Leino's semantic-based approach to information flows [19] provides a way to interpret abstract non-interference as the problem of making an abstraction  ... 
doi:10.1007/978-3-540-31987-0_21 fatcat:f6lo3gwgircvdensu65uluzes4

Abstract Interpretation From a Denotational-semantics Perspective

David A. Schmidt
2009 Electronical Notes in Theoretical Computer Science  
The key notions of abstract-interpretation backwards and forwards completeness are explained in terms of topologically closed and continuous maps in a coarsened version of the Scott-topology.  ...  the language's abstract interpretation.  ...  This makes notions like Galois connection, disjunctive completion, and forwards completeness critical to the design of a useful abstract interpretation.  ... 
doi:10.1016/j.entcs.2009.07.082 fatcat:no2nmac7sjfxtn7ht5c22y7n2m

On the Completeness of Model Checking [chapter]

Francesco Ranzato
2001 Lecture Notes in Computer Science  
Hence, this opens up the key question of making an abstract interpretation complete by minimally extending the underlying abstract domain.  ...  Giacobazzi et al. [8] observed that completeness for an abstract interpretation, i.e. abstract domains plus abstract operations, only depends on the underlying abstract domains.  ...  This work has been partly supported by the Italian MURST project "Automatic program certification by asbtract interpretation".  ... 
doi:10.1007/3-540-45309-1_10 fatcat:f2c2v7tfkndybepwkjwtajry4y

Page 8286 of Mathematical Reviews Vol. , Issue 2001K [page]

2001 Mathematical Reviews  
Our primary goal is then to solve the problem of making abstract interpretations complete by minimally extending or re- stricting the underlying abstract domains.  ...  Thus, complete abstract interpretations can be rightly understood as optimal. We deal with both pointwise complete- ness, involving generic semantic operations, and (least) fixpoint completeness.  ... 

A unifying view of abstract domain design

Gilberto Filé, Roberto Giacobazzi, Francesco Ranzato
1996 ACM Computing Surveys  
This new unifying viewpoint makes both the understanding and the design of operators on abstract domains much simpler.  ...  The concept of abstract interpretation has been introduced by Patrick and Radhia Cousot in [4, 5] , in order to formalize static program analyses.  ...  of all abstract interpretations of C ) a complete lattice.  ... 
doi:10.1145/234528.234742 fatcat:glx3x6ghfbgqtmcwrdppzqyqgi

Logical Abstract Domains and Interpretations [chapter]

Patrick Cousot, Radhia Cousot, Laurent Mauborgne
2010 The Future of Software Engineering  
We exhibit conditions for a sound usage of such methods with respect to multi-interpreted semantics and extend their usage to automatic invariant generation by abstract interpretation.  ...  We give semantic foundations to abstract domains consisting in first order logic formulae in a theory, as used in verification tools or methods using SMT-solvers or theorem provers.  ...  Models An interpretation I ∈ I is said to be a model of Ψ when ∃η : I | = η Ψ (i.e. I makes Ψ true).  ... 
doi:10.1007/978-3-642-15187-3_3 dblp:conf/birthday/CousotCM10a fatcat:qdeq3a4svvdmhkiag2yy45nrsi

Hierarchic Superposition with Weak Abstraction [chapter]

Peter Baumgartner, Uwe Waldmann
2013 Lecture Notes in Computer Science  
(This is independent of the abstraction method used; it would also have been useful in [4] .) 8 Note that J need not be a B-interpretation.  ...  definition of sufficient completeness.  ...  Another alternative to make N sufficiently complete is by adding a clause that forces f (1) to be equal to some background domain element.  ... 
doi:10.1007/978-3-642-38574-2_3 fatcat:4erez23x4nfntlahy7lejzf4wq

Automatic Verification by Abstract Interpretation [chapter]

Patrick Cousot
2002 Lecture Notes in Computer Science  
Interpretation x x x x Abstract InterpretationAbstract interpretation theory [Thesis, POPL '77, PO-PL '79, JLC '92] formalizes the idea of abstraction for mathematical constructs involved in the specification  ...  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4 th POPL, pages 238-252, 1977.  ...  Making abstract interpretations complete. J. Connection-Based Abstraction [POPL '79, Sec. 5.3] ACM, 47(2):361- 416, 2000.  ... 
doi:10.1007/3-540-36384-x_4 fatcat:tmez6gkkrndr3hdjulrwa54lhi
« Previous Showing results 1 — 15 out of 960,818 results