EN FR
EN FR


previous Previous | up Home


Bibliography

Major publications by the team in recent years
  • 1T. 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, p. 151-156.
  • 2D. 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, Berlin-Heidelberg, 2008, p. 47–152.
  • 3K. Chaudhuri, D. Doligez, L. Lamport, S. Merz.

    Verifying Safety Properties With the TLA+ Proof System, in: Fifth Intl. Joint Conf. Automated Reasoning (IJCAR 2010), Edinburgh, UK, J. Giesl, R. Hähnle (editors), LNCS, Springer, 2010, vol. 6173, p. 142–148. [ DOI : 10.1007/978-3-642-14203-1_12 ]

    http://hal.inria.fr/inria-00534821/en
  • 4D. 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, p. 222-236.
  • 5F. 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/
  • 6S. 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, Berlin-Heidelberg, 2008, p. 401–451.
  • 7C. 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, p. 140–145.
Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 8S. Akhtar.

    Verification of Distributed Algorithms using PlusCal-2, Université de Lorraine, May 2012.

Articles in International Peer-Reviewed Journals

  • 9W. Damm, H. Dierks, S. Disch, W. Hagemann, F. Pigorsch, C. Scholl, U. Waldmann, B. Wirtz.

    Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces, in: Science of Computer Programming, September 2012, vol. 77, no 10-11, p. 1122-1150.

    http://hal.inria.fr/hal-00760387
  • 10D. Méry, N. K. Singh.

    Formal Specification of Medical Systems by Proof-Based Refinement, in: ACM Transactions in Embedded Computing Systems, January 2012.

    http://hal.inria.fr/inria-00637756

International Conferences with Proceedings

  • 11Y. Ait Ameur, D. Méry.

    Handling Heterogeneity in Formal Developments of Hardware and Software Systems, in: Leveraging Applications of Formal Methods, Verification and Validation. Applications and Case Studies - 5th International Symposium, ISoLA 2012, Heraklion, Greece, T. Margaria, B. Steffen (editors), Lecture Notes in Computer Science, Springer, October 2012, vol. 7610, p. 327-328.

    http://hal.inria.fr/hal-00743810
  • 12M. B. Andriamiarina, H. Daoud, M. Belarbi, D. Méry, C. Tanougast.

    Formal Verification of Fault Tolerant NoC-based Architecture, in: First International Workshop on Mathematics and Computer Science (IWMCS2012), Tiaret, Algeria, December 2012.

    http://hal.inria.fr/hal-00763092
  • 13M. B. Andriamiarina, D. Méry, N. K. Singh.

    Revisiting Snapshot Algorithms by Refinement-based Techniques, in: PDCAT 2012 : The Thirteenth International Conference on Parallel and Distributed Computing, Applications and Technologies, Beijing, China, 2012.

    http://hal.inria.fr/hal-00734131
  • 14J. Blanchette, A. Popescu, D. Wand, C. Weidenbach.

    More SPASS with Isabelle – Superposition with Hard Sorts and Configurable Simplification, in: Interactive Theorem Proving (ITP 2012), Princeton, New Jersey, United States, L. Beringer, A. Felty (editors), LNCS, Springer, 2012, vol. 7406, p. 345-360.

    http://hal.inria.fr/hal-00760392
  • 15D. 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, p. 147-154, The original publication is available at www.springerlink.com. [ DOI : 10.1007/978-3-642-32759-9_14 ]

    http://hal.inria.fr/hal-00726631
  • 16D. 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, p. 194-207, The original publication is available at www.springerlink.com. [ DOI : 10.1007/978-3-642-30885-7_14 ]

    http://hal.inria.fr/hal-00747269
  • 17A. 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, Mérida, Venezuela, Bolivarian Republic Of, N. Bjørner, A. Voronkov (editors), LNCS, Springer, 2012, vol. 7180, p. 197-211.

    http://hal.inria.fr/hal-00760398
  • 18P. Fontaine, S. Merz, C. Weidenbach.

    Combination of disjoint theories: beyond decidability, in: IJCAR - 6th International Joint Conference on Automated Reasoning - 2012, Manchester, United Kingdom, B. Gramlich, D. Miller, U. Sattler (editors), Lecture Notes in Computer Science, Springer, 2012, vol. 7364, p. 256-270, The original publication is available at www.springerlink.com. [ DOI : 10.1007/978-3-642-31365-3_21 ]

    http://hal.inria.fr/hal-00747271
  • 19S. Merz, H. Vanzetto.

    Automatic Verification Of TLA+Proof Obligations With SMT Solvers, in: 18th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-18), Mérida, Venezuela, Bolivarian Republic Of, N. Bjørner, A. Voronkov (editors), Lecture Notes in Computer Science, Springer, March 2012, vol. 7180, p. 289-303. [ DOI : 10.1007/978-3-642-28717-6_23 ]

    http://hal.inria.fr/hal-00760570
  • 20S. 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.

    http://hal.inria.fr/hal-00760579
  • 21D. Méry, N. K. Singh.

    Critical systems development methodology using formal techniques, in: 3rd International Symposium on Information and Communication Technology - SoICT 2012, Ha Long, Viet Nam, ACM, August 2012, p. 3-12. [ DOI : 10.1145/2350716.2350720 ]

    http://hal.inria.fr/hal-00747305

