Team, Visitors, External Collaborators
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


Bibliography

Major publications by the team in recent years
[1]
T. Bouton, D. C. B. de Oliveira, D. Déharbe, P. Fontaine.
veriT: an open, trustable and efficient SMT-solver, in: Proc. Conference on Automated Deduction (CADE), Montreal, Canada, R. Schmidt (editor), Lecture Notes in Computer Science, Springer, 2009, vol. 5663, pp. 151-156.
[2]
D. Cansell, D. Méry.
The Event-B Modelling Method: Concepts and Case Studies, in: Logics of Specification Languages, Berlin-Heidelberg, D. Bjørner, M. C. Henson (editors), Monographs in Theoretical Computer Science, Springer, 2008, pp. 47-152.
[3]
D. Cousineau, D. Doligez, L. Lamport, S. Merz, D. Ricketts, H. Vanzetto.
TLA+ Proofs, in: 18th International Symposium On Formal Methods - FM 2012, Paris, France, D. Giannakopoulou, D. Méry (editors), Lecture Notes in Computer Science, Springer, 2012, vol. 7436, pp. 147-154.
[4]
A. Dolzmann, T. Sturm.
Redlog: Computer algebra meets computer logic, in: ACM SIGSAM Bull., 1997, vol. 31, no 2, pp. 2-9.
[5]
D. Déharbe, P. Fontaine, S. Merz, B. Woltzenlogel Paleo.
Exploiting Symmetry in SMT Problems, in: 23rd Intl. Conf. Automated Deduction (CADE 2011), Wroclaw, Poland, N. Bjørner, V. Sofronie-Stokkermans (editors), LNCS, Springer, 2011, vol. 6803, pp. 222-236.
[6]
A. Fietzke, C. Weidenbach.
Superposition as a Decision Procedure for Timed Automata, in: Mathematics in Computer Science, 2012, vol. 6, no 4, pp. 409-425.
[7]
E. Kruglov, C. Weidenbach.
Superposition Decides the First-Order Logic Fragment Over Ground Theories, in: Mathematics in Computer Science, 2012, vol. 6, no 4, pp. 427-456.
[8]
F. Kröger, S. Merz.
Temporal Logic and State Systems, Texts in Theoretical Computer Science, Springer, 2008, 436 p.
http://hal.inria.fr/inria-00274806/en/
[9]
S. Merz.
The Specification Language TLA+, in: Logics of Specification Languages, Berlin-Heidelberg, D. Bjørner, M. C. Henson (editors), Monographs in Theoretical Computer Science, Springer, 2008, pp. 401-451.
[10]
C. Weidenbach, D. Dimova, A. Fietzke, M. Suda, P. Wischnewski.
SPASS Version 3.5, in: 22nd International Conference on Automated Deduction (CADE-22), Montreal, Canada, R. Schmidt (editor), LNAI, Springer, 2009, vol. 5663, pp. 140-145.
Publications of the year

Doctoral Dissertations and Habilitation Theses

[11]
P. Fontaine.
Satisfiability Modulo Theories: state-of-the-art, contributions, project, Université de lorraine, October 2018, Habilitation à diriger des recherches.
https://tel.archives-ouvertes.fr/tel-01968404

Articles in International Peer-Reviewed Journals

[12]
N. Azmy, S. Merz, C. Weidenbach.
A Machine-Checked Correctness Proof for Pastry, in: Science of Computer Programming, June 2018, vol. 158, pp. 64-80. [ DOI : 10.1016/j.scico.2017.08.003 ]
https://hal.inria.fr/hal-01768758
[13]
J. C. Blanchette, M. Fleury, P. Lammich, C. Weidenbach.
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality, in: Journal of Automated Reasoning, 2018, vol. 61, no 1-4, pp. 333–365. [ DOI : 10.1007/s10817-018-9455-7 ]
https://hal.inria.fr/hal-01904579
[14]
I. Dramnesc, T. Jebelean, S. Stratulat.
Mechanical Synthesis of Sorting Algorithms for Binary Trees by Logic and Combinatorial Techniques, in: Journal of Symbolic Computation, 2019, vol. 90, no 3–41.
https://hal.archives-ouvertes.fr/hal-01590654
[15]
S. Merz, H. Vanzetto.
Encoding TLA+ into unsorted and many-sorted first-order logic, in: Science of Computer Programming, June 2018, vol. 158, pp. 3-20. [ DOI : 10.1016/j.scico.2017.09.004 ]
https://hal.inria.fr/hal-01768750
[16]
M. Romero, M. Duflot-Kremer, T. Viéville.
Le jeu du robot : analyse d’une activité d’informatique débranchée sous la perspective de la cognition incarnée, in: Review of science, mathematics and ICT education, 2018.
https://hal.inria.fr/hal-01950335

