Team Veridis

Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography
PDF e-pub XML


Bibliography

Major publications by the team in recent years
[1]
T. Bouton, D. Caminha Barbosa 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.
[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, Berlin-Heidelberg, 2008, p. 47–152.
[3]
K. 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
[4]
F. Kröger, S. Merz.
Temporal Logic and State Systems, Texts in Theoretical Computer Science., Springer, 2008.
http://hal.inria.fr/inria-00274806/en/
[5]
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, Berlin-Heidelberg, 2008, p. 401–451.
Publications of the year

Doctoral Dissertations and Habilitation Theses

[6]
D. Caminha Barbosa De Oliveira.
Fragments de l'arithmétique dans une combinaison de procédures de décision, Université Nancy II, March 2011.
http://hal.inria.fr/tel-00578254/en
[7]
C. Rosa.
Performance and Correctness Assessment of Distributed Systems, Université Henri Poincaré Nancy I, October 2011.

International Conferences with Proceedings

[8]
C. Areces, P. Fontaine.
Combining theories: the Ackerman and Guarded Fragments, in: 8th International Symposium Frontiers of Combining Systems - FroCoS 2011, Saarbrücken, Germany, C. Tinelli, V. Sofronie-Stokkermans (editors), Lecture Notes in Computer Science, Springer Verlag, 2011, vol. 6989, p. 40–54. [ DOI : 10.1007/978-3-642-24364-6_4 ]
http://hal.inria.fr/hal-00642529/en
[9]
B. Charron-Bost, H. Debrat, S. Merz.
Formal Verification of Consensus Algorithms Tolerating Malicious Faults, in: 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2011), Grenoble, France, X. Défago, F. Petit, V. Villain (editors), Lecture Notes in Computer Science, Springer, October 2011, vol. 6976, p. 120-134. [ DOI : 10.1007/978-3-642-24550-3_11 ]
http://hal.inria.fr/hal-00639048/en
[10]
D. Déharbe, P. Fontaine, S. Merz, B. Woltzenlogel Paleo.
Exploiting Symmetry in SMT Problems, in: International Conference on Automated Deduction (CADE), Wroclaw, Poland, N. Bjørner, V. Sofronie-Stokkermans (editors), Lecture Notes in Computer Science, Springer, August 2011, vol. 6803, p. 222-236. [ DOI : 10.1007/978-3-642-22438-6_18 ]
http://hal.inria.fr/inria-00617843/en
[11]
P. Fontaine, S. Merz, B. Woltzenlogel Paleo.
Compression of Propositional Resolution Proofs via Partial Regularization, in: 23rd International Conference on Automated Deduction - CADE-23, Wroclaw, Poland, N. Bjørner, V. Sofronie-Stokkermans (editors), Lecture Notes in Computer Science, Springer, August 2011, vol. 6803, p. 237-251. [ DOI : 10.1007/978-3-642-22438-6_19 ]
http://hal.inria.fr/inria-00617846/en
[12]
S. Merz, T. Lu, C. Weidenbach.
Towards Verification of the Pastry Protocol using TLA+, in: 31st IFIP International Conference on Formal Techniques for Networked and Distributed Systems, Reykjavik, Iceland, R. Bruni, J. Dingel (editors), June 2011, vol. 6722.
http://hal.inria.fr/inria-00593523/en
[13]
S. Merz, M. Quinson, C. Rosa.
SimGrid MC: Verification Support for a Multi-API Simulation Platform, in: 31st IFIP International Conference on Formal Techniques for Networked and Distributed Systems, Reykjavik, Iceland, R. Bruni, J. Dingel (editors), Lecture Notes in Computer Science, Springer, June 2011, vol. 6722, p. 274-288, The original publication is available at www.springerlink.com. [ DOI : 10.1007/978-3-642-21461-5_18 ]
http://hal.inria.fr/inria-00593505/en
[14]
D. Méry, M. Mosbah, M. Tounsi.
Refinement-based Verification of Local Synchronization Algorithms, in: 17th International Symposium on Formal Methods, Limerick, Ireland, Lecture Notes in Computer Science, Springer, June 2011.
http://hal.inria.fr/hal-00579252/en
[15]
D. Méry, N. K. Singh.
Analysis of DSR Protocol in Event-B, in: 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2011), Grenoble, France, X. Défago, F. Petit, V. Villain (editors), Springer Berlin / Heidelberg, October 2011, vol. 6976, p. 401-415.
http://hal.inria.fr/inria-00637768/en
[16]
B. Woltzenlogel Paleo.
Atomic Cut Introduction by Resolution: Proof Structuring and Compression, in: Logic for Programming, Artificial Intelligence, and Reasoning, Dakar, Senegal, E. M. Clarke, A. Voronkov (editors), Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence, Springer, June 2011, vol. 6355, p. 463-480, The original publication is available at www.springerlink.com. [ DOI : 10.1007/978-3-642-17511-4_26 ]
http://hal.inria.fr/hal-00545473/en

