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

A Tutorial on Runtime Verification Yli`es FALCONE a , Klaus HAVELUND b,1 and Giles REGER c,2 a University of Grenoble I (UJF), Laboratoire d’Informatique de Grenoble, France b Jet Propulsion Laboratory, California Inst

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

• Software development
• Aspect-oriented software development
• Aspect-oriented programming
• Formal methods
• Logic in computer science
• Runtime verification
• Pointcut
• Formal verification
• Join point
• Instrumentation

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

Instantiation for Theory Reasoning in Vampire Giles Reger Martin Riener

Source URL: www.logic.at

• Mathematical logic
• Logic
• Mathematics
• Axioms of set theory
• 1Q
• Axiom

Revisiting Question Answering in Vampire Giles Reger School of Computer Science, University of Manchester, UK The 4th Vampire Workshop

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

• Automated theorem proving
• Resolution
• IP
• X0
• Vampire
• Mathematics
• Propositional calculus
• Logic

Playing with AVATAR Giles Reger, Martin Suda and Andrei Voronkov ? University of Manchester, Manchester, UK Abstract. Modern first-order resolution and superposition theorem provers use saturation algorithms to search fo

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

• Theoretical computer science
• Automated theorem proving
• Mathematics
• Mathematical logic
• Formal methods
• Logic in computer science
• Resolution
• Logic programming
• Clause
• Vampire
• Boolean satisfiability problem
• CARINE

An Overview of M AR Q Giles Reger University of Manchester, Manchester, UK Abstract. MarQ is a runtime monitoring tool for specifications written as quantified event automata, an expressive automata-based specification l

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

M AR Q: Monitoring At Runtime with QEA Giles Reger, Helena Cuenca Cruz and David Rydeheard University of Manchester Abstract. Runtime monitoring is the process of checking whether an execution trace of a running system s

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

• Mathematical logic
• Logic
• Theoretical computer science
• Logic in computer science
• Runtime verification
• FO
• Quantifier

What is a Trace? A Runtime Verification Perspective Giles Reger1? and Klaus Havelund2?? 1 2

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

• Computing
• Open formats
• Markup languages
• Formal methods
• Debugging
• Logic in computer science
• Runtime verification
• Tracing
• Comma-separated values
• Exception handling
• Database
• Data logger

Runtime Verification Logics A Language Design Perspective Klaus Havelund1? and Giles Reger2?? 1 Jet Propulsion Laboratory, California Inst. of Technology, USA

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

• Theoretical computer science
• Mathematics
• Formal methods
• Logic in computer science
• Models of computation
• Temporal logic
• Runtime verification
• Formal verification
• Model checking
• Linear temporal logic
• Finite-state machine
• FO