Filters








9,498 Hits in 4.8 sec

Abstract interpretation

Patrick Cousot
1996 ACM Computing Surveys  
We review how the dependence upon semantics has been taken into account in abstract interpretation based program analysis and next propose to design general purpose abstract interpreters taking semantics  ...  Semantics Used for Static Analysis by Abstract Interpretation A contribution of abstract interpretation was to understand that program static analyzers can be formally designed by discrete approximation  ...  Static Analysis Parameterized by Abstract Domains In the classical approach, a program analyzer is usually designed for a specific programming language and its soundness is based upon a specific standard  ... 
doi:10.1145/234528.234740 fatcat:7sf2zvjdfrcnxmggblh7bgs6mm

Abstract interpretation

Patrick Cousot, Radhia Cousot
2014 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14  
We review how the dependence upon semantics has been taken into account in abstract interpretation based program analysis and next propose to design general purpose abstract interpreters taking semantics  ...  Semantics Used for Static Analysis by Abstract Interpretation A contribution of abstract interpretation was to understand that program static analyzers can be formally designed by discrete approximation  ...  Static Analysis Parameterized by Abstract Domains In the classical approach, a program analyzer is usually designed for a specific programming language and its soundness is based upon a specific standard  ... 
doi:10.1145/2603088.2603165 dblp:conf/csl/CousotC14 fatcat:4vwvctw2bbbvhihzx6s3m6yaiy

Foreword to the special issue on the 2017 Static Analysis Symposium

Francesco Ranzato
2019 Formal methods in system design  
The series of Static Analysis Symposia serves as a primary venue for the presentation of theoretical, practical, and applicational advances in the area of static analysis of programs and systems.  ...  This volume of Formal Methods in System Design (FMSD) features extended and revised versions of a selection of papers presented at the Static Analysis Symposium (SAS) held on 2017 in New York, NY.  ...  In the last paper "A New Abstraction Framework for Affine Transformers", Sharma and Reps [4] present an abstract interpretation-based static analysis of numerical properties of programs.  ... 
doi:10.1007/s10703-019-00340-1 fatcat:an5ityhcpbbr5h5cqxqqud7v2a

Proving the absence of run-time errors in safety-critical avionics code

Patrick Cousot
2007 Proceedings of the 7th ACM & IEEE international conference on Embedded software - EMSOFT '07  
We explain program correctness proofs by static analysis and the design of a static analyzer by abstract interpretation of a program semantics.  ...  None of the actual executions of the program being omitted, abstract-interpretation-based static analyzers have no false negatives hence are sound by design.  ...  We explain program correctness proofs by static analysis and the design of a static analyzer by abstract interpretation of a program semantics.  ... 
doi:10.1145/1289927.1289932 dblp:conf/emsoft/Cousot07 fatcat:mdv3xbuynzgrxmtiox3fuamf4u

Parameterized partial evaluation

Charles Consel, Siau Cheng Khoo
1993 ACM Transactions on Programming Languages and Systems  
The main semantic domain used by the analysis is denoted by y=, which is a sum of products of abstract facets-each summand corresponds to a semantic algebra.  ...  The safety criteria of this abstraction are captured by the notion of facet mapping. This mapping is defined using abstract interpretation [2, 15] .  ...  Thus, a= is a facet mapping with respect to 7, and Definition 10 defines an abstract facet.  ... 
doi:10.1145/169683.174155 fatcat:x5qgpftsavahblatlm3wwkinwm

Parameterized partial evaluation

Charles Consel, Siau Cheng Khoo
1991 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation - PLDI '91  
The main semantic domain used by the analysis is denoted by y=, which is a sum of products of abstract facets-each summand corresponds to a semantic algebra.  ...  The safety criteria of this abstraction are captured by the notion of facet mapping. This mapping is defined using abstract interpretation [2, 15] .  ...  Thus, a= is a facet mapping with respect to 7, and Definition 10 defines an abstract facet.  ... 
doi:10.1145/113445.113454 dblp:conf/pldi/ConselK91 fatcat:mgzbc3mbljfinlr6ettzexbstu

Parameterized partial evaluation

Charles Consel, Siau Cheng Khoo
1991 SIGPLAN notices  
The main semantic domain used by the analysis is denoted by y=, which is a sum of products of abstract facets-each summand corresponds to a semantic algebra.  ...  The safety criteria of this abstraction are captured by the notion of facet mapping. This mapping is defined using abstract interpretation [2, 15] .  ...  Thus, a= is a facet mapping with respect to 7, and Definition 10 defines an abstract facet.  ... 
doi:10.1145/113446.113454 fatcat:md74w42qdzgepd3b6qnhvigak4

Abstract parsing for two-staged languages with concatenation

