@comment{{This file has been generated by bib2bib 1.98}}

@comment{{Command line: bib2bib -c '$key="ergo" or $key="dailler18jlamp" or $key="ieee754-2008" or $key="barrett11cade" or $key="okasaki98" or $key="CoqArt" or $key="paskevich09rr" or $key="vstte10comp" or $key="hauzar16sefm" or $key="conchon08smt" or $key="filliatre07cav" or 1=2' /home/cmarche/biblio/abbrevs.bib /home/cmarche/biblio/demons.bib /home/cmarche/biblio/demons2.bib /home/cmarche/biblio/demons3.bib /home/cmarche/biblio/team.bib /home/cmarche/biblio/crossrefs.bib}}

@string{sv = {Springer}}

@string{lncs = {Lecture Notes in Computer Science}}

@string{eptcs = "Electronic Proceedings in Theoretical Computer Science"}

@techreport{baudin17,
  topics = {team},
  TITLE = {Deductive Verification with the Help of Abstract Interpretation},
  AUTHOR = {Lucas Baudin},
  url = {https://hal.inria.fr/hal-01634318},
  TYPE = {Technical Report},
  INSTITUTION = {Univ Paris-Sud},
  YEAR = 2017,
  MONTH = nov
}

@book{CoqArt,
  author = {Yves Bertot and Pierre Castéran},
  title = {Interactive Theorem Proving and Program Development},
  subtitle = {Coq'Art: The Calculus of Inductive Constructions},
  publisher = {Springer-Verlag},
  series = {Texts in Theoretical Computer Science},
  year = 2004,
  doi = {10.1007/978-3-662-07964-5}
}

@misc{ieee754-2008,
  key = {IEEE754},
  abstract = {This standard specifies interchange and arithmetic
                  formats and methods for binary and decimal
                  floating-point arithmetic in computer programming
                  environments. This standard specifies exception
                  conditions and their default handling. An
                  implementation of a floating-point system conforming
                  to this standard may be realized entirely in
                  software, entirely in hardware, or in any
                  combination of software and hardware. For operations
                  specified in the normative part of this standard,
                  numerical results and exceptions are uniquely
                  determined by the values of the input data, sequence
                  of operations, and destination formats, all under
                  user control.},
  booktitle = {{IEEE} Std 754-2008},
  doi = {10.1109/IEEESTD.2008.4610935},
  journal = {IEEE Std 754-2008},
  pages = {1--58},
  title = {{IEEE} Standard for Floating-Point Arithmetic},
  year = {2008},
}

@misc{vstte10comp,
  author = {Natarajan Shankar and Peter Mueller},
  title = {{Verified Software: Theories, Tools and Experiments
                  (VSTTE'10). Software Verification Competition}},
  month = {August},
  year = 2010,
  address = {Edinburgh, Scotland},
  url = {http://www.macs.hw.ac.uk/vstte10/Competition.html}
}

@book{okasaki98,
  author = {Chris Okasaki},
  title = {Purely Functional Data Structures},
  publisher = {Cambridge University Press},
  year = 1998
}

@inproceedings{barrett11cade,
  author = {Barrett, Clark and Conway, Christopher L. and Deters, Morgan and Hadarean, Liana and Jovanović, Dejan and King, Tim and Reynolds, Andrew and Tinelli, Cesare},
  title = {{CVC4}},
  booktitle = {23rd International Conference on Computer Aided Verification},
  year = 2011,
  isbn = {978-3-642-22109-5},
  address = {Snowbird, UT},
  pages = {171--177},
  numpages = 7,
  url = {http://dl.acm.org/citation.cfm?id=2032305.2032319},
  acmid = 2032319,
  publisher = {Springer-Verlag},
}

@inproceedings{conchon08smt,
  author = {François Bobot and Sylvain Conchon and Évelyne Contejean
  and Stéphane Lescuyer},
  title = {{Implementing Polymorphism in SMT solvers}},
  booktitle = {SMT 2008: 6th International Workshop on Satisfiability Modulo},
  pages = {1--5},
  year = 2008,
  editor = {Clark Barrett and Leonardo de Moura},
  volume = 367,
  series = {ACM International Conference Proceedings Series},
  topics = {team,lri},
  type_digiteo = {conf_autre},
  type_publi = {colloque},
  x-equipes = {demons PROVAL},
  x-type = {article},
  x-support = {actes_aux},
  x-cle-support = {SMT},
  x-pdf = {http://www.lri.fr/~conchon/publis/conchon-smt08.pdf},
  url = {http://www.lri.fr/~conchon/publis/conchon-smt08.pdf},
  x-editorial-board = {yes},
  x-international-audience = {yes},
  x-proceedings = {yes},
  isbn = {978-1-60558-440-9},
  doi = {10.1145/1512464.1512466},
  abstract = {http://www.lri.fr/~contejea/publis/2008smt/abstract.html}
}

@misc{ergo,
  author = {Sylvain Conchon and Évelyne Contejean},
  title = {The {Alt-Ergo} automatic Theorem Prover},
  url = {http://alt-ergo.lri.fr/},
  topics = {team,lri},
  year = 2008,
  x-equipes = {demons PROVAL},
  x-type = {manuel},
  x-support = {diffusion}
}

@inproceedings{filliatre07cav,
  author = {Jean-Christophe Filliâtre and Claude Marché},
  title = {The {Why/Krakatoa/Caduceus} Platform for Deductive Program
  Verification},
  booktitle = {19th International Conference on Computer Aided Verification},
  editor = {Werner Damm and Holger Hermanns},
  series = lncs,
  volume = 4590,
  address = {Berlin, Germany},
  month = jul,
  year = {2007},
  pages = {173--177},
  topics = {team, lri},
  url = {https://hal.inria.fr/inria-00270820v1},
  type_digiteo = {conf_isbn},
  type_publi = {icolcomlec},
  x-pdf = {http://www.lri.fr/~filliatr/ftp/publis/cav07.pdf},
  x-equipes = {demons PROVAL EXT},
  x-type = {articlecourt},
  x-support = {actes},
  x-cle-support = {CAV},
  doi = {10.1007/978-3-540-73368-3_21}
}

@techreport{paskevich09rr,
  author = {Andrei Paskevich},
  title = {Algebraic types and pattern matching in the logical language of the {Why} verification platform},
  institution = {INRIA},
  year = 2009,
  topics = {team},
  url = {http://hal.inria.fr/inria-00439232},
  number = 7128
}

@inproceedings{hauzar16sefm,
  topics = {team},
  author = {Hauzar, David and Marché, Claude and Moy, Yannick},
  title = {Counterexamples from Proof Failures in {SPARK}},
  booktitle = {Software Engineering and Formal Methods},
  year = 2016,
  pages = {215--233},
  doi = {10.1007/978-3-319-41591-8_15},
  editor = {De Nicola, Rocco and Eva Kühn},
  series = lncs,
  address = {Vienna, Austria},
  url = {https://hal.inria.fr/hal-01314885}
}

@article{dailler18jlamp,
  topics = {team},
  title = {Instrumenting a Weakest Precondition Calculus for Counterexample Generation},
  author = {Dailler, Sylvain and Hauzar, David and Marché, Claude and Moy, Yannick},
  url = {https://hal.inria.fr/hal-01802488},
  journal = {Journal of Logical and Algebraic Methods in Programming},
  publisher = {Elsevier},
  volume = 99,
  pages = {97--113},
  year = 2018,
  keywords = {Deductive Program Verification ; Weakest Precondition Calculus ; Satisfiability Modulo Theories ; Counterexamples}
}


@Manual{baudin18acsl,
  title = 	 {{ACSL}: {ANSI/ISO C} Specification Language},
  author = 	 {Patrick Baudin  and Jean-Christophe Filliâtre and Claude Marché and Benjamin Monate and Yannick Moy and Virgile Prevosto},
  year = 	 2018,
  note = 	 {\url{https://frama-c.com/acsl.html}},
  url = 	 {https://frama-c.com/acsl.html},
  x-pdf = 	 {https://frama-c.com/download/acsl_1.14.pdf}
}

@inproceedings{filliatre07mix,
  author = {Jean-Christophe Filli\^atre},
  title = {{Formal Verification of MIX Programs}},
  booktitle = {{Journ{\'e}es en l'honneur de Donald E. Knuth}},
  year = 2007,
  note = {\url{http://knuth07.labri.fr/exposes.php}},
  address = {Bordeaux, France},
  month = {October},
  url = {http://www.lri.fr/~filliatr/publis/verifmix.pdf}
}



@phdthesis{nguyen12phd,
  author = {Nguyen, Thi Minh Tuyen},
  title = {Taking architecture and compiler into account
in formal proofs of numerical programs},
  school = {Universit{\'e} Paris-Sud},
  type = {Th{\`e}se de Doctorat},
  url = {http://tel.archives-ouvertes.fr/tel-00710193},
  year = 2012,
  month = jun
}

@inproceedings{paskevich20isola,
  author = {Jean-Christophe Filli\^atre and Andrei Paskevich},
  title = {Abstraction and Genericity in Why3},
  booktitle = {9th International Symposium On Leveraging Applications of Formal
                  Methods, Verification and Validation (ISoLA)},
  month = oct,
  year = 2020,
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = 12476,
  pages = {122--142},
  editor = {Tiziana Margaria and Bernhard Steffen},
  address = {Rhodes, Greece},
  topics = {team},
  note = "See also \url{http://why3.lri.fr/isola-2020/}",
  url = {https://hal.inria.fr/hal-02696246}
}

@inproceedings{becker21fide,
  topics={team},
  TITLE = {Explaining Counterexamples with Giant-Step Assertion Checking},
  AUTHOR = {Becker, Benedikt and Belo Louren\c{c}o, Cl{\'a}udio and March{\'e}, Claude},
  URL = {https://hal.inria.fr/hal-03217393},
  BOOKTITLE = {6th Workshop on Formal Integrated Development Environments (F-IDE 2021)},
  EDITOR = {Creissac Campos, Jos{\'e} and Paskevich, Andrei},
  series = eptcs,
  doi = {10.4204/EPTCS.338.10},
  YEAR = 2021,
  MONTH = may
}

@TechReport{gondelman16reg,
  topics = {team},
  author =       {Jean-Christophe Filli\^atre and L\'eon
            Gondelman and Andrei Paskevich},
  title =        {A Pragmatic Type System for Deductive Verification},
  type = {Research report},
  institution =  {Universit\'e Paris Sud},
  year =         2016,
  abstract = { In the context of deductive verication, it is customary
                  today to handle programs with pointers using either
                  separation logic, dynamic frames, or explicit memory
                  models. Yet we can observe that in numerous
                  programs, a large amount of code ts within the scope
                  of Hoare logic, provided we can statically control
                  aliasing. When this is the case, the code
                  correctness can be reduced to simpler verication
                  conditions which do not require any explicit memory
                  model. This makes verication conditions more
                  amenable both to automated theorem proving and to
                  manual inspection and debugging. In this paper, we
                  devise a method of such static aliasing control for
                  a programming language featuring nested data
                  structures with mutable components. Our solution is
                  based on a type system with singleton regions and
                  eects, which we prove to be sound.},
  url = {https://hal.archives-ouvertes.fr/hal-01256434v3}
}


@INPROCEEDINGS{flanagan01popl,
    author = {Cormac Flanagan and James B. Saxe},
    title = {Avoiding Exponential Explosion: Generating Compact Verification Conditions},
    booktitle = {Principles Of Programming Languages},
    year = 2001,
    pages = {193--205},
    publisher = {ACM}
}
