Members
Overall Objectives
Research Program
Application Domains
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. Vanzetto.
Proof automation and type synthesis for set theory in the context of TLA+, Université de Lorraine, December 2014.
https://hal.inria.fr/tel-01096518

Articles in International Peer-Reviewed Journals

[12]
M. B. Andriamiarina, D. Méry, N. K. Singh.
Revisiting Snapshot Algorithms by Refinement-based Techniques (Extended Version), in: Computer Science and Information Systems, January 2014, vol. 11, no 1, pp. 251-270. [ DOI : 10.2298/CSIS130122007A ]
https://hal.inria.fr/hal-00924525
[13]
M. Arapinis, M. Duflot.
Bounding messages for free in security protocols – extension to various security properties, in: Information and Computation, 2014, 34 p. [ DOI : 10.1016/j.ic.2014.09.003 ]
https://hal.inria.fr/hal-01083657
[14]
C. W. Brown, M. Kosta.
Constructing a single cell in cylindrical algebraic decomposition, in: Journal of Symbolic Computation, September 2014, 35 p.
https://hal.inria.fr/hal-01088452
[15]
J. Chen, M. Duflot, S. Merz.
Analyzing Conflict Freedom For Multi-threaded Programs With Time Annotations, in: Electronic Communications of the EASST, December 2014, vol. 70, 14 p.
https://hal.inria.fr/hal-01087871
[16]
D. Déharbe, P. Fontaine, L. Voisin, Y. Guyot.
Integrating SMT solvers in Rodin, in: Science of Computer Programming, November 2014, vol. 94, 14 p.
https://hal.inria.fr/hal-01094999
[17]
M. Kosta, P. Duris.
Flip-Pushdown Automata with k Pushdown Reversals and E0L Systems are Incomparable, in: Information Processing Letters, 2014, vol. 114, no 8, pp. 417-420.
https://hal.inria.fr/hal-01088446
[18]
M. Lamotte-Schubert, C. Weidenbach.
BDI: a new decidable clause class, in: Journal of Logic and Computation, 2014, vol. 24, no 6, 28 p.
https://hal.inria.fr/hal-01098084
[19]
G. Lüttgen, S. Merz.
Editorial: Special Issue of Automated Verification of Critical Systems, in: Science of Computer Programming, December 2014, vol. 96, no 3, pp. 277-278.
https://hal.inria.fr/hal-01084232
[20]
D. Méry, B. Schätz, A. Wassyng.
The Pacemaker Challenge: Developing Certifiable Medical Devices (Dagstuhl Seminar 14062), in: Dagstuhl Reports, 2014, vol. 4, no 2, pp. 17–37.
https://hal.inria.fr/hal-01097629

Invited Conferences

[21]
C. Barrett, L. de Moura, P. Fontaine.
Proofs in satisfiability modulo theories, in: APPA (All about Proofs, Proofs for All), Vienna, Austria, July 2014.
https://hal.inria.fr/hal-01095009
[22]
D. Méry.
Playing with State-Based Models for Designing Better Algorithms, in: MEDI - Model and Data Engineering - 4th International Conference, Larrnaca, Greece, Y. A. Ameur, L. Bellatreche, G. A. Papadopoulos (editors), Lecture Notes in Computer Science, Springer, September 2014, vol. 8748, pp. 1-3.
https://hal.inria.fr/hal-01097625

International Conferences with Proceedings