Soonho Kong, Wontae Choi, Kwangkeun Yi
2009 Proceedings of the eighth international conference on Generative programming and component engineering - GPCE '09  
This article, based on Doh, Kim, and Schmidt's "abstract parsing" technique, presents an abstract interpretation for statically checking the syntax of generated code in two-staged programs.  ...  We parameterize our analysis with the abstract domain so that one can choose the abstract domain as long as it satisfies the condition we provide.  ...  Code concatenation is handled simply by function composition. • We generalize the abstract-parsing abstract interpretation, as usual, by parameterizing the abstract domain of parse stacks.  ... 
doi:10.1145/1621607.1621625 dblp:conf/gpce/KongCY09 fatcat:ksfxka6eprdx3czvwqiifjleju

Abstract parsing for two-staged languages with concatenation

Soonho Kong, Wontae Choi, Kwangkeun Yi
2010 SIGPLAN notices  
This article, based on Doh, Kim, and Schmidt's "abstract parsing" technique, presents an abstract interpretation for statically checking the syntax of generated code in two-staged programs.  ...  We parameterize our analysis with the abstract domain so that one can choose the abstract domain as long as it satisfies the condition we provide.  ...  Code concatenation is handled simply by function composition. • We generalize the abstract-parsing abstract interpretation, as usual, by parameterizing the abstract domain of parse stacks.  ... 
doi:10.1145/1837852.1621625 fatcat:e2f6e2y3dveyjfk4mb3tj2nqqq

The ASTREÉ Analyzer [chapter]

Patrick Cousot, Radhia Cousot, Jerôme Feret, Laurent Mauborgne, Antoine Miné, David Monniaux, Xavier Rival
2005 Lecture Notes in Computer Science  
ASTRÉE is an abstract interpretation-based static program analyzer aiming at proving automatically the absence of run time errors in programs written in the C programming language.  ...  This work was supported in part by the French exploratory project ASTRÉE of the Réseau National de recherche et d'innovation en Technologies Logicielles (RNTL).  ...  abstract-interpretation based static analysis [4, 5] in a few hours of computations, without any false alarm.  ... 
doi:10.1007/978-3-540-31987-0_3 fatcat:6ku3gny34bemtd7fmksc4ig26e

Page 2887 of Mathematical Reviews Vol. , Issue 2003d [page]

2003 Mathematical Reviews  
(F-ENS-DI; Paris) Constructive design of a hierarchy of semantics of a transition system by abstract interpretation.  ...  Abstract interpretation was introduced in 1977 by Patrick and Radhia Cousot as a unifying framework for designing program analysis algorithms.  ... 

Alternating Control Flow Reconstruction [chapter]

Johannes Kinder, Dmitry Kravchenko
2012 Lecture Notes in Computer Science  
We provide an abstract interpretation framework for control flow reconstruction that alternates between over-and under-approximation.  ...  If static analysis cannot compute a precise set of possible targets for a branch, the necessary conservative over-approximation introduces a large amount of spurious edges, leading to even more imprecision  ...  The second author is supported by CASED (www.cased.de).  ... 
doi:10.1007/978-3-642-27940-9_18 fatcat:xowujkb34zashjthtzlbj6oj34

Deriving Static Security Testing from Runtime Security Protection for Web Applications

Angel Luis Scull Pupo, Jens Nicolay, Elisa Gonzalez Boix
2021 The Art, Science, and Engineering of Programming  
Moreover, our two-phase abstract interpretation approach does not require RASP developers to reimplement the enforcement code for static analysis.  ...  The static analysis of security policies is then obtained from the RASP mechanism by first statically analyzing the base program without any traps.  ...  Deriving a static analysis through abstract interpretation is safe, because both the dynamic analysis and the (derived) static analysis are based on the same specification code in JavaScript, so no semantic  ... 
doi:10.22152/programming-journal.org/2022/6/1 fatcat:5r4k376qkvcqhcudqf2wdklf2i

Abstracting Abstract Machines: A Systematic Approach to Higher-Order Program Analysis [article]

David Van Horn, Matthew Might
2011 arXiv   pre-print
We contribute a systematic approach to program analysis that yields novel and transparently sound static analyses.  ...  What analysis designers need is a principled method for navigating the gap between semantics and analytic models: analysis designers need a method that tames the interaction of complex languages features  ...  [20] , the theory of abstract interpretation with the seminal work of Cousot and Cousot [4] , and static analysis of the λ-calculus with Jones's coupling of abstract ma-chines and abstract interpretation  ... 
arXiv:1105.1743v1 fatcat:sf2vmzg3nfh5vlrpjexlzhbkga

Certified Static Analysis by Abstract Interpretation [chapter]

Frédéric Besson, David Cachera, Thomas Jensen, David Pichardie
2009 Lecture Notes in Computer Science  
A certified static analysis is an analysis whose semantic validity has been formally proved correct with a proof assistant. We propose a tutorial on building a certified static analysis in Coq.  ...  We study a simple bytecode language for which we propose an interval analysis that allows to verify statically that no array-out-of-bounds accesses will occur.  ...  Acknowledgments This work is supported by the Integrated Project MOBIUS, within the Global Computing II initiative.  ... 
doi:10.1007/978-3-642-03829-7_8 fatcat:eyjfd7uqjbaatn2nei4kiykrti
« Previous Showing results 1 — 15 out of 9,498 results