Sandrine Blazy
Présentation
Publications
Publications
|
|
A Mechanized Semantics for Dataflow CircuitsSPLASH 2025 - ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity, Oct 2025, Singapore, Singapore. pp.1-29 |
|
|
Abstract machines and small-step semantics: a winning ticket for proof automation?PPDP 2025 - 27th International Symposium on Principles and Practice of Declarative Programming, Association for Computing Machinery, Sep 2025, Rende, Italy. ⟨10.1145/3756907.3756926⟩ |
|
|
Formal Verification of WTO-based Dataflow SolversESOP 2025 - 34th European Symposium on Programming, May 2025, Hamilton, Canada. pp.1-27 |
|
|
From Mechanized Semantics to Verified Compilation: the Clight Semantics of CompCertFASE 2024 - 27th International Conference on Fundamental Approaches to Software Engineering, Apr 2024, Luxembourg, Luxembourg. pp.1-21, ⟨10.1007/978-3-031-57259-3_1⟩ |
|
|
Mechanised Semantics for Gated Static Single AssignmentCPP 2023 - 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2023, Boston, United States. pp.1-15, ⟨10.1145/3573105.3575681⟩ |
|
|
Secure Compilation of Constant-Resource ProgramsCSF 2021 - 34th IEEE Computer Security Foundations Symposium, Jun 2021, Dubrovnik, Croatia. pp.1-12 |
|
|
A Fast Verified Liveness Analysis in SSA FormIJCAR 2020- International Joint Conference on Automated Reasoning, Jun 2020, Paris, France. pp.324-340, ⟨10.1007/978-3-030-51054-1_19⟩ |
|
|
Compiling Sandboxes: Formally Verified Software Fault IsolationESOP 2019 - 28th European Symposium on Programming, Apr 2019, Prague, Czech Republic. pp.499-524, ⟨10.1007/978-3-030-17184-1_18⟩ |
|
|
Formal Verification of a Program Obfuscation Based on Mixed Boolean-Arithmetic ExpressionsCPP 2019 - 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2019, Cascais, Portugal. pp.196-208, ⟨10.1145/3293880.3294103⟩ |
Teaching Deductive Verification in Why3 to Undergraduate StudentsFM Tea (Formal Methods Teaching), Oct 2019, Porto, Portugal. pp.52-66, ⟨10.1007/978-3-030-32441-4_4⟩ |
|
|
|
CompCert: Practical Experience on Integrating and Qualifying a Formally Verified Optimizing CompilerERTS2 2018 - 9th European Congress Embedded Real-Time Software and Systems, 3AF, SEE, SIE, Jan 2018, Toulouse, France. pp.1-9 |
|
|
CompCertS: A Memory-Aware Verified C Compiler using Pointer as Integer SemanticsITP 2017 - 8th International Conference on Interactive Theorem Proving, Sep 2017, Brasilia, Brazil. pp.81-97, ⟨10.1007/978-3-319-66107-0_6⟩ |
|
|
Confusion de Type en C++: État de l'Art et Difficultés de DétectionRESSI 2017 - Rendez-vous de la Recherche et de l'Enseignement de la Sécurité des Systèmes d'Information , May 2017, Grenoble/Autrans, France. pp.1-5 |
|
|
Verified Translation Validation of Static AnalysesComputer Security Foundations Symposium, Aug 2017, Santa-Barbara, United States |
|
|
Closing the Gap – The Formally Verified Optimizing Compiler CompCertSSS'17: Safety-critical Systems Symposium 2017, Feb 2017, Bristol, United Kingdom. pp.163-180 |
|
|
Verifying Constant-Time Implementations by Abstract InterpretationEuropean Symposium on Research in Computer Security, Sep 2017, Oslo, Norway |
|
|
An Abstract Memory Functor for Verified C Static AnalyzersACM SIGPLAN International Conference on Functional Programming (ICFP 2016), Sep 2016, Nara, Japan. pp.14, ⟨10.1145/2951913.2951937⟩ |
|
|
Formal Verification of Control-flow Graph FlatteningCertified Proofs and Programs (CPP 2016), Jan 2016, Saint-Petersburg, United States. pp.12, ⟨10.1145/2854065.2854082⟩ |
|
|
CompCert - A Formally Verified Optimizing CompilerERTS 2016: Embedded Real Time Software and Systems, 8th European Congress, SEE, Jan 2016, Toulouse, France |
|
|
A formally-verified C static analyzerPOPL 2015: 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Jan 2015, Mumbai, India. pp.247-259, ⟨10.1145/2676726.2676966⟩ |
|
|
A Concrete Memory Model for CompCertITP 2015 : 6th International Conference on Interactive Theorem Proving, Aug 2015, Nanjing, China. pp.67-83, ⟨10.1007/978-3-319-22102-1_5⟩ |
|
|
Validating Dominator Trees for a Fast, Verified Dominance TestInteractive Theorem Proving, Aug 2015, Nanjing, China. ⟨10.1007/978-3-319-22102-1_6⟩ |
Formal verification of compilers and static analyzers.PLMW@POPL 2015 - Programming Languages Mentoring Workshop, Jan 2015, Mumbai, India |
|
Verified Validation of Program SlicingCPP 2015 : Conference on Certified Programs and Proofs, 2015, Mumbai, India. pp.109-117, ⟨10.1145/2676724.2693169⟩ |
|
|
|
Data Tainting and Obfuscation: Improving Plausibility of Incorrect TaintSource Code Analysis and Manipulation (SCAM), Sep 2015, Bremen, Germany |
|
|
Measuring the Robustness of Source Program Obfuscation - Studying the Impact of Compiler Optimizations on the Obfuscation of C ProgramsFourth ACM Conference on Data and Application Security and Privacy - SIGSAC ACM CODASPY 2014, Mar 2014, San Antonio, United States |
|
|
A Precise and Abstract Memory Model for C Using Symbolic Values12th Asian Symposium on Programming Languages and Systems (APLAS 2014), 2014, Singapore, Singapore. pp.449 - 468, ⟨10.1007/978-3-319-12736-1_24⟩ |
A Formally Verified WCET Estimation Tool14th International Workshop on Worst-Case Execution Time Analysis, Jul 2014, Madrid, Spain. ⟨10.4230/OASIcs.WCET.2014.11⟩ |
|
|
|
Improving static analyses of C programs with conditional predicatesFMICS 2014: Formal Methods for Industrial Critical Systems, Sep 2014, Florence, Italy. pp.15, ⟨10.1007/978-3-319-10702-8_10⟩ |
|
|
Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying CodeThe 5th International Conference on Interactive Theorem Proving (ITP 2014), 2014, Vienna, Austria. pp.128 - 143, ⟨10.1007/978-3-319-08970-6_9⟩ |
|
|
Formal Verification of Loop Bound Estimation for WCET AnalysisVSTTE - Verified Software: Theories, Tools and Experiments, Natarajan Shankar, May 2013, Menlo Park, United States. pp.281-303 |
|
|
Proofs You Can Believe In. Proving Equivalences Between Prolog Semantics in Coq15th International Symposium on Principles and Practice of Declarative Programming (PPDP), Sep 2013, Madrid, Spain. pp.37-48 |
|
|
Formal Verification of a C Value Analysis Based on Abstract InterpretationSAS - 20th Static Analysis Symposium, Jun 2013, Seattle, United States. pp.324-344 |
|
|
Towards a formally verified obfuscating compilerSSP 2012 - 2nd ACM SIGPLAN Software Security and Protection Workshop, ACM SIGPLAN, Jun 2012, Beijing, China |
|
|
Formally verified optimizing compilation in ACG-based flight control softwareERTS2 2012: Embedded Real Time Software and Systems, AAAF, SEE, Feb 2012, Toulouse, France |
|
|
Formal Verification of Coalescing Graph-Coloring Register Allocation19th European Symposium on Programming (ESOP), Mar 2010, Paphos, Cyprus. pp.145-164, ⟨10.1007/978-3-642-11957-6_9⟩ |
Live-Range Unsplitting for Faster Optimal CoalescingLCTES'09 ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems, Jan 2009, X, France. pp.70-79 |
|
|
|
Register allocation by graph coloring under full live-range splittingACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded systems (LCTES'2009), ACM, Jun 2009, Dublin, Ireland |
Which C semantics to embed in the front-end of a formally verified compiler?TTVSI (Tools and Techniques for Verification of System Infrastructure), Mar 2008, Oxford, United Kingdom. pp.31 |
|
|
|
Coloration avec préférences : complexité, inégalités valides et vérification formelleROADEF'08, 9e congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, ROADEF, Feb 2008, Clermont-Ferrand, France. pp.123-138 |
|
|
Vérification formelle d'un algorithme d'allocation de registres par coloration de grapheJFLA (Journées Francophones des Langages Applicatifs), INRIA, Jan 2008, Etretat, France. pp.31-46 |
Coloration avec préférences dans les graphes triangulésJournées Graphes et algorithmes (JGA'07), Nov 2007, Paris, France. pp.32 |
|
|
|
Experiments in validating formal semantics for CC/C++ Verification Workshop, 2007, Oxford, United Kingdom. pp.95-102 |
|
|
Separation Logic for Small-step Cminor20th Int. Conference on Theorem Proving in Higher Order Logics (TPHOLs 2007), Sep 2007, Kaiserslautern, Germany. pp.5-21 |
Coloration avec préférences dans les graphes triangulésJournées Graphes et Algorithmes, Paris, Jan 2007, X, France. pp.32 |
|
|
|
Formal Verification of a C Compiler Front-endFM'06: 14th Symposium on Formal Methods, Aug 2006, Hamilton, Canada. pp.460-475, ⟨10.1007/11813040_31⟩ |
|
|
Formal verification of a memory model for C-like imperative languagesICFEM'05: 7th International Conference on Formal Engineering Methods, Nov 2005, Manchester, United Kingdom. pp.280-299, ⟨10.1007/11576280⟩ |
Une démarche outillée pour spécifier formellement des patrons de conception réutilisablesObjets, Composants et Modèles dans l'ingénierie des SI, Jan 2003, X, France |
|
|
|
Reuse of Specification Patterns with the B MethodZB 2003: Formal Specification and Development in Z and B, Jun 2003, Turku, Finland, pp.40-57 |
An automatic detection of prokaryotic CoDing Sequences Combining Several Independent MethodsGenome 2000, Paris, Jan 2000, X, France |
|
|
|
Partial Evaluation for Program ComprehensionACM Computing Surveys, Symposium on partial evaluation, 1998, (revue électonique) |
|
|
Application of formal methods to the development of a software maintenance toolASE'97: The 12th IEEE Conference on Automated Software Engineering., Lowry, M. and Ledru, Y., Nov 1997, Lake Tahoe, Nevada, USA, pp.162-171 |
Interprocedural analysis for program comprehension by specialization4th IEEE Workshop on Program Comprehension, Berlin, Jan 1996, X, France. pp.133-141 |
|
|
|
An automatic interprocedural analysis for the understanding of scientific application programsDagstuhl seminar on partial evaluation, Feb 1996, Saarbrucken, Germany. pp.1-16, ⟨10.1007/3-540-61580-6⟩ |
|
|
Formal specification and prototyping of a program specializerTAPSOFT '95: Theory and Practice of Software Development, 6th International Joint Conference CAAP/FASE, May 1995, Aarhus, Denmark. pp.666-680, ⟨10.1007/3-540-59293-8_227⟩ |
Formal specification and prorotyping of a program specializerTAPSOFT'95, Aarhus, Jan 1995, X, France. pp.666-680 |
|
|
|
SFAC, a tool for program comprehension by specializationIEEE Third Workshop on Program Comprehension, Nov 1994, Washington D.C., United States. pp.162-167, ⟨10.1109/WPC.1994.341266⟩ |
Partial evaluation as an aid to the comprehension of Fortran programs2nd IEEE Workshop on Program Comprehension, Capri, Italy, Jan 1993, X, France. pp.46-54 |
|
|
|
Partial evaluation and symbolic computation for the understanding of Fortran programsAdvanced Information Systems Engineering 5th International Conference, CAiSE '93, 1993, Paris, France. pp.184-198, ⟨10.1007/3-540-56777-1⟩ |
|
|
Software maintenance: an analysis of industrial needs and constraintsIEEE Conference on Software Maintenance, IEEE, Nov 1992, Orlando, USA, France. pp.18-26, ⟨10.1109/ICSM.1992.242563⟩ |
Evaluation partielle pour la compréhension de programmes FortranSoftware Engineering and its applications, Toulouse, December, Dec 1992, X, France. pp.411-417 |
|
|
33èmes journées francophones des langages applicatifsChantal Keller; Timothy Bourke. , pp.1-292, 2022 |
|
|
Interactive Theorem Proving - 4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013. ProceedingsBlazy, Sandrine and Paulin-Mohring, Christine and Pichardie, David. Springer, 7998, pp.500, 2013, Lecture Notes in Computer Science, ⟨10.1007/978-3-642-39634-2⟩ |
Actes de la conférence JFLA2008INRIA. 2008 |
|
|
|
Actes de la conférence JFLA2008 (Journées Francophones des Langages Applicatifs)INRIA. INRIA, pp.173, 2008, 2-7261-1295-1 |
The CompCert memory modelAppel, Andrew W. Program Logics for Certified Compilers, Cambridge University Press, pp.237-271, 2014, 9781107048010 |
|
|
Sémantiques formellesInformatique [cs]. Université d'Evry-Val d'Essonne, 2008 |