Members
Overall Objectives
Research Program
Application Domains
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]
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.
[5]
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/
[6]
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.
[7]
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

Articles in International Peer-Reviewed Journals

[8]
M. B. Andriamiarina, D. Méry, N. K. Singh.
Revisiting Snapshot Algorithms by Refinement-based Techniques (Extended Version), in: Computer Science and Information Systems, 2014.
http://hal.inria.fr/hal-00924525
[9]
D. Méry, N. K. Singh.
Formal Specification of Medical Systems by Proof-Based Refinement, in: ACM Transactions in Embedded Computing Systems, January 2013, vol. 12, no 1, 15 p. [ DOI : 10.1145/2406336.2406351 ]
http://hal.inria.fr/inria-00637756

International Conferences with Proceedings

[10]
M. B. Andriamiarina, D. Méry, N. K. Singh.
Integrating Proved State-Based Models for Constructing Correct Distributed Algorithms, in: iFM - 10th International Conference on integrated Formal Methods - 2013, Turku, Finland, June 2013.
http://hal.inria.fr/hal-00819256
[11]
N. Azmy, C. Weidenbach.
Computing Tiny Clause Normal Forms, in: 24th International Conference on Automated Deduction (CADE-24), Lake Placid, NY, United States, M.-P. Bonacina (editor), Lecture Notes in Computer Science, Springer, 2013, vol. 7898, pp. 109-125. [ DOI : 10.1007/978-3-642-38574-2_7 ]
http://hal.inria.fr/hal-00931893
[12]
P. Baumgartner, U. Waldmann.
Hierarchic Superposition With Weak Abstraction, in: 24th International Conference on Automated Deduction (CADE-24), Lake Placid, NY, United States, M. P. Bonacina (editor), Lecture Notes in Computer Science, Springer, 2013, vol. 7898, pp. 39-57. [ DOI : 10.1007/978-3-642-38574-2_3 ]
http://hal.inria.fr/hal-00931919
[13]
D. Déharbe, P. Fontaine, D. Le Berre, B. Mazure.
Computing prime implicant, in: FMCAD - Formal Methods in Computer-Aided Design 2013, Portland, United States, IEEE, October 2013, pp. 46-52.
http://hal.inria.fr/hal-00910363
[14]
H. Errami, M. Eiswirth, D. Grigoriev, W. Seiler, T. Sturm, A. Weber.
Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates, in: Computer Algebra in Scientific Computing, Berlin, Germany, V. P. Gerdt, W. Koepf, E. W. Mayr, E. V. Vorozhtsov (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 8136, pp. 88-99. [ DOI : 10.1007/978-3-319-02297-0_7 ]
http://hal.inria.fr/hal-00931946
[15]
R. Karrenberg, M. Kosta, T. Sturm.
Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages, in: 9th International Conference Frontiers of Combining Systems (FroCos 2013), Nancy, France, P. Fontaine, C. Ringeissen, R. Schmidt (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 8152, pp. 56-70. [ DOI : 10.1007/978-3-642-40885-4_5 ]
http://hal.inria.fr/hal-00931954
[16]
E. Mabille, M. Boyer, L. Féjoz, S. Merz.
Towards Certifying Network Calculus, in: ITP - 4th International Conference on Interactive Theorem Proving, Rennes, France, S. Blazy, C. Paulin-Mohring, D. Pichardie (editors), Lecture Notes in Computer Science, Springer, July 2013, vol. 7998, pp. 484-489. [ DOI : 10.1007/978-3-642-39634-2_37 ]
http://hal.inria.fr/hal-00904796
[17]
D. Méry, M. Poppleton.
Formal Modelling and Verification of Population Protocols, in: iFM - 10th International Conference on integrated Formal Methods - 2013, Turku, Finland, E. B. Johnsen, L. Petre (editors), LNCS, Springer, June 2013.
http://hal.inria.fr/hal-00813033
[18]
D. Méry, M. Rosemary.
Transforming EVENT B Models into Verified C# Implementations, in: VPT 2013 - First International Workshop on Verification and Program Transformation, Saint Petersburg, Russian Federation, A. Lisitsa, A. Nemytykh (editors), EPIC, Alexei Lisitsa and Andrei Nemytykh, July 2013, vol. 16, pp. 57-73.
http://hal.inria.fr/hal-00862050
[19]
D. Méry, N. K. Singh.
Ideal Mode Selection of a Cardiac Pacing System, in: 4th International Conference - Digital Human Modeling and applications in Health, Safety, Ergonomics and Risk Management - DHM 2013 (HCI International 2013), Las Vegas, United States, V. G. Duffy (editor), Lecture Notes in Computer Science, Springer, July 2013, vol. 8025, pp. 258-267. [ DOI : 10.1007/978-3-642-39173-6_31 ]
http://hal.inria.fr/hal-00862077
[20]
M. Tounsi, M. Mosbah, D. Méry.
From Event-B Specifications to Programs for Distributed Algorithms, in: WETICE 2013: 22th IEEE International Conference on Enabling Technologies: Infrastructures for Collaborative Enterprises., Hammamet, Tunisia, S. Reddy, M. Jmaiel (editors), IEEE, June 2013. [ DOI : 10.1109/WETICE.2013.44 ]
http://hal.inria.fr/hal-00862056

Conferences without Proceedings

[21]
C. Areces, D. Déharbe, P. Fontaine, O. Ezequiel.
SyMT: finding symmetries in SMT formulas, in: 11th International Workshop on Satisfiability Modulo Theories - SMT, Helsinki, Finland, July 2013.
http://hal.inria.fr/hal-00867816
[22]
P. Baumgartner, U. Waldmann.
Hierarchic Superposition: Completeness without Compactness, in: Fifth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS 2013), Nanning, China, 2013.
http://hal.inria.fr/hal-00931928
[23]
M. Kosta.
SMT-Based Compiler Support for Memory Access Optimization for Data-Parallel Languages, in: Fifth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS 2013), Nanning, China, 2013.
http://hal.inria.fr/hal-00931958
[24]
E. Mabille, M. Boyer, L. Féjoz, S. Merz.
Certifying Network Calculus in a Proof Assistant, in: EUCASS - 5th European Conference for Aeronautics and Space Sciences, Munich, Germany, Astrium and Technische Universität München, July 2013.
http://hal.inria.fr/hal-00904817