Invited Conferences

[17]
T. Sturm.
Thirty Years of Virtual Substitution, in: ISSAC 2018 - 43rd International Symposium on Symbolic and Algebraic Computation, New York, United States, July 2018, vol. 18. [ DOI : 10.1145/3208976.3209030 ]
https://hal.inria.fr/hal-01889817

International Conferences with Proceedings

[18]
Y. Ait Ameur, I. Ait-Sadoune, P. Castéran, J. P. Gibson, K. Hacid, S. Kherroubi, D. Méry, L. Mohand Oussaid, N. K. Singh, L. Voisin.
On the Importance of Explicit Domain Modelling in Refinement-Based Modelling Design. Experiments with Event-B, in: ABZ 2018 - 6th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z, Southampton, United Kingdom, M. Butler, A. Raschke, T. S. Hoang, K. Reichl (editors), Lecture Notes in Computer Science, Springer, June 2018, vol. 10817, pp. 425–430. [ DOI : 10.1007/978-3-319-91271-4_35 ]
https://hal.archives-ouvertes.fr/hal-01797538
[19]
A. Bentkamp, S. Cruanes, J. C. Blanchette, U. Waldmann.
Superposition for Lambda-Free Higher-Order Logic, in: IJCAR 2018 - 9th International Joint Conference on Automated Reasoning, Oxford, United Kingdom, July 2018.
https://hal.inria.fr/hal-01904595
[20]
J. C. Blanchette.
Formalizing the Metatheory of Logical Calculi and Automatic Provers in Isabelle/HOL (Invited Talk), in: CPP 2019 - The 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, Cascais, Portugal, CPP 2019 - The 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, January 2019. [ DOI : 10.1145/3293880.3294087 ]
https://hal.archives-ouvertes.fr/hal-01937136
[21]
J. C. Blanchette, N. Peltier, S. Robillard.
Superposition with Datatypes and Codatatypes, in: IJCAR 2018 - 9th International Joint Conference on Automated Reasoning, Oxford, United Kingdom, July 2018.
https://hal.inria.fr/hal-01904588
[22]
M. Bromberger.
A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems, in: IJCAR 2018 - 9th International Joint Conference on Automated Reasoning, Oxford, United Kingdom, D. Galmiche, S. Schulz, R. Sebastiani (editors), Lecture Notes in Computer Science, Springer, July 2018, vol. 10900, pp. 329-345.
https://hal.inria.fr/hal-01942228
[23]
M. Fleury, J. C. Blanchette, P. Lammich.
A verified SAT solver with watched literals using imperative HOL, in: CPP 2018 - The 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, Los Angeles, United States, ACM Press, January 2018. [ DOI : 10.1145/3167080 ]
https://hal.inria.fr/hal-01904647
[24]
P. Fontaine, M. Ogawa, T. Sturm, V. Khanh To, X. Tung Vu.
Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT, in: SC-square 2018 - Third International Workshop on Satisfiability Checking and Symbolic Computation, Oxford, United Kingdom, July 2018.
https://hal.inria.fr/hal-01946733
[25]
H. Hong, T. Sturm.
Positive Solutions of Systems of Signed Parametric Polynomial Inequalities, in: CASC 2018 - International Workshop on Computer Algebra in Scientific Computing, Lille, France, LNCS, September 2018, vol. 11077, pp. 238 - 253. [ DOI : 10.1007/978-3-319-99639-4_17 ]
https://hal.inria.fr/hal-01889827
[26]
I. Konnov, J. Widder.
ByMC: Byzantine Model Checker, in: ISoLA 2018 - 8th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation, Limassol, Cyprus, Lecture Notes in Computer Science, October 2018, vol. 11246, pp. 327-342. [ DOI : 10.1007/978-3-030-03424-5_22 ]
https://hal.inria.fr/hal-01909653
[27]
J. Kukovec, I. Konnov, J. Widder.
Reachability in Parameterized Systems: All Flavors of Threshold Automata, in: CONCUR 2018 - 29th International Conference on Concurrency Theory, Beijing, China, September 2018. [ DOI : 10.4230/LIPIcs.CONCUR.2018.19 ]
https://hal.inria.fr/hal-01871142
[28]
J. Kukovec, T.-H. Tran, I. Konnov.
Extracting Symbolic Transitions from TLA+ Specifications, in: Abstract State Machines, Alloy, B, TLA, VDM, and Z. ABZ 2018, Southampton, United Kingdom, M. Butler, A. Raschke, T. S. Hoang, K. Reichl (editors), Lecture Notes in Computer Science, June 2018, vol. 10817, pp. 89-104. [ DOI : 10.1007/978-3-319-91271-4_7 ]
https://hal.inria.fr/hal-01871131
[29]
S. Lenglet, A. Schmitt.
HOπ in Coq, in: CPP 2018 - The 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, Los Angeles, United States, January 2018, 14 p. [ DOI : 10.1145/3167083 ]
https://hal.inria.fr/hal-01614987
[30]
D. Méry.
Modelling by Patterns for Correct-by-Construction Process, in: ISOLA 2018 - 8th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation, Limassol, Cyprus, Leveraging Applications of Formal Methods, Verification and Validation. Modeling - 8th International Symposium, ISoLA 2018, Springer, November 2018, vol. 11244, pp. 399-423.
https://hal.inria.fr/hal-01933971
[31]
A. Reynolds, H. Barbosa, P. Fontaine.
Revisiting Enumerative Instantiation, in: TACAS 2018 - 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, D. Beyer, M. Huisman (editors), LNCS, Springer, April 2018, vol. 10806, 20 p.
https://hal.archives-ouvertes.fr/hal-01877055
[32]
M. Romero, B. Lille, T. Viéville, M. Duflot-Kremer, C. De Smet, D. Belhassein.
Analyse comparative d’une activité d’apprentissage de la programmation en mode branché et débranché, in: Educode - Conférence internationale sur l'enseignement au numérique et par le numérique, Bruxelles, Belgium, August 2018.
https://hal.inria.fr/hal-01861732
[33]
A. Schlichtkrull, J. C. Blanchette, D. Traytel.
A Verified Prover Based on Ordered Resolution, in: CPP 2019 - The 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, Cascais, Portugal, CPP 2019 - The 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, January 2019. [ DOI : 10.1145/3293880.3294100 ]
https://hal.archives-ouvertes.fr/hal-01937141
[34]
A. Schlichtkrull, J. C. Blanchette, D. Traytel, U. Waldmann.
Formalizing Bachmair and Ganzinger's Ordered Resolution Prover, in: IJCAR 2018 - 9th International Joint Conference on Automated Reasoning, Oxford, United Kingdom, July 2018.
https://hal.inria.fr/hal-01904610
[35]
N. Schnepf, R. Badonnel, A. Lahmadi, S. Merz.
Generation of SDN policies for protecting Android environments based on automata learning, in: NOMS 2018 - IEEE/IFIP Network Operations and Management Symposium, Taipei, Taiwan, Proceedings of the IEEE/IFIP Network Operations and Management Symposium (IEEE/IFIP NOMS), IEEE, April 2018. [ DOI : 10.1109/NOMS.2018.8406153 ]
https://hal.archives-ouvertes.fr/hal-01892390
[36]
N. Schnepf, R. Badonnel, A. Lahmadi, S. Merz.
Rule-Based Synthesis of Chains of Security Functions for Software-Defined Networks, in: AVOCS 2018 - 18th International Workshop on Automated Verification of Critical Systems, Oxford, United Kingdom, Proceedings of the International Workshop on Automated Verification of Critical Systems, July 2018.
https://hal.archives-ouvertes.fr/hal-01892423
[37]
N. Schnepf, R. Badonnel, A. Lahmadi, S. Merz.
Synaptic: A formal checker for SDN-based security policies, in: NOMS 2018 - IEEE/IFIP Network Operations and Management Symposium, Taipei, Taiwan, IEEE, April 2018. [ DOI : 10.1109/NOMS.2018.8406122 ]
https://hal.archives-ouvertes.fr/hal-01892397
[38]
N. K. Singh, Y. Ait Ameur, D. Méry.
Formal Ontological Driven Model Refactoring, in: ICECCS 2018 - 23rd International Conference on Engineering of Complex Computer Systems, Melbourne, Australia, IEEE, December 2018.
https://hal.inria.fr/hal-01939006
[39]
S. Stratulat.
Validating Back-links of FOLID Cyclic Pre-proofs, in: CL&C'18 - Seventh International Workshop on Classical Logic and Computation, Oxford, United Kingdom, July 2018, vol. 281, pp. 39–53.
https://hal.archives-ouvertes.fr/hal-01883826