Conferences without Proceedings

[17]
F. Besson, P. Fontaine, L. Théry.
A Flexible Proof Format for SMT: a Proposal, in: Workshop on Proof eXchange for Theorem Proving (PxTP), Wroclaw, Poland, August 2011.
http://hal.inria.fr/hal-00642544/en
[18]
D. Déharbe, P. Fontaine, B. Woltzenlogel Paleo.
Quantifier Inference Rules for SMT proofs, in: Workshop on Proof eXchange for Theorem Proving (PxTP), Wroclaw, Poland, 2011.
http://hal.inria.fr/hal-00642535/en
[19]
S. Merz, H. Vanzetto.
Towards certification of TLA+ proof obligations with SMT solvers, in: Workshop on Proof eXchange for Theorem Proving - PxTP 2011, Wroclaw, Poland, P. Fontaine, A. Stump (editors), July 2011.
http://hal.inria.fr/hal-00645458/en

Internal Reports

[20]
M. B. Andriamiarina, D. Méry.
Stepwise development of distributed vertex coloring algorithms, LORIA, July 2011.
http://hal.inria.fr/inria-00606254/en
References in notes
[21]
J.-R. Abrial.
Modeling in Event-B: System and Software Engineering, Cambridge University Press, 2010.
[22]
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, p. 376-387.
[23]
R. Back, J. von Wright.
Refinement calculus—A systematic introduction, Springer Verlag, 1998.
[24]
C. 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.
[25]
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, p. 9–18.
[26]
B. 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.
[27]
L. Doyen, J.-F. Raskin.
Antichain Algorithms for Finite Automata, in: 16th Intl. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2010), Paphos, Cyprus, J. Esparza, R. Majumdar (editors), Lecture Notes in Computer Science, Springer, 2010, vol. 6015, p. 2-22.
[28]
L. Lamport.
Specifying Systems, Addison-Wesley, Boston, Mass., 2002.
[29]
L. Lamport.
The PlusCal Algorithm Language, in: 6th Intl. Coll. Theoretical Aspects of Computing (ICTAC 2009), Kuala Lumpur, Malaysia, M. Leucker, C. Morgan (editors), Lecture Notes in Computer Science, Springer, 2009, vol. 5684, p. 36-60.
[30]
G. Li, R. Palmer, M. Delisi, G. Gopalakrishnan, R. M. Kirby.
Formal specification of MPI 2.0: Case study in specifying a practical concurrent programming API, in: Sci. Comput. Program., 2011, vol. 76, no 2, p. 65-81.
[31]
C. Morgan.
Programming from Specifications, Prentice Hall, 1998, 2nd edition.
[32]
Y. Métivier, J. Robson, N. Saheb-Djahromi, A. Zemmari.
An Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm, in: 13th Intl. Conf. Principles of Distributed Systems (OPODIS 2009), Nîmes, France, T. F. Abdelzaher, M. Raynal, N. Santoro (editors), LNCS, Springer, 2009, vol. 5923, p. 359-364.
[33]
B. Parno, J. R. Lorch, J. R. Douceur, J. W. Mickens, J. M. McCune.
Memoir: Practical State Continuity for Protected Modules, in: IEEE Symposium on Security and Privacy, Berkely, CA, USA, IEEE Computer Society, 2011, p. 379-394.