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, pp. 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, 2008, pp. 47-152.
• 3D. 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.
• 4A. Dolzmann, T. Sturm.
  
  Redlog: Computer algebra meets computer logic, in: ACM SIGSAM Bull., 1997, vol. 31, n^o 2, pp. 2-9.
• 5D. 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.
• 6A. Fietzke, C. Weidenbach.
  
  Superposition as a Decision Procedure for Timed Automata, in: Mathematics in Computer Science, 2012, vol. 6, n^o 4, pp. 409-425.
• 7E. Kruglov, C. Weidenbach.
  
  Superposition Decides the First-Order Logic Fragment Over Ground Theories, in: Mathematics in Computer Science, 2012, vol. 6, n^o 4, pp. 427-456.
• 8F. 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/
• 9S. 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.
• 10C. 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

• 11M. Bromberger.
  
  Decision Procedures for Linear Arithmetic, Saarland University, December 2019.
  
  https://hal.inria.fr/tel-02427371
• 12N. Schnepf.
  
  Orchestration and verification of security functions for smart devices, Université de Lorraine, September 2019.
  
  https://hal.univ-lorraine.fr/tel-02351769
• 13M. Voigt.
  
  Decidable Fragments of First-Order Logic and of First-Order Linear Arithmetic with Uninterpreted Predicates, Universität des Saarlandes, July 2019.
  
  https://hal.inria.fr/tel-02406821

Articles in International Peer-Reviewed Journals

• 14A. Bentkamp, J. C. Blanchette, D. Klakow.
  
  A Formal Proof of the Expressiveness of Deep Learning, in: Journal of Automated Reasoning, August 2019, vol. 63, n^o 2, pp. 347-368. [ DOI : 10.1007/s10817-018-9481-5 ]
  
  https://hal.inria.fr/hal-02296014
• 15J. C. Blanchette, L. Gheri, A. Popescu, D. Traytel.
  
  Bindings as Bounded Natural Functors, in: Proceedings of the ACM on Programming Languages, January 2019, vol. 3, n^o POPL, pp. 1-34. [ DOI : 10.1145/3290335 ]
  
  https://hal.archives-ouvertes.fr/hal-01989726
• 16J. C. Blanchette, S. Merz.
  
  Selected Extended Papers of ITP 2016: Preface, in: Journal of Automated Reasoning, February 2019, vol. 62, n^o 2, pp. 169-170. [ DOI : 10.1007/s10817-018-9470-8 ]
  
  https://hal.inria.fr/hal-02395177
• 17R. Bradford, J. H. Davenport, M. England, H. Errami, V. Gerdt, D. Grigoriev, C. Hoyt, M. Košta, O. Radulescu, T. Sturm, A. Weber.
  
  Identifying the parametric occurrence of multiple steady states for some biological networks, in: Journal of Symbolic Computation, May 2020, vol. 98, pp. 84-119. [ DOI : 10.1016/j.jsc.2019.07.008 ]
  
  https://hal.inria.fr/hal-02397154
• 18M. Bromberger, T. Sturm, C. Weidenbach.
  
  A complete and terminating approach to linear integer solving, in: Journal of Symbolic Computation, July 2019, forthcoming. [ DOI : 10.1016/j.jsc.2019.07.021 ]
  
  https://hal.inria.fr/hal-02397168
• 19P. Chocron, P. Fontaine, C. Ringeissen.
  
  Politeness and Combination Methods for Theories with Bridging Functions, in: Journal of Automated Reasoning, 2019, forthcoming. [ DOI : 10.1007/s10817-019-09512-4 ]
  
  https://hal.inria.fr/hal-01988452
• 20I. 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, pp. 3-41. [ DOI : 10.1016/j.jsc.2018.04.002 ]
  
  https://hal.archives-ouvertes.fr/hal-01590654
• 21I. Konnov.
  
  Handbook of Model Checking by Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, and Roderick Bloem (eds), published by Springer International Publishing AG, Cham, Switzerland, 2018, in: Formal Aspects of Computing, 2019, pp. 455-456. [ DOI : 10.1007/s00165-019-00486-z ]
  
  https://hal.inria.fr/hal-02398334
• 22I. Konnov, J. Kukovec, T.-H. Tran.
  
  TLA+ Model Checking Made Symbolic, in: Proceedings of the ACM on Programming Languages, 2019, vol. 3, n^o OOPSLA, pp. 123:1–123:30. [ DOI : 10.1145/3360549 ]
  
  https://hal.archives-ouvertes.fr/hal-02280888