[23]
Y. A. Ameur, J. P. Gibson, D. Méry.
On Implicit and Explicit Semantics: Integration Issues in Proof-Based Development of Systems, in: Leveraging Applications of Formal Methods, Verification and Validation. Specialized Techniques and Applications - 6th International Symposium,, Corfu, Greece, T. Margaria, B. Steffen (editors), Lectures Notes in Computer Science, Springer, October 2014, vol. 8803, pp. 604-618.
https://hal.inria.fr/hal-01097624
[24]
M. B. Andriamiarina, D. Méry, N. K. Singh.
Analysis of Self-* and P2P Systems using Refinement, in: ABZ 2014 - 4th International ABZ 2014 Conference ASM, Alloy, B, TLA, VDM, Z, Toulouse, France, Y. Ait Ameur, K.-D. Schewe (editors), LNCS, Springer, June 2014, vol. 8477, pp. 117-123. [ DOI : 10.1007/978-3-662-43652-3_9 ]
https://hal.inria.fr/hal-01018125
[25]
P. Baumgartner, J. Bax, U. Waldmann.
Finite Quantification in Hierarchic Theorem Proving, in: 7th International Joint Conference on Automated Reasoning (IJCAR 2014), Vienna, Austria, S. Demri, D. Kapur, C. Weidenbach (editors), Lecture Notes in Computer Science, Springer, July 2014, vol. 8562, pp. 152-167.
https://hal.inria.fr/hal-01087873
[26]
P. Chocron, P. Fontaine, C. Ringeissen.
A Gentle Non-Disjoint Combination of Satisfiability Procedures, in: Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, Vienna, Austria, Lecture Notes in Computer Science, Springer, July 2014, vol. 8562, pp. 122-136. [ DOI : 10.1007/978-3-319-08587-6_9 ]
https://hal.inria.fr/hal-01087162
[27]
P. Chocron, P. Fontaine, C. Ringeissen.
Satisfiability Modulo Non-Disjoint Combinations of Theories Connected via Bridging Functions, in: Workshop on Automated Deduction: Decidability, Complexity, Tractability, ADDCT 2014. Held as Part of the Vienna Summer of Logic, affiliated with IJCAR 2014 and RTA 2014, Vienna, Austria, Silvio Ghilardi, Ulrike Sattler, Viorica Sofronie-Stokkermans, July 2014.
https://hal.inria.fr/hal-01087218
[28]
K. Korovin, M. Kosta, T. Sturm.
Towards Conflict-Driven Learning for Virtual Substitution, in: CASC - Computer Algebra in Scientific Computing - 16th International Workshop, Warsaw, Poland, V. P. Gerdt, W. Koepf, W. M. Seiler, E. V. Vorozhtsov (editors), Lecture Notes in Computer Science, Springer, 2014, vol. 8660, pp. 256-270.
https://hal.inria.fr/hal-01088450
[29]
S. Merz, H. Vanzetto.
Refinement Types for TLA+, in: NASA Formal Methods - 6th International Symposium, Houston, Texas, United States, J. M. Badger, K. Y. Rozier (editors), LNCS, Springer, 2014, vol. 8430, pp. 143-157. [ DOI : 10.1007/978-3-319-06200-6_11 ]
https://hal.inria.fr/hal-01063516
[30]
D. Méry, N. K. Singh.
Formal Evaluation of Landing Gear System, in: SoICT - Fifth Symposium on Information and Communication Technology, HANOI, Vietnam, N. H. Son, Y. Deville, M. Bui (editors), ACM, December 2014.
https://hal.inria.fr/hal-01097645
[31]
D. Méry, N. K. Singh.
Modeling an Aircraft Landing System in Event-B, in: ABZ 2014 Case Study Track, Toulouse, France, F. Boniol (editor), CCIS, Springer, June 2014, vol. 433, pp. 154-159.
https://hal.inria.fr/hal-00985010
[32]
D. Méry, N. K. Singh.
The Semantics of Refinement Chart, in: HCI International, Heraklion, Greece, V. G. Duffy (editor), Lecture Notes in Computer Science, Springer, June 2014, vol. 8529, pp. 415-426. [ DOI : 10.1007/978-3-319-07725-3_42 ]
https://hal.inria.fr/hal-00995176

Conferences without Proceedings

[33]
D. Doligez, J. Kriener, L. Lamport, T. Libal, S. Merz.
Coalescing: Syntactic Abstraction for Reasoning in First-Order Modal Logics, in: ARQNL 2014 - Automated Reasoning in Quantified Non-Classical Logics, Vienna, Austria, July 2014.
https://hal.inria.fr/hal-01063512
[34]
K. Korovin, M. Kosta, T. Sturm.
Towards Conflict-Driven Learning for Virtual Substitution, in: SMT - 12th International Workshop on Satisfiability Modulo Theories, Vienna, Austria, Informal CEUR Workshop Proceedings, Philipp Rümmer and Christoph M. Wintersteiger, July 2014.
https://hal.inria.fr/hal-01088458
[35]
M. Kosta, T. Sturm, A. Dolzmann.
Better Answers to Real Questions, in: SMT - 12th International Workshop on Satisfiability Modulo Theories, Vienna, Austria, Informal CEUR Workshop Proceedings, Philipp Rümmer and Christoph M. Wintersteiger, July 2014, 69 p.
https://hal.inria.fr/hal-01088456
[36]
D. Wand.
Polymorphic+Typeclass Superposition, in: 4th Workshop on Practical Aspects of Automated Reasoning (PAAR 2014), Vienna, Austria, B. Konev, L. de Moura, S. Schulz (editors), July 2014, 15 p.
https://hal.inria.fr/hal-01098078

Scientific Books (or Scientific Book chapters)

