Personnel
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
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]
H. Barbosa.
New techniques for instantiation and proof production in SMT solving, Université de Lorraine, September 2017.
https://tel.archives-ouvertes.fr/tel-01591108
[12]
D. Wand.
Superposition: Types and Induction, Saarland University, August 2017.
https://hal.inria.fr/tel-01592497

Articles in International Peer-Reviewed Journals

[13]
J. C. Blanchette, A. Popescu, D. Traytel.
Soundness and Completeness Proofs by Coinductive Methods, in: Journal of Automated Reasoning, January 2017, vol. 58, no 1, pp. 149 - 179. [ DOI : 10.1007/s10817-016-9391-3 ]
https://hal.inria.fr/hal-01643157
[14]
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. [ DOI : 10.1007/s10703-017-0278-7 ]
https://hal.inria.fr/hal-01656397
[15]
D. Méry.
Playing with State-Based Models for Designing Better Algorithms, in: Future Generation Computer Systems, March 2017, vol. 68, pp. 445-455.
https://hal.inria.fr/hal-01316026
[16]
D. Méry, M. Poppleton.
Towards An Integrated Formal Method for Verification of Liveness Properties in Distributed Systems: with application to Population Protocols, in: Software and Systems Modeling (SoSyM), October 2017, vol. 16, no 4, pp. 1083–1115.
https://hal.inria.fr/hal-01245819
[17]
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

Invited Conferences

[18]
J. Biendarra, J. C. Blanchette, A. Bouzy, M. Desharnais, M. Fleury, J. Hölzl, O. Kunčar, A. Lochbihler, F. Meier, L. Panny, A. Popescu, C. C. Sternagel, R. Thiemann, D. Traytel.
Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic, in: Frontiers of Combining Systems, 11th International Symposium, Brasilia, Brazil, C. Dixon, M. Finger (editors), Lecture Notes in Computer Science, Springer, September 2017, vol. 10483, pp. 3-21. [ DOI : 10.1007/978-3-319-66167-4_1 ]
https://hal.inria.fr/hal-01592196

International Conferences with Proceedings

