Filters








15,877 Hits in 4.8 sec

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

Certified Information Flow Analysis of Service Implementations

Thomas S. Heinze, Jasmin Turker
2018 2018 IEEE 11th Conference on Service-Oriented Computing and Applications (SOCA)  
As is shown by the example of a static information flow analysis and its accompanying Coq development, certified analysis of distributed business processes is feasible and provides machine-checkable correctness  ...  In such an auditing scenario, analysis correctness is key but is usually taken for granted. We therefore argue in this paper for the idea of certified analysis.  ...  II, abstract interpretation provides a well-grounded theory for static data flow analysis which will be used for formalizing the information flow analysis.  ... 
doi:10.1109/soca.2018.00033 dblp:conf/soca/HeinzeT18 fatcat:les7lhfdqzgo3eswru5bbspcae

Proof-carrying code from certified abstract interpretation and fixpoint compression

Frédéric Besson, Thomas Jensen, David Pichardie
2006 Theoretical Computer Science  
We show how certified abstract interpretation can be used to build a PCC architecture where the code producer can produce program certificates automatically.  ...  Code consumers use proof checkers derived from certified analysers to check certificates.  ...  A Coq signature of certified static analyses The notion of certified analysis is based on previous work on programming a static analyser in Coq [7, 22] .  ... 
doi:10.1016/j.tcs.2006.08.012 fatcat:euvgvxbrcve6jkh5wzhuxahiyy

Static analysis for software assurance

Arnaud J. Venet, Michael R. Lowry
2010 Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER '10  
We propose to include static analysis by Abstract Interpretation to the software development cycle.  ...  Static analysis by Abstract Interpretation provides a high level of assurance as well as ground-truth evidence in support of its findings.  ...  In this position paper, we advocate for the use of static analysis by abstract interpretation as a fully automated certification process for modern software assurance.  ... 
doi:10.1145/1882362.1882442 dblp:conf/sigsoft/VenetL10 fatcat:bxwp3kzj3rftjnhjyldtap633i

Certified Result Checking for Polyhedral Analysis of Bytecode Programs [chapter]

Frédéric Besson, Thomas Jensen, David Pichardie, Tiphaine Turpin
2010 Lecture Notes in Computer Science  
In this paper we develop a certified checker in Coq that is able to certify the results of a polyhedral array-bound analysis for an imperative, stack-oriented bytecode language with procedures, arrays  ...  Static analysers are becoming so complex that it is crucial to ascertain the soundness of their results in a provable way.  ...  , and intra-procedural relational abstract interpretation for high-level imperative languages is by now a mature analysis technique.  ... 
doi:10.1007/978-3-642-15640-3_17 fatcat:4yb7xhwr3zg6jjume42oedoipq

An Abstract Model of Certificate Translation

Gilles Barthe, César Kunz
2011 ACM Transactions on Programming Languages and Systems  
This article provides a more general development in the setting of abstract interpretation, showing the scalability of certificate translation.  ...  be checked by the collaboration of two verification formalisms, typically static analysis and deductive verification.  ...  The aim of certifying analysis is to transform a proof of program correctness from one verification formalism to another; typically, a certi-fying analyzer will transform a proof using static analysis  ... 
doi:10.1145/1985342.1985344 fatcat:lehjihgxojh4poggyovzmhz4sa

A Certified Denotational Abstract Interpreter [chapter]

David Cachera, David Pichardie
2010 Lecture Notes in Computer Science  
Interpretation proposes advanced techniques for static analysis of programs that raise specific challenges for machinechecked soundness proofs.  ...  In contrast, abstract interpreters are looking for fixpoints in infinite lattices where widening and narrowing are used for accelerating the convergence.  ...  A first attempt of a certified abstract interpreter with widening/narrowing iteration techniques has been proposed by Pichardie [13] .  ... 
doi:10.1007/978-3-642-14052-5_3 fatcat:spqaffa76bfzzkikywdk5ccu7u

Aspect-Oriented Runtime Monitor Certification [chapter]

Kevin W. Hamlen, Micah M. Jones, Meera Sridhar
2012 Lecture Notes in Computer Science  
This paper presents a machine-verification technique for aspect-oriented inlined reference monitors based on abstract interpretation and modelchecking.  ...  Its certifier performs a static analysis that verifies that contract-specified guard code appears at each security-relevant code point.  ...  Verification of events corresponding to statically undecidable pointcuts (such as argval) requires analysis of dynamic checks inserted by the rewriter, which consider the contents of the stack and local  ... 
doi:10.1007/978-3-642-28756-5_10 fatcat:f44u3dq7cnhoppkaixqf236aqu

Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra [chapter]

