A Story of Parametric Trace Slicing, Garbage and Static Analysis Giles Reger School of Computer Science, University of Manchester, UK PrePost 2017

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

• I1
• Garbage collection

A Pattern-Based Approach to Parametric Specification Mining Giles Reger, Howard Barringer, and David Rydeheard University of Manchester, UK Abstract. This paper presents a technique for mining parametric temporal specifi

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

• Logic
• Symbol
• Substitution
• Mathematical logic
• Finite automata

Specification of Parametric Monitors Quantified Event Automata versus Rule Systems Klaus Havelund1? and Giles Reger2 1 Jet Propulsion Laboratory, California Inst. of Technology, USA

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

• Software engineering
• Computing
• Programming language theory
• Procedural programming languages
• Programming languages
• Logic in computer science
• Runtime verification
• Cross-platform software
• Program slicing
• Model checking
• L-system
• Trace

Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

Source URL: isabelle.in.tum.de

• Mathematics
• Order theory
• Algebra
• Abstract algebra
• Lattice theory
• Mathematical logic
• Algebraic structures
• Predicate logic
• Distributive lattice
• Complete Heyting algebra
• Mereology
• Partially ordered set

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

Minimizing Expected Losses in Perturbation Models with Multidimensional Parametric Min-cuts Adrian Kim, Kyomin Jung Seoul National University Seoul, South Korea

Source URL: www.cs.toronto.edu

• Estimation theory
• Econometrics
• Statistical inference
• M-estimators
• Loss function
• Maximum likelihood estimation
• Confidence interval

Parametric Higher-Order Abstract Syntax for Mechanized Semantics Adam Chlipala Harvard University

Source URL: adam.chlipala.net

• Computer programming
• Declarative programming
• Software engineering
• Exponentials
• Dependently typed programming
• Higher-order abstract syntax
• Logic programming
• Programming language theory
• Type theory
• Exponentiation
• Monad
• ?:

Designing Robust Software Systems through Parametric Markov Chain Synthesis ˇ ska† , Simos Gerasimou∗ , Marta Kwiatkowska‡ and Nicola Paoletti§ Radu Calinescu∗ , Milan Ceˇ ∗ Department of Computer Science, U

Source URL: qav.comlab.ox.ac.uk

Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

Source URL: mirror.clarkson.edu

• Mathematics
• Order theory
• Algebra
• Abstract algebra
• Lattice theory
• Mathematical logic
• Algebraic structures
• Predicate logic
• Distributive lattice
• Complete Heyting algebra
• Mereology
• Partially ordered set

Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

Source URL: www.cl.cam.ac.uk

• Mathematics
• Order theory
• Algebra
• Abstract algebra
• Lattice theory
• Mathematical logic
• Algebraic structures
• Predicate logic
• Distributive lattice
• Complete Heyting algebra
• Mereology
• Partially ordered set