From First-order Temporal Logic to Parametric Trace Slicing Giles Reger and David Rydeheard University of Manchester, Manchester, UK Abstract. Parametric runtime verification is the process of verifying properties of ex

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

• Temporal logic
• Formal languages
• Logic
• Metalogic
• Mathematical logic
• Linear temporal logic
• Mathematics
• Model theory
• Symbol
• Computation tree logic
• Interpretation
• Well-formed formula

Considering Typestate Verification for Quantified Event Automata Giles Reger University of Manchester, Manchester, UK Abstract. This paper discusses how the existing static analyses developed for

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

• Program analysis
• Typestate analysis
• Mathematical logic
• Logic
• Mathematics
• Runtime verification
• Quantifier
• Type system
• Sheaf

Suggesting Edits to Explain Failing Traces Giles Reger University of Manchester, UK Abstract. Runtime verification involves checking whether an execution trace produced by a running system satisfies a specification. Howe

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

• Mathematics
• Algebra
• Theoretical computer science
• Finite automata
• Linear algebra
• Finite-state transducer
• Dynamic programming
• Edit distance
• Trace
• Finite-state machine
• Shortest path problem
• Levenshtein distance

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

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 the Point of an SMT-LIB Problem? ∗ Giles Reger and Martin Riener University of Manchester, Manchester, UK

Source URL: www.logic.at

• Theoretical computer science
• Mathematical logic
• Mathematics
• Formal methods
• Automated theorem proving
• Logic in computer science
• School of Computer Science
• University of Manchester
• Constraint programming
• Satisfiability modulo theories
• Solver
• Logic programming
• Resolution

A Pattern-Based Approach to Parametric Specification Mining Giles Reger , Howard Barringer, David Rydeheard University of Manchester Abstract—This paper presents a technique for using execution

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

• Theoretical computer science
• Formal languages
• Logic in computer science
• Runtime verification
• Finite-state machine
• Geographic information system
• Regular expression
• Software engineering
• Computing