• 23M. Romero, M. Duflot, T. Viéville.
  
  The robot game : analysis of a computational thinking unplugged activity under the perspective of embodied cognition, in: Review of science, mathematics and ICT education, June 2019, vol. 13, n^o 1. [ DOI : 10.26220/rev.3089 ]
  
  https://hal.inria.fr/hal-02144467
• 24N. Schnepf, R. Badonnel, A. Lahmadi, S. Merz.
  
  Rule-Based Synthesis of Chains of Security Functions for Software-Defined Networks, in: Electronic Communications of the EASST, 2019, vol. 076.
  
  https://hal.inria.fr/hal-02397981

Articles in Non Peer-Reviewed Journals

• 25J. H. Davenport, M. England, A. Griggio, T. Sturm, C. Tinelli.
  
  Symbolic computation and satisfiability checking, in: Journal of Symbolic Computation, July 2019, Invited Editorial, forthcoming. [ DOI : 10.1016/j.jsc.2019.07.017 ]
  
  https://hal.inria.fr/hal-02397190

Invited Conferences

• 26D. Méry.
  
  Verification by Construction of Distributed Algorithms, in: Theoretical Aspects of Computing - ICTAC 2019 - 16th International Colloquium, Mammamet, Tunisia, R. M. Hierons, M. Mosbah (editors), Theoretical Aspects of Computing - ICTAC 2019 - 16th International Colloquium, Hammamet, Tunisia, October 31 - November 4, 2019, Proceedings, Springer, October 2019, n^o 11884, pp. 22-38. [ DOI : 10.1007/978-3-030-32505-3_2 ]
  
  https://hal.inria.fr/hal-02400379

International Conferences with Proceedings

• 27H. Barbosa, A. Reynolds, D. El Ouraoui, C. Tinelli, C. Barrett.
  
  Extending SMT Solvers to Higher-Order Logic, in: CADE-27, Natal, Brazil, Lecture Notes in Computer Science, Springer, August 2019, vol. 11716, pp. 35-54. [ DOI : 10.1007/978-3-030-29436-6_3 ]
  
  https://hal.archives-ouvertes.fr/hal-02300986
• 28A. Bentkamp, J. C. Blanchette, S. Tourret, P. Vukmirović, U. Waldmann.
  
  Superposition with Lambdas, in: CADE-27, Natal, Brazil, August 2019, pp. 55-73. [ DOI : 10.1007/978-3-030-29436-6_4 ]
  
  https://hal.inria.fr/hal-02296038
• 29N. Bertrand, I. Konnov, M. Lazic, J. Widder.
  
  Verification of Randomized Consensus Algorithms under Round-Rigid Adversaries, in: CONCUR 2019 - 30th International Conference on Concurrency Theory, Amsterdam, Netherlands, August 2019, pp. 1-16. [ DOI : 10.4230/LIPIcs.CONCUR.2019.33 ]
  
  https://hal.inria.fr/hal-02191348
• 30J. 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, 2019. [ DOI : 10.1145/3293880.3294087 ]
  
  https://hal.archives-ouvertes.fr/hal-01937136
• 32G. Busana, B. Denis, M. Duflot, S. Higuet, L. Kataja, Y. Kreis, C. Laduron, C. Meyers, Y. Parmentier, R. Reuter, A. Weinberger.
  
  PIAF : développer la Pensée Informatique et Algorithmique dans l'enseignement Fondamental, in: Didapro 8 - DIDASTIC - L’informatique, objets d’enseignements – enjeux épistémologiques, didactiques et de formation, Lille, France, Actes du 8e colloque international francophone sur la didactique de l'informatique (Didapro 8 - DIDASTIC), 2020, Session poster.
  
  https://hal.archives-ouvertes.fr/hal-02424418
• 33R. Chen, C. Cohen, J.-J. Levy, S. Merz, L. Théry.
  
  Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle, in: ITP 2019 - 10th International Conference on Interactive Theorem Proving, Portland, United States, J. Harrison, J. O'Leary, A. Tolmach (editors), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2019, vol. 141, pp. 13:1 - 13:19. [ DOI : 10.4230/LIPIcs.ITP.2019.13 ]
  
  https://hal.inria.fr/hal-02303987
• 34M. Duroeulx, N. Brinzei, M. Duflot, S. Merz.
  
  Integrating satisfiability solving in the assessment of system reliability modeled by dynamic fault trees, in: 29th European Safety and Reliability Conference, ESREL 2019, Hannover, Germany, Research Publishing Services, September 2019. [ DOI : 10.3850/981-973-0000-00-0 ]
  
  https://hal.inria.fr/hal-02262205