[19]
H. Barbosa, J. C. Blanchette, P. Fontaine.
Scalable Fine-Grained Proofs for Formula Processing, in: Proc. Conference on Automated Deduction (CADE), Gotenburg, Sweden, L. de Moura (editor), Lecture Notes in Computer Science, Springer, 2017, vol. 10395, pp. 398 - 412. [ DOI : 10.1007/978-3-642-02959-2_10 ]
https://hal.inria.fr/hal-01590922
[20]
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
[21]
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
[22]
A. Bentkamp, J. C. Blanchette, D. Klakow.
A Formal Proof of the Expressiveness of Deep Learning, in: ITP 2017: 8th International Conference on Interactive Theorem Proving, Brasilia, Brazil, September 2017. [ DOI : 10.1007/3-540-48256-3_12 ]
https://hal.inria.fr/hal-01599172
[23]
J. C. Blanchette, A. Bouzy, A. Lochbihler, A. Popescu, D. Traytel.
Friends with Benefits: Implementing Corecursion in Foundational Proof Assistants, in: Programming Languages and Systems - 26th European Symposium on Programming, ESOP 2017, Uppsala, Sweden, April 2017.
https://hal.inria.fr/hal-01599167
[24]
J. C. Blanchette, M. Fleury, D. Traytel.
Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL, in: FSCD 2017: 2nd International Conference on Formal Structures for Computation and Deduction, Oxford, United Kingdom, September 2017, vol. 11, pp. 1 - 11. [ DOI : 10.4230/LIPIcs.FSCD.2017.11 ]
https://hal.inria.fr/hal-01599176
[25]
J. C. Blanchette, M. Fleury, C. Weidenbach.
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality, in: 26th International Joint Conference on Artificial Intelligence, Melbourne, Australia, C. Sierra (editor), August 2017, pp. 4786-4790. [ DOI : 10.24963/ijcai.2017/667 ]
https://hal.inria.fr/hal-01592164
[26]
J. C. Blanchette, F. Meier, A. Popescu, D. Traytel.
Foundational nonuniform (Co)datatypes for higher-order logic, in: LICS 2017: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, June 2017, pp. 1 - 12. [ DOI : 10.1109/LICS.2017.8005071 ]
https://hal.inria.fr/hal-01599174
[27]
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
[28]
R. Bradford, J. H. Davenport, M. England, H. Errami, V. Gerdt, D. Grigoriev, C. Hoyt, M. Košta, O. Radulescu, T. Sturm, A. Weber.
A Case Study on the Parametric Occurrence of Multiple Steady States, in: ISSAC 2017 - International Symposium on Symbolic and Algebraic Computation, Kaiserslautern, Germany, ACM, July 2017, pp. 45-52. [ DOI : 10.1145/3087604.3087622 ]
https://hal.inria.fr/hal-01648694
[29]
S. Cruanes.
Satisfiability Modulo Bounded Checking, in: International Conference on Automated Deduction (CADE), Gothenburg, Sweden, Leonardo de Moura, August 2017, vol. 26, pp. 114-129. [ DOI : 10.1007/978-3-319-63046-5_8 ]
https://hal.inria.fr/hal-01572531
[30]
M. Duroeulx, N. Brinzei, M. Duflot, S. Merz.
Satisfiability techniques for computing minimal tie sets in reliability assessment, in: 10th International Conference on Mathematical Methods in Reliability, MMR 2017, Grenoble, France, July 2017, pp. 1-8.
https://hal.inria.fr/hal-01630851
[31]
M. England, H. Errami, D. Grigoriev, O. Radulescu, T. Sturm, A. Weber.
Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks, in: CASC 2017 - 19th International Workshop on Computer Algebra in Scientific Computing, Beijing, China, V. P. Gerdt, W. Koepf, W. M. Seiler, E. V. Vorozhtsov (editors), LNCS - Lecture Notes in Computer Science, Springer, September 2017, vol. 10490. [ DOI : 10.1007/978-3-319-66320-3 ]
https://hal.inria.fr/hal-01648691
[32]
F. Fakhfakh, M. Tounsi, M. Mosbah, A. Hadj Kacem, D. Méry.
A Formal Approach for Maintaining Forest Topologies in Dynamic Networks, in: ICIS 2017 - 16th IEEE/ACIS International Conference on Computer and Information Science, Wuhan, China, Studies in Computational Intelligence, May 2017, vol. 719, pp. 123-137. [ DOI : 10.1007/978-3-319-60170-0_9 ]
https://hal.archives-ouvertes.fr/hal-01495807
[33]
P. Fontaine, M. Ogawa, T. Sturm, X. Vu.
Subtropical Satisfiability, in: FroCoS 2017 - 11th International Symposium on Frontiers of Combining Systems, Brasilia, Brazil, C. Dixon, M. Finger (editors), Lecture Notes in Artificial Intelligence, Springer, September 2017, vol. 10483. [ DOI : 10.1007/978-3-319-66167-4 ]
https://hal.inria.fr/hal-01590899
[34]
P. J. Gibson, S. Kherroubi, D. Méry.
Applying a Dependency Mechanism for Voting Protocol Models Using Event-B, in: 37th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2017), Neuchâtel, Switzerland, A. Bouajjani, A. Silva (editors), Formal Techniques for Distributed Objects, Components, and Systems, Springer International Publishing, June 2017, vol. LNCS-10321, pp. 124-138. [ DOI : 10.1007/978-3-319-60225-7_9 ]
https://hal.inria.fr/hal-01658423
[35]
S. Himmiche, A. Aubry, P. Marangé, J.-F. Pétin, M. Duflot.
Using statistical-model-checking-based simulation for evaluating the robustness of a production schedule, in: 7th Workshop on Service Orientation in Holonic and Multi-Agent Manufacturing, SOHOMA'17, Nantes, France, October 2017.
https://hal.inria.fr/hal-01652140
[36]
M. Horbach, M. Voigt, C. Weidenbach.
On the Combination of the Bernays–Schönfinkel–Ramsey Fragment with Simple Linear Integer Arithmetic, 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. 77-94. [ DOI : 10.1007/978-3-319-63046-5_6 ]
https://hal.inria.fr/hal-01592160
[37]
S. Kherroubi, D. Méry.
Contextualization and Dependency in State-Based Modelling - Application to Event-B, in: MEDI 2017 - International Conference on Model and Data Engineering, Barcelona, Spain, Lecture Notes in Computer Science, Springer, October 2017, vol. 10563, pp. 137–152. [ DOI : 10.1007/978-3-319-66854-3_11 ]
https://hal.inria.fr/hal-01631017
[38]
N. Schnepf, R. Badonnel, A. Lahmadi, S. Merz.
Automated Verification of Security Chains in Software-Defined Networks with Synaptic, in: NetSoft 2017 - IEEE Conference on Network Softwarization, Bologna, Italy, IEEE Computer Society, July 2017, 9 p. [ DOI : 10.1109/NETSOFT.2017.8004195 ]
https://hal.inria.fr/hal-01630806
[39]
A. Teucke, C. Weidenbach.
Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints, in: CADE 2017 - 26th International Conference on Automated Deduction, Gothenburg, Sweden, L. de Moura (editor), CADE 2017: Automated Deduction – CADE 26, Springer, August 2017, vol. 10395, pp. 202-219. [ DOI : 10.1007/978-3-319-63046-5_13 ]
https://hal.inria.fr/hal-01657026
[40]
M. Voigt.
A fine-grained hierarchy of hard problems in the separated fragment, in: LICS 2017 - 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, J. Ouaknine (editor), IEEE Computer Society, June 2017, pp. 1 - 12. [ DOI : 10.1109/LICS.2017.8005094 ]
https://hal.inria.fr/hal-01592172
[41]
M. Voigt.
The Bernays–Schönfinkel–Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable, in: FroCoS 2017 - 11th International Symposium on Frontiers of Combining Systems, Brasilia, Brazil, C. Dixon, M. Finger (editors), Lecture Notes in Computer Science, Springer, September 2017, vol. 10483, pp. 244-261. [ DOI : 10.1007/978-3-319-66167-4_14 ]
https://hal.inria.fr/hal-01592169