Scientific Books (or Scientific Book chapters)

[25]
D. Méry, N. K. Singh.
Event B, in: Mise en oeuvre de la méthode B, J.-L. Boulanger (editor), Informatique et Systèmes d'Informations, HERMES, April 2013.
http://hal.inria.fr/hal-00926335

Books or Proceedings Editing

[26]
B. Charron-Bost, S. Merz, A. Rybalchenko, J. Widder (editors)
Formal Verification of Distributed Algorithms, Dagstuhl Reports, Dagstuhl, June 2013, vol. 3, 16 p. [ DOI : 10.4230/DagRep.3.4.1 ]
http://hal.inria.fr/hal-00904805
[27]
P. Fontaine, C. Ringeissen, R. Schmidt (editors)
Frontiers of Combining Systems, Lecture Notes in Artificial Intelligence, Springer, September 2013, vol. 8152, 359 p.
http://hal.inria.fr/hal-00868424
References in notes
[28]
J.-R. Abrial.
Modeling in Event-B: System and Software Engineering, Cambridge University Press, 2010.
[29]
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.
[30]
M. Arapinis, M. Duflot.
Bounding Messages for Free in Security Protocols, in: 27th Int. Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), Lecture Notes in Computer Science, Springer, 2007, vol. 4855, pp. 376-387.
[31]
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.
[32]
R. Back, J. von Wright.
Refinement calculus—A systematic introduction, Springer Verlag, 1998.
[33]
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.
[34]
J. C. Blanchette, A. Popescu, D. Wand, C. Weidenbach.
More SPASS with Isabelle - Superposition with Hard Sorts and Configurable Simplification, in: ITP, Lecture Notes in Computer Science, Springer, 2012, vol. 7406, pp. 345-360.
[35]
C. W. Brown.
Constructing a single open cell in a cylindrical algebraic decomposition, in: Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation, New York, NY, USA, ISSAC '13, ACM, 2013, pp. 133–140.
[36]
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.
[37]
M. Castro, M. Costa, A. Rowstrom.
Performance and Dependability of Structured Peer-to-Peer Overlays, in: Intl. Conf. Dependable Systems and Networks (DSN 2004), Florence, Italy, IEEE Computer Society, 2004, pp. 9–18.
[38]
G. E. Collins.
Quantifier elimination for real closed fields by cylindrical algebraic decompostion, in: Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20-23, 1975, H. Brakhage (editor), Lecture Notes in Computer Science, Springer Berlin Heidelberg, 1975, vol. 33, pp. 134-183.
[39]
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.
[40]
A. Fietzke, E. Kruglov, C. Weidenbach.
Automatic Generation of Invariants for Circular Derivations in SUP(LA), in: 18th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2012, N. Bjørner, A. Voronkov (editors), LNCS, Springer, 2012, vol. 7180, pp. 197–211.
[41]
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.
[42]
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.
[43]
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.
[44]
L. Lamport.
Specifying Systems, Addison-Wesley, Boston, Mass., 2002.
[45]
J.-Y. Le Boudec, P. Thiran.
Network Calculus, Springer, 2001.
[46]
T. Lu, S. Merz, C. Weidenbach.
Towards Verification of the Pastry Protocol Using TLA+, in: FMOODS/FORTE, R. Bruni, J. Dingel (editors), Lecture Notes in Computer Science, Springer, 2011, vol. 6722, pp. 244-258.
[47]
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.
[48]
C. Morgan.
Programming from Specifications, Prentice Hall, 1998, 2nd edition.
[49]
D. Peled, T. Wilke.
Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator, in: Inf. Proc. Letters, 1997, vol. 63, no 5, pp. 243–246.
[50]
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.
[51]
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.