Books or Proceedings Editing

[40]
E. H. Abdelwahed, L. Bellatreche, D. Benslimane, M. Golfarelli, S. Jean, D. Méry, K. Nakamatsu, C. Ordonez (editors)
New Trends in Model and Data Engineering, Springer, Marrakesh, Morocco, October 2018, vol. Communications in Computer and Information Science, no 929. [ DOI : 10.1007/978-3-030-02852-7 ]
https://hal.inria.fr/hal-01933975
[41]
E. H. Abdelwahed, L. Bellatreche, M. Golfarelli, D. Méry, C. Ordonez (editors)
Model and Data Engineering, Lecture Notes in Computer Science, Springer, Marrakech, Morocco, October 2018, vol. 11163.
https://hal.inria.fr/hal-01933977
[42]
R. Laleau, D. Méry, S. Nakajima, E. Troubitsyna (editors)
Proceedings Joint Workshop on Handling IMPlicit and EXplicit knowledge in formal system development (IMPEX) and Formal and Model-Driven Techniques for Developing Trustworthy Systems (FM&MDD), EPTCS, May 2018, vol. 271, https://arxiv.org/abs/1805.04636. [ DOI : 10.4204/EPTCS.271 ]
https://hal.inria.fr/hal-01933762

Internal Reports