Conferences without Proceedings

  • 22D. Cousineau, D. Doligez, L. Lamport, S. Merz, D. Ricketts, H. Vanzetto.

    TLA+ Proofs, in: AI meets Formal Software Development, Dagstuhl, Germany, 2012, 16 p. p.

    http://hal.inria.fr/hal-00726632
  • 23T. Lu, S. Merz, C. Weidenbach.

    Formal Verification Of Pastry Using TLA+, in: International Workshop on the TLA+ Method and Tools, Paris, France, L. Lamport, S. Merz (editors), August 2012.

    http://hal.inria.fr/hal-00768812

Scientific Books (or Scientific Book chapters)

  • 24D. Méry, N. K. Singh.

    Formalization of Heart Models Based on the Conduction of Electrical Impulses and Cellular Automata, in: Foundations of Health Informatics Engineering and Systems, Z. Liu, A. Wassyng (editors), Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2012, vol. 7151, p. 140-159. [ DOI : 10.1007/978-3-642-32355-3_9 ]

    http://hal.inria.fr/hal-00762821
  • 25D. Méry, N. K. Singh.

    Medical Protocol Diagnosis Using Formal Methods, in: Foundations of Health Informatics Engineering and Systems, Z. Liu, A. Wassyng (editors), Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2012, vol. 7151, p. 1-20. [ DOI : 10.1007/978-3-642-32355-3_1 ]

    http://hal.inria.fr/hal-00762822

Books or Proceedings Editing

  • 26D. Giannakopoulou, D. Méry (editors)

    FM 2012: Formal Methods - 18th International Symposium, Paris, France, August 27-31, 2012. Proceedings, LNCS, Springer, August 2012, vol. 7436, 488 p.

    http://hal.inria.fr/hal-00743808

Internal Reports

Other Publications

  • 29M. Bromberger.

    Adapting the Simplex Algorithm for Superposition Modulo Linear Arithmetic, Universität des Saarlandes, Saarbrücken, 2012.

    http://hal.inria.fr/hal-00760395
References in notes
  • 30J.-R. Abrial.

    Modeling in Event-B: System and Software Engineering, Cambridge University Press, 2010.
  • 31E. 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, p. 84-99.
  • 32M. 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, p. 376-387.
  • 33L. Bachmair, H. Ganzinger.

    Rewrite-Based Equational Theorem Proving with Selection and Simplification, in: Journal of Logic and Computation, 1994, vol. 4, no 3, p. 217–247.
  • 34R. Back, J. von Wright.

    Refinement calculus—A systematic introduction, Springer Verlag, 1998.
  • 35C. Barrett, R. Sebastiani, S. A. Seshia, C. Tinelli.

    Satisfiability Modulo Theories, in: Handbook of Satisfiability, A. Biere, M. J. H. Heule, H. van Maaren, T. Walsh (editors), Frontiers in Artificial Intelligence and Applications, IOS Press, February 2009, vol. 185, chap. 26, p. 825-885.
  • 36M. 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, p. 9–18.
  • 37B. Charron-Bost, A. Schiper.

    The Heard-Of model: computing in distributed systems with benign faults, in: Distributed Computing, 2009, vol. 22, no 1, p. 49-71.
  • 38A. Eggers, E. Kruglov, S. Kupferschmid, K. Scheibler, T. Teige, C. Weidenbach.

    Superposition Modulo Non-linear Arithmetic, in: Frontiers of Combining Systems, 8th International Symposium, FroCoS 2011, Saarbrücken, Germany, October 5-7, 2011. Proceedings, C. Tinelli, V. Sofronie-Stokkermans (editors), Lecture Notes in Computer Science, Springer, 2011, vol. 6989, p. 119-134.
  • 39A. Fietzke, C. Weidenbach.

    Superposition as a decision procedure for timed automata, in: MACIS 2011: Fourth Intl. Conf. Mathematical Aspects of Computer and Information Sciences, S. Ratschan (editor), 2011, p. 52–62.
  • 40E. Kruglov, C. Weidenbach.

    SUP(T) decides first-order logic fragment over ground theories, in: MACIS 2011: Fourth Intl. Conf. Mathematical Aspects of Computer and Information Sciences, S. Ratschan (editor), 2011, p. 126–148.
  • 41L. Lamport.

    Specifying Systems, Addison-Wesley, Boston, Mass., 2002.
  • 42J.-Y. Le Boudec, P. Thiran.

    Network Calculus, Springer, 2001.
  • 43C. Morgan.

    Programming from Specifications, Prentice Hall, 1998, 2nd edition.
  • 44V. 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, p. 18-33.
  • 45V. 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, p. 47-71, Invited paper.


previous Previous | up Home