Conferences without Proceedings

[42]
S. Himmiche, P. Marangé, A. Aubry, M. Duflot, J.-F. Pétin.
Evaluation de la robustesse d'un ordonnancement par Automates Temporisés Stochastiques, in: 11ème Colloque sur la Modélisation des Systèmes Réactifs, MSR 2017, Marseille, France, November 2017.
https://hal.inria.fr/hal-01652138

Books or Proceedings Editing

[43]
C. Dubois, P. Masci, D. Méry (editors)
Proceedings of the Third Workshop on Formal Integrated Development Environment, F-IDE@FM 2016, Limassol, Cyprus, November 8, 2016, EPTCS, Cyprus, January 2017, vol. 240. [ DOI : 10.4204/EPTCS.240 ]
https://hal.inria.fr/hal-01652413

Internal Reports

[44]
H. Barbosa, J. C. Blanchette, P. Fontaine.
Scalable Fine-Grained Proofs for Formula Processing, Universite de Lorraine, CNRS, Inria, LORIA, Nancy, France ; Universidade Federal do Rio Grande do Norte, Natal, Brazil ; Vrije Universiteit Amsterdam, Amsterdam, The Netherlands ; Max-Planck-Institut für Informatik, Saarbrücken, Germany, May 2017, 25 p.
https://hal.inria.fr/hal-01526841
[45]
H. Barbosa, P. Fontaine, A. Reynolds.
Congruence Closure with Free Variables, Inria, Loria, Universite de Lorraine, UFRN, University of Iowa, January 2017.
https://hal.inria.fr/hal-01442691
[46]
L. Lamport, S. Merz.
Auxiliary Variables in TLA+, Inria Nancy - Grand Est (Villers-lès-Nancy, France) ; Microsoft Research, May 2017, https://arxiv.org/abs/1703.05121.
https://hal.inria.fr/hal-01488617

Other Publications

[47]
M. Duroeulx, N. Brinzei, M. Duflot, S. Merz.
Satisfiability techniques for computing minimal tie sets in reliability assessment, April 2017, working paper or preprint.
https://hal.inria.fr/hal-01518920
[48]
M. Horbach, M. Voigt, C. Weidenbach.
The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable, September 2017, working paper or preprint.
https://hal.inria.fr/hal-01592177
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]
N. Azmy.
A Machine-Checked Proof of Correctness of Pastry, Saarland University and University of Lorraine, Saarbrücken, Germany, and Nancy, France, 2016.
[52]
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.
[53]
R. Back, J. von Wright.
Refinement calculus—A systematic introduction, Springer Verlag, 1998.
[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]
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
[56]
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
[57]
S. Cruanes, J. C. Blanchette.
Extending Nunchaku to Dependent Type Theory, in: Hammers for Type Theories (HaTT 2016), Coimbra, Portugal, EPTCS, July 2016, vol. 210, pp. 3-12. [ DOI : 10.4204/EPTCS.210.3 ]
https://hal.inria.fr/hal-01401696
[58]
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.
[59]
L. Lamport.
Specifying Systems, Addison-Wesley, Boston, Mass., 2002.
[60]
C. Morgan.
Programming from Specifications, Prentice Hall, 1998, 2nd edition.
[61]
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
[62]
A. Reynolds, J. C. Blanchette, S. Cruanes, C. Tinelli.
Model Finding for Recursive Functions in SMT, in: 8th International Joint Conference on Automated Reasoning (IJCAR 2016), Coimbra, Portugal, June 2016. [ DOI : 10.1007/978-3-319-40229-1_10 ]
https://hal.inria.fr/hal-01336082
[63]
A. Rowstron, P. Druschel.
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, in: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), Heidelberg, Germany, R. Guerraoui (editor), Lecture Notes in Computer Science, Springer, 2001, vol. 2218, pp. 329-350.
[64]
V. Sofronie-Stokkermans.
Hierarchical and modular reasoning in complex theories: The case of local theory extensions, in: Frontiers of Combining Systems. 6th International Symposium FroCos 2007, Proceedings, Liverpool, UK, B. Konev, F. Wolter (editors), Lecture Notes in Computer Science, Springer, 2007, vol. 4720, pp. 47-71, Invited paper.
[65]
T. Sturm, M. Voigt, C. Weidenbach.
Deciding First-Order Satisfiability when Universal and Existential Variables are Separated, in: LICS 2016, New York, United States, July 2016, pp. 86 - 95. [ DOI : 10.1145/2933575.2934532 ]
https://hal.inria.fr/hal-01389744
[66]
S. A. Weil, S. A. Brandt, E. L. Miller, D. D. E. Long, C. Maltzahn.
Ceph: A Scalable, High-Performance Distributed File System, in: 7th Symp. Operating Systems Design and Implementation (OSDI '06), Seattle, WA, Usenix Association, 2006, pp. 307-320.