Making Automatic Theorem Provers more Versatile Simon Cruanes Veridis, Inria Nancy https://cedeela.fr/~simon/ August 2017

Source URL: www.cs.man.ac.uk

• Theoretical computer science
• Formal methods
• Mathematical logic
• Logic in computer science
• Mathematics
• Constraint programming
• Automated theorem proving
• Satisfiability modulo theories
• Formal verification
• Type theory
• First-order logic
• Vampire

To: Eijun Linda Ruth Cutts, Central Abbess Rinso Ed Sattizhan, Abiding Abbott, City Center Furyu Nancy Schroeder, Abiding Abbess, Green Gulch Farm Abbots Executive Group of Zen Center October 3, 2018.

Source URL: www.peacefulseasangha.com

• Zen
• Buddhism
• Indian religions
• San Francisco Zen Center
• Zen centers
• Soto Zen
• Green Gulch Farm Zen Center
• Reb Anderson
• Japanese Zen

Scalable Fine-Grained Proofs for Formula Processing Haniel Barbosa1,2(B) , Jasmin Christian Blanchette3,1,4 , and Pascal Fontaine1 1 Université de Lorraine, CNRS, Inria, LORIA, Nancy, France

Source URL: pxtp.github.io

• Mathematical logic
• Logic
• Mathematics
• Predicate logic
• Computability theory
• Models of computation
• First-order logic
• Lambda calculus
• Term
• Quantifier
• Natural deduction
• CurryHoward correspondence

A New Family of Pairing-Friendly Elliptic Curves Michael Scott and Aurore Guillevic MIRACL.com Université de Lorraine, CNRS, Inria, LORIA, Nancy, France WAIFI 2018, Bergen, Norway, June 14–16

Source URL: caramba.inria.fr

• Geometry
• Mathematics
• Space
• Analytic number theory
• Elliptic curve
• Group theory
• Curve

Integrating a SAT Solver with Isabelle/HOL Tjark Weber (joint work with Alwen Tiu et al.) First Munich-Nancy Workshop on

Source URL: user.it.uu.se

DASH: Modelling and Analysis of Declarative State-Based Transition Systems Work in Progress (*) Jose Serna, Nancy A. Day, and Shahram Esmaeilsabzali With past contributions by Sabria Farheen

Source URL: alloytools.org

• Models of computation
• Intel
• Scientific modelling
• Dash
• Transition system
• Epistemology
• Philosophy of science
• Writing

Making Automatic Theorem Provers more Versatile Simon Cruanes University of Lorraine, CNRS, Inria, LORIA, 54000 Nancy, France Abstract We argue that automatic theorem provers should become more versatile and should be ab

Source URL: www.cs.man.ac.uk

• Theoretical computer science
• Software engineering
• Mathematical software
• Formal methods
• Logic in computer science
• Proof assistants
• Automated theorem proving
• Automated reasoning
• Satisfiability modulo theories
• E theorem prover
• ACL2
• Isabelle

PDF Document

Source URL: www.nancy.archi.fr

PDF Document

Source URL: www.nancy.archi.fr

PDF Document

Source URL: www.nancy.archi.fr