[37]
S. Demri, D. Kapur, C. Weidenbach.
Automated Reasoning – Seventh International Joint Conference (IJCAR 2014), Lecture Notes in Computer Science, Springer, 2014, vol. 8562.
https://hal.inria.fr/hal-01098072
[38]
S. Merz.
Science of Computer Programming Special Issue: Automated Verification of Critical Systems, Science of Computer Programming, Elsevier, December 2014, vol. 96, no 3.
https://hal.inria.fr/hal-01084228
[39]
S. Merz, J. Pang.
Formal Methods and Software Engineering – 16th International Conference on Formal Engineering Methods (ICFEM 2014), Lecture Notes in Computer Science, Springer, November 2014, vol. 8829, 460 p.
https://hal.inria.fr/hal-01098238

Books or Proceedings Editing

[40]
G. Ciobanu, D. Méry (editors)
Theoretical Aspects of Computing – ICTAC 2014, Lecture Notes in Computer Science, Springer, Bucharest, Romania, September 2014, vol. 8687.
https://hal.inria.fr/hal-01097627
[41]
C. Dubois, D. Giannakopoulou, D. Méry (editors)
Proceedings 1st Workshop on Formal Integrated Development Environment, Electronic Proceedings in Theoretical Computer Science, EPTCS, France, April 2014, vol. 149, 105 p. [ DOI : 10.4204/EPTCS.149.9 ]
https://hal.inria.fr/hal-00987531

Internal Reports

[42]
M. B. Andriamiarina, D. Méry, N. K. Singh.
Analysis of Self-* and P2P Systems using Refinement (Full Report), 2014.
https://hal.inria.fr/hal-01018162
[43]
P. Chocron, P. Fontaine, C. Ringeissen.
A Gentle Non-Disjoint Combination of Satisfiability Procedures (Extended Version), April 2014, no RR-8529.
https://hal.inria.fr/hal-00985135
References in notes
[44]
J.-R. Abrial.
Modeling in Event-B: System and Software Engineering, Cambridge University Press, 2010.
[45]
E. Althaus, E. Kruglov, C. Weidenbach.
Superposition Modulo Linear Arithmetic SUP(LA), in: 7th Intl. Symp. Frontiers of Combining Systems (FROCOS 2009), Trento, Italy, S. Ghilardi, R. Sebastiani (editors), Lecture Notes in Computer Science, Springer, 2009, vol. 5749, pp. 84-99.
[46]
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.
[47]
R. Back, J. von Wright.
Refinement calculus—A systematic introduction, Springer Verlag, 1998.
[48]
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.
[49]
T. Bøgholm, H. Kragh-Hansen, P. Olsen, B. Thomsen, K. G. Larsen.
Model-based schedulability analysis of safety critical hard real-time Java programs, in: Workshop on Java Technologies for Real-time and Embedded Systems (JTRES), G. Bollella, C. D. Locke (editors), ACM, 2008, pp. 106-114.
[50]
D. Déharbe, P. Fontaine, Y. Guyot, L. Voisin.
SMT solvers for Rodin, in: ABZ - Third International Conference on Abstract State Machines, Alloy, B, VDM, and Z - 2012, Pisa, Italy, J. Derrick, J. A. Fitzgerald, S. Gnesi, S. Khurshid, M. Leuschel, S. Reeves, E. Riccobene (editors), Lecture Notes in Computer Science, Springer, 2012, vol. 7316, pp. 194-207.
[51]
D. Jovanović, L. de Moura.
Solving Non-linear Arithmetic, in: Automated Reasoning, B. Gramlich, D. Miller, U. Sattler (editors), Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2012, vol. 7364, pp. 339–354.
[52]
L. Lamport.
Specifying Systems, Addison-Wesley, Boston, Mass., 2002.
[53]
S. Merz, H. Vanzetto.
Harnessing SMT Solvers for TLA+ Proofs, in: 12th International Workshop on Automated Verification of Critical Systems (AVoCS 2012), Bamberg, Germany, G. Lüttgen, S. Merz (editors), ECEASST, EASST, December 2012, vol. 53.
[54]
C. Morgan.
Programming from Specifications, Prentice Hall, 1998, 2nd edition.
[55]
R. Nieuwenhuis, A. Oliveras, C. Tinelli.
Solving SAT and SAT Modulo Theories: From an abstract Davis–Putnam–Logemann–Loveland procedure to DPLL(T), in: J. ACM, 2006, vol. 53, no 6, pp. 937-977.
[56]
V. Prevosto, U. Waldmann.
SPASS+T, in: ESCoR: FLoC'06 Workshop on Empirically Successful Computerized Reasoning, Seattle, WA, USA, G. Sutcliffe, R. Schmidt, S. Schulz (editors), CEUR Workshop Proceedings, 2006, vol. 192, pp. 18-33.
[57]
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.