[43]
A. J. Reynolds, H. Barbosa, P. Fontaine.
Revisiting Enumerative Instantiation, University of Iowa ; Inria, March 2018.
https://hal.inria.fr/hal-01744956

Other Publications

[44]
N. Bertrand, I. Konnov, M. Lazic, J. Widder.
Verification of Randomized Distributed Algorithms under Round-Rigid Adversaries, November 2018, Experiments presented in this paper were carried out using the Grid5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations, see grid5000.fr.
https://hal.inria.fr/hal-01925533
[45]
R. Chen, C. Cohen, J.-J. Levy, S. Merz, L. Thery.
Formal Proofs of Tarjan's Algorithm in Why3, Coq, and Isabelle, October 2018, https://arxiv.org/abs/1810.11979 - working paper or preprint.
https://hal.inria.fr/hal-01906155
[46]
I. Konnov, J. Kukovec, T. H. Tran.
BmcMT: Bounded Model Checking of TLA + Specifications with SMT, July 2018, TLA+ Community Meeting 2018.
https://hal.inria.fr/hal-01899719
[47]
I. Konnov, S. Merz.
Model Checking of Fault-Tolerant Distributed Algorithms: from Classics towards Contemporary, June 2018, BCRB 2018 - DSN Workshop on Byzantine Consensus and Resilient Blockchains.
https://hal.inria.fr/hal-01899723
[48]
I. Stoilkovska, I. Konnov, J. Widder, F. Zuleger.
Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking, November 2018, working paper or preprint.
https://hal.inria.fr/hal-01925653
References in notes
[49]
J.-R. Abrial.
Modeling in Event-B: System and Software Engineering, Cambridge University Press, 2010.
[50]
Y. Ait Ameur, D. Méry.
Making explicit domain knowledge in formal system development, in: Science of Computer Programming, March 2016, vol. 121, pp. 100-127. [ DOI : 10.1016/j.scico.2015.12.004 ]
https://hal.inria.fr/hal-01245832
[51]
L. Bachmair, H. Ganzinger.
Rewrite-Based Equational Theorem Proving with Selection and Simplification, in: Journal of Logic and Computation, 1994, vol. 4, no 3, pp. 217–247.
[52]
R. Back, J. von Wright.
Refinement calculus—A systematic introduction, Springer Verlag, 1998.
[53]
H. Barbosa, P. Fontaine, A. Reynolds.
Congruence Closure with Free Variables, in: Tools and Algorithms for Construction and Analysis of Systems (TACAS), Uppsala, Sweden, 2017, vol. 205, pp. 220 - 230. [ DOI : 10.1007/10721959_17 ]
https://hal.inria.fr/hal-01590918
[54]
C. Barrett, R. Sebastiani, S. A. Seshia, C. Tinelli.
Satisfiability Modulo Theories, in: Handbook of Satisfiability, A. Biere, Marijn J. H. Heule, H. van Maaren, T. Walsh (editors), Frontiers in Artificial Intelligence and Applications, IOS Press, February 2009, vol. 185, chap. 26, pp. 825-885.
[55]
H. Becker, J. C. Blanchette, U. Waldmann, D. Wand.
A Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms, in: CADE-26 - 26th International Conference on Automated Deduction, Gothenburg, Sweden, L. de Moura (editor), Lecture Notes in Computer Science, Springer, August 2017, vol. 10395, pp. 432-453. [ DOI : 10.1007/978-3-319-63046-5_27 ]
https://hal.inria.fr/hal-01592186
[56]
M. Ben-Or.
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols (Extended Abstract), in: PODC, 1983, pp. 27–30.
[57]
J. C. Blanchette, U. Waldmann, D. Wand.
A Lambda-Free Higher-Order Recursive Path Order, in: Foundations of Software Science and Computation Structures, 20th International Conference (FOSSACS 2017), Uppsala, Sweden, J. Esparza, A. S. Murawski (editors), Lecture Notes in Computer Science, Springer, April 2017, vol. 10203, pp. 461-479. [ DOI : 10.1007/978-3-662-54458-7_27 ]
https://hal.inria.fr/hal-01592189
[58]
M. Bromberger, C. Weidenbach.
New techniques for linear arithmetic: cubes and equalities, in: Formal Methods in System Design, 2017, vol. 51, no 3, pp. 433–461.
[59]
R. Chen, J.-J. Levy.
A Semi-automatic Proof of Strong connectivity, in: Proc. 9th Working Conference on Verified Software: Theories, Tools, and Experiments (VSTTE 2017), A. Paskevich, T. Wies (editors), Lecture Notes in Computer Science, Springer, July 2017, pp. 49-65.
[60]
P. Chocron, P. Fontaine, C. Ringeissen.
A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited, in: 25th International Conference on Automated Deduction, CADE-25, Berlin, Germany, A. P. Felty, A. Middeldorp (editors), Lecture Notes in Computer Science, Springer, August 2015, vol. 9195, pp. 419-433. [ DOI : 10.1007/978-3-319-21401-6_29 ]
https://hal.inria.fr/hal-01157898
[61]
P. Chocron, P. Fontaine, C. Ringeissen.
A Rewriting Approach to the Combination of Data Structures with Bridging Theories, in: Frontiers of Combining Systems - 10th International Symposium, FroCoS 2015, Wroclaw, Poland, C. Lutz, S. Ranise (editors), Lecture Notes in Computer Science, Springer, September 2015, vol. 9322, pp. 275–290. [ DOI : 10.1007/978-3-319-24246-0_17 ]
https://hal.inria.fr/hal-01206187
[62]
A. Cimatti, A. Griggio, B. J. Schaafsma, R. Sebastiani.
The MathSAT5 SMT Solver, in: Tools and Algorithms for the Construction and Analysis of Systems - 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings, N. Piterman, S. A. Smolka (editors), Springer, 2013, vol. 7795, pp. 93–107.
[63]
B. Dutertre, L. de Moura.
A Fast Linear–Arithmetic Solver for DPLL(T), in: Proceedings of CAV, LNCS, Springer, August, 17–20 2006, vol. 4144, pp. 81–94.
[64]
M. J. Fischer, N. A. Lynch, M. S. Paterson.
Impossibility of Distributed Consensus with one Faulty Process, in: J. ACM, 1985, vol. 32, no 2, pp. 374–382.
[65]
N. Foster, A. Guha, M. Reitblatt, A. Story, M. J. Freedman, N. Praveen Katta, C. Monsanto, J. Reich, J. Rexford, C. Schlesinger, D. Walker, R. Harrison.
Languages for software-defined networks, in: IEEE Communications Magazine, 2013, vol. 51, no 2, pp. 128-134.
[66]
I. V. Konnov, H. Veith, J. Widder.
On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability, in: Inf. Comput., 2017, vol. 252, pp. 95–109.
[67]
L. Lamport.
Specifying Systems, Addison-Wesley, Boston, Mass., 2002.
[68]
C. Morgan.
Programming from Specifications, Prentice Hall, 1998, 2nd edition.
[69]
D. Méry, S. Rushikesh, A. Tarasyuk.
Integrating Domain-Based Features into Event-B: a Nose Gear Velocity Case Study, in: Model and Data Engineering - 5th International Conference, MEDI 2015, Rhodos, Greece, L. Bellatreche, Y. Manolopoulos (editors), LNCS, Springer, 2015, vol. 9344, pp. 89-102.
https://hal.inria.fr/hal-01245991
[70]
Y. J. Song, R. van Renesse.
Bosco: One-Step Byzantine Asynchronous Consensus, in: DISC, LNCS, 2008, vol. 5218, pp. 438–450.
[71]
T. Sturm.
A Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications, in: Mathematics in Computer Science, December 2017, vol. 11, no 3-4, pp. 483 - 502. [ DOI : 10.1007/s11786-017-0319-z ]
https://hal.inria.fr/hal-01648690
[72]
L. M. de Moura, N. Bjørner.
Z3: An Efficient SMT Solver, in: Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings, C. R. Ramakrishnan, J. Rehof (editors), Lecture Notes in Computer Science, Springer, 2008, vol. 4963, pp. 337–340.