Separation Logic for Small-Step Cminor, Proc. of TPHOLs. LNCS, vol.4732, pp.5-21, 2007. ,
Preventing Memory Error Exploits with WIT, 2008 IEEE Symposium on Security and Privacy (sp 2008), pp.263-277, 2008. ,
DOI : 10.1109/SP.2008.30
Smashing The Stack For Fun And Profit, 1996. ,
Program Logics for Certified Compilers, p.2014 ,
DOI : 10.1017/CBO9781107256552
Thorough static analysis of device drivers, ACM SIGOPS Operating Systems Review, vol.40, issue.4, pp.73-85, 2006. ,
DOI : 10.1145/1218063.1217943
WYSINWYX, ACM Transactions on Programming Languages and Systems, vol.32, issue.6, 2007. ,
DOI : 10.1145/1749608.1749612
Structural abstract interpretation, A formal study in Coq In: Language Engineering and Rigorous Software Development,nternational LerNet ALFA Summer School 2008, revised tutorial lectures, LNCS, vol.5520, pp.153-194, 2009. ,
A few billion lines of code later, Communications of the ACM, vol.53, issue.2, pp.66-75, 2010. ,
DOI : 10.1145/1646353.1646374
A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis, In: TYPES. LNCS, vol.3839, pp.66-81, 2006. ,
DOI : 10.1007/11617990_5
URL : https://hal.archives-ouvertes.fr/inria-00289549
Refinement- Based CFG Reconstruction from Unstructured Programs In: Verification, Model Checking and Abstract Interpretation (VMCAI), LNCS, vol.6538, pp.54-69, 2011. ,
Mechanized Semantics for the Clight Subset of the C Language, Journal of Automated Reasoning, vol.29, issue.6, pp.263-288, 2009. ,
DOI : 10.1007/s10817-009-9148-3
URL : https://hal.archives-ouvertes.fr/inria-00352524
A static analyzer for large safety-critical software, Proc. of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'03, pp.196-207, 2003. ,
Formal Verification of a C Value Analysis Based on Abstract Interpretation, Static Analysis Symposium (SAS), pp.324-344, 2013. ,
DOI : 10.1007/978-3-642-38856-9_18
URL : https://hal.archives-ouvertes.fr/hal-00812515
Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code, Proc. of the 5 th Conf. on Interactive Theorem Proving (ITP), p.2014 ,
URL : https://hal.archives-ouvertes.fr/hal-01102445
A Computability Perspective on Self-Modifying Programs, 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods, pp.231-239, 2009. ,
DOI : 10.1109/SEFM.2009.25
URL : https://hal.archives-ouvertes.fr/inria-00433472
Efficient Chaotic Iteration Strategies With Widenings, Proc. of FMPA 1993, pp.128-141, 1993. ,
Recency-abstraction for heap-allo?cated storage " . In: Static analysis (SAS), pp.221-239, 2006. ,
DOI : 10.1007/11823230_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.9169
Analyzing Stripped Device-Driver Executables, pp.124-140, 2008. ,
DOI : 10.1007/978-3-540-78800-3_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.3806
WYSINWYX, ACM Transactions on Programming Languages and Systems, vol.32, issue.6, pp.23-47, 2010. ,
DOI : 10.1145/1749608.1749612
Extracting a data flow analyser in constructive logic, In: Theoretical Computer Science, vol.3421, pp.56-78, 2005. ,
URL : https://hal.archives-ouvertes.fr/inria-00564633
Static determination of dynamic properties of programs, Proceedings of the Second International Symposium on Programming. Dunod, pp.106-130, 1976. ,
Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977. ,
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/hal-01108790
Systematic design of program analysis frameworks, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '79, pp.269-282, 1979. ,
DOI : 10.1145/567752.567778
Securing Software by Enforcing Data-flow Integrity, Proceedings of the 7 th USENIX Symposium on Operating Systems Design and Implementation. OSDI'06, pp.11-11, 2006. ,
A Uniform and Certified Approach for Two Static Analyses, In: TYPES. LNCS, vol.3839, pp.115-137, 2004. ,
DOI : 10.1007/11617990_8
Automatic discovery of linear restraints among variables of a program, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '78 ,
DOI : 10.1145/512760.512770
Mostly-automated verification of low-level programs in computational separation logic, Conf. on Programming Language Design and Implementation (PLDI). ACM, 2011. ,
The ASTRE?? Analyzer, Proceedings of the European Symposium on Programming (ESOP'05, pp.21-30, 2005. ,
DOI : 10.1007/978-3-540-31987-0_3
Why does Astr??e scale up?, Formal Methods in System Design, vol.345, issue.1, pp.229-264, 2009. ,
DOI : 10.1007/s10703-009-0089-6
Stack- Guard: Automatic Adaptive Detection and Prevention of Buffer-Overflow Attacks, In: Usenix Security, vol.98, pp.63-78, 1998. ,
A Certified Denotational Abstract Interpreter, LNCS, vol.6172, issue.46, pp.9-24, 2010. ,
DOI : 10.1007/978-3-642-14052-5_3
URL : https://hal.archives-ouvertes.fr/inria-00537810
Modular Construction of Shape-Numeric Analyzers, Electronic Proceedings in Theoretical Computer Science, vol.129, pp.161-185, 2013. ,
DOI : 10.4204/EPTCS.129.11
URL : https://hal.archives-ouvertes.fr/hal-00926948
Certified Self-Modifying Code, Conf. on Programming Language Design and Implementation (PLDI) ,
Manufacturing cheap, resilient, and stealthy opaque constructs, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '98, pp.184-196, 1998. ,
DOI : 10.1145/268946.268962
Frama-C: A Software Analysis Perspective, Proc. of SEFM 2012, pp.233-247, 2012. ,
On the semantics of self-unpacking malware code, p.71 ,
A Certifying Frontend for (Sub)polyhedral Abstract Domains, In: VSTTE. LNCS, vol.8471, issue.107, pp.200-215, 2014. ,
DOI : 10.1007/978-3-319-12154-3_13
Interprocedural Control Flow Reconstruction, Programming Languages and Systems, pp.188-203, 2010. ,
DOI : 10.1007/978-3-642-17164-2_14
Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra, 2013. ,
DOI : 10.1007/978-3-642-38856-9_19
The Four Colour Theorem: Engineering of a Formal Proof, LNCS, vol.5081, p.333, 2007. ,
DOI : 10.1007/978-3-540-87827-8_28
Engineering mathematics: the odd order theorem proof, Proc. of POPL'13. ACM, 2013, pp.1-2 ,
Nurit Dor, Thomas Reps, and Mooly Sagiv Numeric domains with summarized dimensions " . In: Tools and Algorithms for the Construction and Analysis of Systems, pp.512-529, 2004. ,
Static analysis of arithmetical congruences, International Journal of Computer Mathematics, vol.30, issue.3-4, pp.3-4, 1989. ,
DOI : 10.1145/29873.29875
Static analysis of linear congruence equalities among variables of a program, TAPSOFT'91, pp.169-192, 1991. ,
DOI : 10.1007/3-540-53982-4_10
Cyclone: A type-safe dialect of C, In: C/C++ Users Journal, vol.231, issue.2, pp.112-139, 2005. ,
A framework for numeric analysis of array operations, Proc. of the 32 th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.338-350, 2005. ,
A formal proof of the Kepler conjecture, 2015. ,
Verifying a Local Generic Solver in Coq, Proc. of SAS'10, pp.340-355, 2010. ,
DOI : 10.1007/978-3-642-15769-1_21
Discovering Properties About Arrays in Simple Programs, pp.339-348, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00288274
High-Level Separation Logic for Low-Level Code, Symp. on Principles of Programm. Lang. (POPL) ,
The Garbage Collection Handbook: The art of automatic memory management, pp.978-1420082791, 2011. ,
DOI : 10.1201/9781315388021
Cyclone: A Safe Dialect of C, USENIX Annual Technical Conference, General Track, pp.275-288, 2002. ,
Tentative steps toward a development method for interfering programs, ACM Transactions on Programming Languages and Systems, vol.5, issue.4, pp.596-619, 1983. ,
DOI : 10.1145/69575.69577
A Formally-Verified C Static Analyzer, Proc. of the 42 th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, pp.247-259, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01078386
Towards Scalable Translation Validation of Static Analyzers, 2014. ,
Affine relationships among variables of a program, Acta Informatica, vol.6, issue.2, pp.133-151, 1976. ,
DOI : 10.1007/BF00268497
Coq, Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, PPDP '13, pp.13-24, 2013. ,
DOI : 10.1145/2505879.2505897
URL : https://hal.archives-ouvertes.fr/hal-01081548
A unified approach to global program optimization, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp.194-206, 1973. ,
Towards Static Analysis of Virtualization-Obfuscated Binaries, 2012 19th Working Conference on Reverse Engineering, pp.61-70 ,
DOI : 10.1109/WCRE.2012.16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.2355
seL4, Communications of the ACM, vol.53, issue.6, pp.107-115, 2010. ,
DOI : 10.1145/1743546.1743574
A machine-checked model for a Java-like language, virtual machine, and compiler, ACM Transactions on Programming Languages and Systems, vol.28, issue.4, pp.619-695, 2006. ,
DOI : 10.1145/1146809.1146811
Program Compilation and Proof Transformation, 2009. ,
URL : https://hal.archives-ouvertes.fr/pastel-00004940
Jakstab: A Static Analysis Platform for Binaries, Computer Aided Verification, pp.423-427, 2008. ,
DOI : 10.1007/978-3-540-70545-1_40
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.233.3801
Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations, Journal of Automated Reasoning, vol.17, issue.5???6, 2008. ,
DOI : 10.1007/s10817-008-9099-0
URL : https://hal.archives-ouvertes.fr/inria-00289542
Obfuscation of executable code to improve resistance to static disassembly, Proceedings of the 10th ACM conference on Computer and communication security , CCS '03, pp.290-299, 2003. ,
DOI : 10.1145/948109.948149
Formal certification of a compiler back-end or : Programming a compiler with a proof assistant, pp.42-54, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00000963
A Formally Verified Compiler Back-end, Journal of Automated Reasoning, vol.27, issue.1, pp.363-446, 2009. ,
DOI : 10.1007/s10817-009-9155-4
URL : https://hal.archives-ouvertes.fr/inria-00360768
Personal communication, 2015. ,
The CompCert C verified compiler documentation and user's manual ,
URL : https://hal.archives-ouvertes.fr/hal-01091802
Verified Compilation and Worst-Case Execution Time Estimation, Université Rennes, vol.1, issue.5, p.44, 2014. ,
Astr??e: Verification of Absence of Runtime Error, In: Building the Information Society, issue.2, pp.385-392, 2004. ,
DOI : 10.1007/978-1-4020-8157-6_30
Synthesis of Memory Fences via Refinement Propagation, Static Analysis (SAS). 2014, pp.237-252 ,
DOI : 10.1007/978-3-319-10936-7_15
Weakly relational numerical abstract domains ,
Field-sensitive value analysis of embedded C programs with union types and pointer arithmetics, Proc. of LCTES'06, pp.54-63, 2006. ,
Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs, Programming Languages and Systems, pp.398-418, 2011. ,
DOI : 10.1007/978-3-540-30538-5_4
Static analysis by abstract interpretation of concurrent programs, 2013. ,
RockSalt: better, faster, stronger SFI for the x86, Conf. on Programming Language Design and Implementation (PLDI). 2012, pp.395-404 ,
Verified just-in-time compiler on x86, Symp. on Principles of Programm. Lang. (POPL, pp.107-118, 2010. ,
Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code, In: APLAS. LNCS, vol.7705, issue.106, pp.115-130, 2012. ,
DOI : 10.1007/978-3-642-35182-2_9
CCured: type-safe retrofitting of legacy software, In: ACM Trans. Program. Lang. Syst, vol.273, issue.1, pp.477-526, 2005. ,
Translation validation for an optimizing compiler, In: SIGPLAN Not, vol.355, pp.83-94, 2000. ,
Abstract Interpretation of Annotated Commands, LNCS, vol.7406, issue.46, pp.116-132, 2012. ,
DOI : 10.1007/978-3-642-32347-8_9
Inferring complete initialization of arrays, Theoretical Computer Science, vol.484, pp.16-40, 2013. ,
DOI : 10.1016/j.tcs.2013.01.007
Interpr?tation abstraite en logique intuitionniste : extraction d'analyseurs Java certifi?s, Universit? Rennes, vol.1, 2005. ,
Translation validation, TACAS '98, pp.151-166, 1998. ,
DOI : 10.1007/BFb0054170
Intermediate-representation recovery from low-level code, Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation , PEPM '06, pp.100-111, 2006. ,
DOI : 10.1145/1111542.1111560
A Formally-Verified Alias Analysis, LNCS, vol.7679, issue.46, pp.11-26, 2012. ,
DOI : 10.1007/978-3-642-35308-6_5
URL : https://hal.archives-ouvertes.fr/hal-00773109
The trace partitioning abstract domain, ACM Transactions on Programming Languages and Systems, vol.29, issue.5, 2007. ,
DOI : 10.1145/1275497.1275501
Taming the Wrapping of Integer Arithmetic, Proc. of SAS 2007, pp.121-136, 2007. ,
DOI : 10.1007/978-3-540-74061-2_8
First-Class Type Classes, pp.278-293978, 2008. ,
DOI : 10.1007/11542384_8
URL : https://hal.archives-ouvertes.fr/inria-00628864
Type classes for mathematics in type theory, Mathematical Structures in Computer Science, vol.2, issue.04, pp.795-825, 2011. ,
DOI : 10.1007/3-540-48256-3_10
The Art of Computer Virus Research and Defense, p.321304543, 2005. ,
Verifying Fence Elimination Optimisations, Proc. of SAS'11, pp.146-162, 2011. ,
DOI : 10.1145/42190.42277
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.9669
Array bounds check elimination for the Java HotSpot? client compiler, p.125, 2007. ,