• 35A. Fiori, C. Weidenbach.
  
  SCL: Clause Learning from Simple Models, in: 27th International Conference on Automated Deduction, Natal, Brazil, P. Fontaine (editor), Lecture Notes in Computer Science, 2019, vol. 11716, pp. 233-249. [ DOI : 10.1007/978-3-030-29436-6_14 ]
  
  https://hal.inria.fr/hal-02405550
• 36M. Fleury, H.-J. Schurr.
  
  Reconstructing veriT Proofs in Isabelle/HOL, in: PxTP 2019 - Sixth Workshop on Proof eXchange for Theorem Proving, Natal, Brazil, August 2019, vol. 301, pp. 36-50, https://arxiv.org/abs/1908.09480. [ DOI : 10.4204/EPTCS.301.6 ]
  
  https://hal.inria.fr/hal-02276530
• 37A. 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
• 38N. Schnepf, R. Badonnel, A. Lahmadi, S. Merz.
  
  A Tool Suite for the Automated Synthesis of Security Function Chains, in: IFIP/IEEE IM 2019 - IFIP/IEEE International Symposium on Integrated Network Management, Washington, United States, April 2019.
  
  https://hal.inria.fr/hal-02111658
• 39N. Schnepf, R. Badonnel, A. Lahmadi, S. Merz.
  
  Automated Factorization of Security Chains in Software-Defined Networks, in: IFIP/IEEE IM 2019 - IFIP/IEEE International Symposium on Integrated Network Management, Washington, United States, April 2019.
  
  https://hal.inria.fr/hal-02111656
• 40I. Stoilkovska, I. Konnov, J. Widder, F. Zuleger.
  
  Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking, in: TACAS 2019 - International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Prague, Czech Republic, April 2019. [ DOI : 10.1007/978-3-030-17465-1_20 ]
  
  https://hal.inria.fr/hal-01925653
• 41A. Teucke, M. Voigt, C. Weidenbach.
  
  On the Expressivity and Applicability of Model Representation Formalisms, in: 12th International Symposium on Frontiers of Combining Systems (FroCoS 2019), London, United Kingdom, A. Herzig, A. Popescu (editors), Lecture Notes in Computer Science, Springer, 2019, vol. 11715, pp. 22-39. [ DOI : 10.1007/978-3-030-29007-8_2 ]
  
  https://hal.inria.fr/hal-02406605
• 42P. Vukmirović, J. C. Blanchette, S. Cruanes, S. Schulz.
  
  Extending a Brainiac Prover to Lambda-Free Higher-Order Logic, in: TACAS 2019 - 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Prague, Czech Republic, April 2019, pp. 192-210.
  
  https://hal.inria.fr/hal-02178274
• 43P. Vukmirović, J. C. Blanchette, S. Cruanes, S. Schulz.
  
  Faster, Higher, Stronger: E 2.3, in: TACAS 2019, Prague, Czech Republic, LNAI, August 2019, vol. 11716, pp. 495-507. [ DOI : 10.1007/978-3-030-29436-6_29 ]
  
  https://hal.inria.fr/hal-02296188
• 44C. Weidenbach.
  
  The Challenge of Unifying Semantic and Syntactic Inference Restrictions, in: 2nd International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements (ARCADE 2019), Natal, Brazil, Electronic Proceedings in Theoretical Computer Science, 2019.
  
  https://hal.inria.fr/hal-02406673

National Conferences with Proceedings

• 45P. Lermusiaux, H. Cirstea, P.-E. Moreau.
  
  Pattern eliminating transformations, in: CIEL 2019 - 8ème Conférence en IngénieriE du Logiciel, Toulouse, France, June 2019.
  
  https://hal.inria.fr/hal-02186325

Conferences without Proceedings

• 46H. Barbosa, J. C. Blanchette, M. Fleury, P. Fontaine, H.-J. Schurr.
  
  Better SMT Proofs for Easier Reconstruction, in: Conference on Artificial Intelligence and Theorem Proving (AITP 2019), Obergurgl, Austria, April 2019.
  
  https://hal.archives-ouvertes.fr/hal-02381819
• 47J. C. Blanchette, D. E. Ouraoui, P. Fontaine, C. Kaliszyk.
  
  Machine Learning for Instance Selection in SMT Solving, in: Conference on Artificial Intelligence and Theorem Proving (AITP 2019), Obergurgl, Austria, April 2019.
  
  https://hal.archives-ouvertes.fr/hal-02381430

Scientific Books (or Scientific Book chapters)

