PHOG: Probabilistic Model for Code Pavol Bielik, Veselin Raychev, Martin Vechev Software Reliability Lab Department of Computer Science ETH Zurich

Source URL: files.sri.inf.ethz.ch

• Async/await
• Control flow
• Stan
• Symposium on Principles of Programming Languages
• Phog
• Machine learning
• Futures and promises
• PL
• Probability and statistics
• Computing
• Software engineering

Instantiation and Pretending to be an SMT Solver with VAMPIRE ∗ Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,3,4 1 3

Source URL: smt-workshop.cs.uiowa.edu

• Theoretical computer science
• Mathematical logic
• Logic
• Automated theorem proving
• Logic in computer science
• Formal methods
• Logic programming
• Predicate logic
• Satisfiability modulo theories
• Unification
• Solver
• Resolution

Testing a Saturation-Based Theorem Prover: Experiences and Challenges Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,2 1 School of Computer Science, University of Manchester, UK

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

• Theoretical computer science
• Formal methods
• Mathematical logic
• School of Computer Science
• University of Manchester
• Mathematics
• Logic in computer science
• Automated theorem proving
• Formal verification
• SPASS
• Andrei Voronkov
• Vampire
• First-order logic

Finding Inconsistencies in Programs with Loops? Temesghen Kahsai1 , Jorge A. Navas2 , Dejan Jovanovi´c3 , Martin Sch¨af3 1 2

Source URL: csl.sri.com

• Software engineering
• Programming language theory
• Computing
• Logic in computer science
• Horn clause
• Control flow
• ALGOL 68
• Formal methods
• Logic programming

Verified Computations Using Taylor Models and Their Applications Kyoko Makino and Martin Berz Department of Physics and Astronomy Michigan State University

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

• Latin script
• Character encoding
• Digital typography
• Circumflex
• Writing
• Notation
• French Braille
• World glyph set

A Trusted Mechanised JavaScript Specification Martin Bodin Arthur Charguéraud Daniele Filaretti

Source URL: www.doc.ic.ac.uk

Published as a conference paper at ICLRP ROGRAM S YNTHESIS FOR C HARACTER L EVEL L ANGUAGE M ODELING Pavol Bielik, Veselin Raychev & Martin Vechev Department of Computer Science, ETH Z¨urich, Switzerland

Source URL: files.sri.inf.ethz.ch

• Artificial neural networks
• Computational neuroscience
• Machine learning
• Artificial intelligence
• Applied mathematics
• Computational linguistics
• Natural language processing
• Speech recognition
• Convolutional neural network
• Language model
• Long short-term memory
• Neural network

Testing a Saturation-Based Theorem Prover: Experiences and Challenges? Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,3,4 1 3

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

• Theoretical computer science
• Formal methods
• Mathematics
• Logic in computer science
• Mathematical logic
• Automated theorem proving
• School of Computer Science
• University of Manchester
• Automated reasoning
• Formal verification
• E theorem prover
• IP
• Satisfiability modulo theories

PSI: Exact Symbolic Inference for Probabilistic Programs Timon Gehr1 , Sasa Misailovic1,2 , and Martin Vechev1 1 2

Source URL: files.sri.inf.ethz.ch

• Mathematical analysis
• Probability theory
• Statistical theory
• Graphical models
• Normal distribution
• Infinitely divisible probability distributions
• Bayesian statistics
• Bayesian network
• Substitution
• Variational Bayesian methods
• Exponential family
• Dirac delta function

Advanced Proof Viewing in P ROOF T OOL Tomer Libal Martin Riener∗ Mikheil Rukhaia†

Source URL: www.logic.at

• Proof theory
• Mathematical logic
• Logic
• Mathematics
• Sequent calculus
• Sequent
• Mathematical proof
• Cut-elimination theorem
• Formal proof
• Proof complexity
• Theorem
• Metamath