Sylvain Boulmé, Alexandre Maréchal
2015 Lecture Notes in Computer Science  
Our concern is the modular development of a certified static analyzer in Coq: we extend a certified abstract domain of convex polyhedra with a linearization procedure approximating polynomial expressions  ...  It allows to hide for proofs several low-level aspects of the computations on abstract domains. Moreover, refinement proofs are naturally simplified thanks to computations of weakest preconditions.  ...  (VPL) [6, 7] , which provides a certified polyhedra domain to Verasco [8] , a certified abstract interpreter for CompCert C [9] .  ... 
doi:10.1007/978-3-319-22102-1_7 fatcat:6qfvvf4zzndgronbfjikzankji

Deriving specialized program analyses for certifying component-client conformance

G. Ramalingam, Alex Warshavsky, John Field, Deepak Goyal, Mooly Sagiv
2002 SIGPLAN notices  
Abstract interpretation, model checking, software components, predicate abstraction, static analysis class Make { private Worklist worklist; public static void main (String[] args) { Make m = new Make(  ...  In the second stage, the generated abstraction is incorporated into a static analysis engine to produce a certifier.  ...  The generated abstraction is combined with a static analysis engine to yield a certifier specific to the component's conformance specification.  ... 
doi:10.1145/543552.512540 fatcat:h7kgiisupfh3ravcvzpov24ebe

Deriving specialized program analyses for certifying component-client conformance

G. Ramalingam, Alex Warshavsky, John Field, Deepak Goyal, Mooly Sagiv
2002 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation - PLDI '02  
Abstract interpretation, model checking, software components, predicate abstraction, static analysis class Make { private Worklist worklist; public static void main (String[] args) { Make m = new Make(  ...  In the second stage, the generated abstraction is incorporated into a static analysis engine to produce a certifier.  ...  The generated abstraction is combined with a static analysis engine to yield a certifier specific to the component's conformance specification.  ... 
doi:10.1145/512529.512540 dblp:conf/pldi/RamalingamWFGS02 fatcat:c7cg26fgy5cbjkdnivgg464kcm

Deriving specialized program analyses for certifying component-client conformance

G. Ramalingam, Alex Warshavsky, John Field, Deepak Goyal, Mooly Sagiv
2002 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation - PLDI '02  
Abstract interpretation, model checking, software components, predicate abstraction, static analysis class Make { private Worklist worklist; public static void main (String[] args) { Make m = new Make(  ...  In the second stage, the generated abstraction is incorporated into a static analysis engine to produce a certifier.  ...  The generated abstraction is combined with a static analysis engine to yield a certifier specific to the component's conformance specification.  ... 
doi:10.1145/512537.512540 fatcat:tm3hsbj3jzfdloi63lv7n5qs64

Refinement to Certify Abstract Interpretations: Illustrated on Linearization for Polyhedra

Sylvain Boulmé, Alexandre Maréchal
2018 Journal of automated reasoning  
Our concern is the modular development of a certified static analyzer in the Coq proof assistant.  ...  These diagrams relate "abstract states" computed by the analyzer to "concrete states" of the input program.  ...  A Certified Linearization for the Abstract Domain of Polyhedra We consider the certification of an abstract interpreter, which aims at ensuring absence of undefined behaviors such as division by zero or  ... 
doi:10.1007/s10817-018-9492-2 fatcat:bq2ztwbt5nhilesotkqanxsikq

Flexible in-lined reference monitor certification

Meera Sridhar, Kevin W. Hamlen
2011 Proceedings of the 5th ACM workshop on Programming languages meets program verification - PLPV '11  
Abstract Syntax Tree (AST) R1 R2 · · · Rn Code Generator Instrumented AST IRM FRAMEWORK Parser Instrumented ABC File Model-checker + Abstract Interpreter AST  ...  Promising directions suggested by recent work related to these problems are highlighted.  ...  by the static analysis.  ... 
doi:10.1145/1929529.1929537 dblp:conf/plpv/SridharH11 fatcat:7us3uunby5a6hailbdytll6azu

Static Analysis on Floating-Point Programs Dealing with Division Operations

MG Thushara, K. Somasundaram
2019 International Journal of Advanced Computer Science and Applications  
Given a certain accuracy for the inputs of a program, the static analysis computes a safe approximation of the accuracy on the outputs.  ...  Based on the theory of abstract interpretation, in the paper an upper bound to the precision of the results of these computations in program have been demonstrated.  ...  Our approach is to combine a forward and a backward static analysis, done by abstract interpretation.  ... 
doi:10.14569/ijacsa.2019.0101058 fatcat:fzpix3gc5rf6jeu6fga2ypp3mi
« Previous Showing results 1 — 15 out of 15,877 results