• 48P. Baumgartner, U. Waldmann.
  
  Hierarchic Superposition Revisited, in: Description Logic, Theory Combination, and All That - Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday, C. Lutz, U. Sattler, C. Tinelli, A.-Y. Turhan, F. Wolter (editors), Lecture Notes in Computer Science, Springer, 2019, vol. 11560, pp. 15-56. [ DOI : 10.1007/978-3-030-22102-7_2 ]
  
  https://hal.inria.fr/hal-02402941
• 49M. P. Bonacina, P. Fontaine, C. Ringeissen, C. Tinelli.
  
  Theory Combination: Beyond Equality Sharing, in: Description Logic, Theory Combination, and All That - Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday, C. Lutz, U. Sattler, C. Tinelli, A.-Y. Turhan, F. Wolter (editors), Theoretical Computer Science and General Issues, Springer, June 2019, vol. 11560, pp. 57-89.
  
  https://hal.inria.fr/hal-02194001
• 50S. Merz.
  
  Formal specification and verification, in: Concurrency: the Works of Leslie Lamport, D. Malkhi (editor), ACM Books, Association for Computing Machinery, 2019, vol. 29, pp. 103-129. [ DOI : 10.1145/3335772.3335780 ]
  
  https://hal.inria.fr/hal-02387780

Books or Proceedings Editing

• 51P. Fontaine (editor)
  
  Automated Deduction – CADE-27 : 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings, Lecture Notes in Artificial Intelligence, Springer, Natal, Brazil, 2019, vol. 11716, forthcoming.
  
  https://hal.inria.fr/hal-02194007
• 52D. Méry, S. Qin (editors)
  
  2019 International Symposium on Theoretical Aspects of Software Engineering (TASE), IEEE, Guillin, China, November 2019.
  
  https://hal.inria.fr/hal-02400510

Other Publications

• 53N. Bertrand, I. Konnov, M. Lazic, J. Widder.
  
  Verification of Randomized Distributed Algorithms under Round-Rigid Adversaries, April 2019, 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
• 54D. Grigoriev, A. Iosif, H. Rahkooy, T. Sturm, A. Weber.
  
  Efficiently and Effectively Recognizing Toricity of Steady State Varieties, December 2019, https://arxiv.org/abs/1910.04100 - working paper or preprint. [ DOI : 10.04100 ]
  
  https://hal.inria.fr/hal-02397107

References in notes

• 55J.-R. Abrial.
  
  Modeling in Event-B: System and Software Engineering, Cambridge University Press, 2010.
• 56L. Bachmair, H. Ganzinger.
  
  Rewrite-Based Equational Theorem Proving with Selection and Simplification, in: Journal of Logic and Computation, 1994, vol. 4, n^o 3, pp. 217–247.
• 57R. Back, J. von Wright.
  
  Refinement calculus—A systematic introduction, Springer Verlag, 1998.
• 58C. 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.
• 59P. 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
• 60P. 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
• 61M. J. Fischer, N. A. Lynch, M. S. Paterson.
  
  Impossibility of Distributed Consensus with one Faulty Process, in: J. ACM, 1985, vol. 32, n^o 2, pp. 374–382.
• 62I. 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.
• 63I. 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
• 64J. 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
• 65J. 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
• 66L. Lamport.
  
  Specifying Systems, Addison-Wesley, Boston, Mass., 2002.
• 67N. Le Novere, B. Bornstein, A. Broicher, M. Courtot, M. Donizelli, H. Dharuri, L. Li, H. Sauro, M. Schilstra, B. Shapiro, J. L. Snoep, M. Hucka.
  
  BioModels Database: a free, centralized database of curated, published, quantitative kinetic models of biochemical and cellular systems, in: Nucleic Acids Research, 2006, vol. 34, n^o suppl 1, pp. D689-D691.
  
  https://doi.org/10.1093/nar/gkj092
• 68E. W. Mayr, A. R. Meyer.
  
  The complexity of the word problems for commutative semigroups and polynomial ideals, in: Advances in Mathematics, 1982, vol. 46, n^o 3, pp. 305-329.
  
  https://doi.org/10.1016/0001-8708(82)90048-2
• 69S. 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
• 70C. Morgan.
  
  Programming from Specifications, Prentice Hall, 1998, 2nd edition.
• 71Y. J. Song, R. van Renesse.
  
  Bosco: One-Step Byzantine Asynchronous Consensus, in: DISC, LNCS, 2008, vol. 5218, pp. 438–450.
• 72C. Weidenbach.
  
  Towards an Automatic Analysis of Security Protocols in First-Order Logic, in: 16th International Conference on Automated Deduction (CADE-16), Trento, Italy, H. Ganzinger (editor), Lecture Notes in Computer Science, Springer, 1999, vol. 1632, pp. 314-328.