The B-Book, assigning programs to meaning, 1996. ,
Rodin: an open toolset for modelling and reasoning in Event-B, International Journal on Software Tools for Technology Transfer, vol.15, issue.1, pp.447-466, 2010. ,
DOI : 10.1007/978-3-642-18216-7
Deductive Software Verification -The KeY Book -From Theory to Practice, volume 10001 of Lecture Notes in Computer Science, 2016. ,
Amortised Resource Analysis with Separation Logic, Logical Methods in Computer Science, vol.7, issue.2, 2011. ,
Refinement calculus -a systematic introduction. Undergraduate texts in computer science, 1999. ,
On the correctness of refinement in program development, 1978. ,
Boogie: A Modular Reusable Verifier for Object-Oriented Programs, Formal Methods for Components and Objects : 4th International Symposium, pp.364-387, 2005. ,
DOI : 10.1007/11804192_17
The Spec# Programming System: An Overview, Construction and Analysis of Safe, Secure, and Interoperable Smart Devices, pp.49-69, 2004. ,
DOI : 10.1007/978-3-540-30569-9_3
Interactive Theorem Proving and Program Development. Texts in Theoretical Computer Science, 2004. ,
DOI : 10.1007/978-3-662-07964-5
URL : https://hal.archives-ouvertes.fr/hal-00344237
Nearly all binary searches and mergesorts are broken, BIBLIOGRAPHIE, 2006. ,
The Alt-Ergo automated theorem prover, 2008. ,
Why3 : Shepherd your herd of provers, Boogie, pp.53-64, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00790310
Let???s verify this with Why3, International Journal on Software Tools for Technology Transfer, vol.7, issue.5, pp.709-727, 2015. ,
DOI : 10.1007/978-3-642-02959-2_10
Local Action and Abstract Separation Logic, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.366-378, 2007. ,
DOI : 10.1109/LICS.2007.30
URL : http://www.dcs.qmul.ac.uk/%7Ehyang/paper/asl.pdf
Characteristic formulae for the verification of imperative programs, Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming (ICFP), pp.418-430, 2011. ,
Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits, Journal of Automated Reasoning, vol.18, issue.9, 2017. ,
DOI : 10.1145/361002.361016
A formally proved, complete algorithm for path resolution with symbolic links, Journal of Formalized Reasoning, vol.10, issue.1, pp.51-66, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01652148
Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Transactions on Programming Languages and Systems, vol.8, issue.2, pp.244-263, 1986. ,
DOI : 10.1145/5397.5399
Algebraic methods in semantics. chapter A Scheme for a Higher-level Semantic Algebra, pp.237-250, 1986. ,
Automatically Verified Implementation of Data Structures Based on AVL Trees, Giannakopoulou and Kroening [48], pp.167-180 ,
DOI : 10.1007/978-3-319-12154-3_11
URL : https://hal.archives-ouvertes.fr/hal-01067217
Preuves taillées en biseau, Vingt-huitièmes Journées Francophones des Langages Applicatifs, 2017. ,
Formalizing Semantics with an Automatic Program Verifier, Giannakopoulou and Kroening [48], pp.37-51 ,
DOI : 10.1007/978-3-319-12154-3_3
URL : https://hal.archives-ouvertes.fr/hal-01067197
How to Avoid Proving the Absence of Integer Overflows, 7th Working Conference on Verified Software : Theories, Tools and Experiments (VSTTE), pp.94-109, 2015. ,
DOI : 10.1007/978-3-319-08867-9_1
URL : https://hal.archives-ouvertes.fr/hal-01162661
Double WP : vers une preuve automatique d'un compilateur, Vingt-sixièmes Journées Francophones des Langages Applicatifs, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01094488
The Matrix reproved, Journal of Automated Reasoning, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01316902
Verified programs with binders, Proceedings of the ACM SIGPLAN 2014 Workshop on Programming Languages meets Program Verification, PLPV '14 ,
DOI : 10.1145/2541568.2541571
URL : https://hal.archives-ouvertes.fr/hal-00913431
VCC: A Practical System for Verifying Concurrent C, Theorem Proving in Higher Order Logics (TPHOLs), 2009. ,
DOI : 10.1007/978-3-540-74591-4_15
OpenJML : Software verification for Java 7 using JML, Open- JDK, and Eclipse, Proceedings 1st Workshop on Formal Integrated Development Environment, pp.79-92, 2014. ,
Soundness and completeness of an axiom system for program verification, SIAM Journal on Computing, vol.7, issue.1, pp.70-90, 1978. ,
Methods and Logics for Proving Programs, pp.841-993, 1990. ,
DOI : 10.1016/B978-0-444-88074-1.50020-2
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
Frama-C, Proceedings of the 10th International Conference on Software Engineering and Formal Methods, number 7504 in Lecture Notes in Computer Science, pp.233-247, 2012. ,
DOI : 10.1007/978-3-642-33826-7_16
Lambda calculus with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem, Proc. of the Koninklijke Nederlands Akademie, pp.380-392, 1972. ,
Z3, an efficient SMT solver, TACAS, pp.337-340, 2008. ,
A Refinement-Based Approach to Computational Algebra in Coq, ITP -3rd International Conference on Interactive Theorem Proving - 2012, pp.83-98, 2012. ,
DOI : 10.1007/978-3-642-32347-8_7
Notes on structured programming, Structured programming, 1971. ,
Guarded commands, nondeterminacy and formal derivation of programs, Commun. ACM, vol.18, pp.453-457, 1975. ,
Control Operators, the SECDmachine , and the ?-calculus, 3rd Working Conference on the Formal Description of Programming Concepts, pp.193-219, 1986. ,
The spirit of ghost code, 26th International Conference on Computer Aided Verification, pp.1-16, 2014. ,
Why3 ??? Where Programs Meet Provers, Proceedings of the 22nd European Symposium on Programming, pp.125-128, 2013. ,
DOI : 10.1007/978-3-642-37036-6_8
Why3 ??? Where Programs Meet Provers, ESOP [43], pp.125-128 ,
DOI : 10.1007/978-3-642-37036-6_8
Assigning meanings to programs, of Proceedings of Symposia in Applied Mathematics, pp.19-32, 1967. ,
DOI : 10.1090/psapm/019/0235771
Untersuchungen über das logische Schliessen, Mathematische Zeitschrift, issue.39, pp.176-210, 1934. ,
DOI : 10.1007/bf01201353
Geometry of synthesis : A structured approach to vlsi design, Proceedings of the 34th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '07, pp.363-375, 2007. ,
An axiomatic basis for computer programming, Communications of the ACM, vol.12, issue.10, pp.576-580, 1969. ,
DOI : 10.1145/363235.363259
URL : http://www.utdallas.edu/~kxh060100/cs6371fa07/hoare.pdf
On Full Abstraction for PCF: I, II, and III, Information and Computation, vol.163, issue.2, pp.285-408, 2000. ,
DOI : 10.1006/inco.2000.2917
Partial Solutions to VerifyThis 2016 Challenges 2 and 3 with VeriFast, Proceedings of the 18th Workshop on Formal Techniques for Java-like Programs, FTfJP'16, pp.1-7, 2016. ,
DOI : 10.1109/LICS.2002.1029817
VeriFast: A Powerful, Sound, Predictable, Fast Verifier for C and Java, NASA Formal Methods, pp.41-55, 2011. ,
DOI : 10.1007/11691372_19
Iris : Monoids and invariants as an orthogonal basis for concurrent reasoning, Proceedings of the 42Nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages , POPL '15, pp.637-650, 2015. ,
CakeML, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.179-191, 2014. ,
DOI : 10.1145/2535838.2535841
Correspondence between ALGOL 60 and Church's Lambda-notation: part I, Communications of the ACM, vol.8, issue.2, pp.89-101, 1965. ,
DOI : 10.1145/363744.363749
Dafny : An automatic program verifier for functional correctness, LPAR-16, pp.348-370, 2010. ,
Automating induction with an SMT solver, Proc. 13th Int. Conf. Verification, Model Checking, and Abstract Interpretation, 2012. ,
Verification of concurrent programs with Chalice, Foundations of Security Analysis and Design V, pp.195-222, 2007. ,
Using history invariants to verify observers, Lecture Notes in Computer Science, vol.4421, pp.80-94, 2007. ,
A Formally Verified Compiler Back-end, Journal of Automated Reasoning, vol.27, issue.1, pp.363-446, 2009. ,
DOI : 10.1007/978-3-642-59495-3
URL : https://hal.archives-ouvertes.fr/inria-00360768
A behavioral notion of subtyping, ACM Transactions on Programming Languages and Systems, vol.16, issue.6, pp.1811-1841, 1994. ,
Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism, Logical Methods in Computer Science, vol.12, issue.3, p.2016 ,
DOI : 10.2168/LMCS-12(3:6)2016
Properties of programs and partial function logic, Machine Intelligence, 1970. ,
Jessie, Proceedings of the 2007 workshop on Programming languages meets program verification , PLPV '07, pp.1-2, 2007. ,
DOI : 10.1145/1292597.1292598
The KRAKATOA tool for certificationof JAVA/JAVACARD programs annotated in JML, The Journal of Logic and Algebraic Programming, vol.58, issue.1-2, pp.89-106, 2004. ,
DOI : 10.1016/j.jlap.2003.07.006
A basis for a mathematical theory of computation, preliminary report, Papers presented at the May 9-11, 1961, western joint IRE-AIEE-ACM computer conference on, IRE-AIEE-ACM '61 (Western), pp.225-238, 1961. ,
DOI : 10.1145/1460690.1460715
Building High Integrity Applications with SPARK, 2015. ,
Viper: A Verification Infrastructure for Permission-Based Reasoning, Verification, Model Checking, and Abstract Interpretation (VMCAI), pp.41-62, 2016. ,
DOI : 10.1007/978-3-662-49122-5_2
Ynot : Reasoning with the awkward squad, Proceedings of ICFP'08, 2008. ,
Isabelle/HOL ? A Proof Assistant for Higher-Order Logic, volume 2283 of Lecture Notes in Computer Science, 2002. ,
Certification of matrix multiplication algorithms : Strassen's algorithm in ACL2, Supplemental Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics, pp.283-298, 2001. ,
The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.46-57, 1977. ,
DOI : 10.1109/SFCS.1977.32
Specification and verification of concurrent systems in CESAR, Proceedings of the 5th Colloquium on International Symposium on Programming, pp.337-351, 1982. ,
DOI : 10.1007/3-540-11494-7_22
Separation logic: a logic for shared mutable data structures, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 2002. ,
DOI : 10.1109/LICS.2002.1029817
Definitional interpreters for higher-order programming languages, Proceedings of the ACM Annual Conference, pp.717-740, 1972. ,
An efficient machine-independent procedure for garbage collection in various list structures, Communications of the ACM, vol.10, issue.8, pp.501-506, 1967. ,
DOI : 10.1145/363534.363554
System Description: E??0.81, Second International Joint Conference on Automated Reasoning, pp.223-228, 2004. ,
DOI : 10.1007/978-3-540-25984-8_15
Dependent types and multi-monadic effects in F*, 43rd ACM Symposium on Principles of Programming Languages (POPL), pp.256-270, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01265793
Matrices, Jordan normal forms, and spectral radius theory. Archive of Formal Proofs, 2015. ,
Types, bytes, and separation logic, Proc. 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (PO- PL'07), pp.97-108, 2007. ,
DOI : 10.1145/1190215.1190234
URL : http://www.nicta.com.au/people/norrishm/attachments/bibliographies_and_papers/2007/popl2007.pdf