Lipschitz Robustness of Finite-state Transducers Thomas A. Henzinger, Jan Otop, Roopsha Samanta IST Austria Abstract We investigate the problem of checking if a finite-state transducer is robust to uncertainty in

Source URL: www.cs.purdue.edu

• Finite automata
• Abstract algebra
• Algebra
• Finite-state transducer
• Mathematics
• Theoretical computer science
• Finite-state machine
• Semigroup action
• Kazhdan's property
• Tree transducer

Executable Counterexamples in Software Model Checking J. Gennari1 and A. Gurfinkel2 and T. Kahsai3 and J. A. Navas4 and E. J. Schwartz1 Presenter: Natarajan Shankar4 1 Carnegie

Source URL: seahorn.github.io

• Computing
• Computer programming
• C
• Data types
• Pointer
• Hooking
• Exec
• Nm
• Struct

Increasing Usability of Spin-based C Code Verification Using a Harness Definition Language Leveraging Model-driven Code Checking to Practitioners Daniel Ratiu Andreas Ulrich

Source URL: mbeddr.com

• Model checkers
• Computing
• Theoretical computer science
• Software engineering
• Formal methods
• Promela
• SPIN model checker
• Model checking
• Guard
• Certificate
• Formal verification
• Printf format string

Stochastic Model Checking? Marta Kwiatkowska, Gethin Norman, and David Parker School of Computer Science, University of Birmingham Edgbaston, Birmingham B15 2TT, United Kingdom Abstract. This tutorial presents an overvi

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

• Mathematics
• Temporal logic
• Mathematical analysis
• Mathematical logic
• Formal languages
• Model theory
• Generalized functions
• Computation tree logic
• Logic in computer science
• Linear temporal logic
• Interpretation
• IP

Unbounded Model-Checking with Interpolation for Regular Language Constraints Graeme Gange, Jorge A. Navas, Peter J. Stuckey, Harald Søndergaard, and Peter Schachte The University of Melbourne {ggange,jnavas,pjs,harald,s

Source URL: jorgenavas.github.io

• Finite automata
• DFA minimization
• Deterministic automaton
• Finite-state machine
• Theoretical computer science
• Muller automaton
• Bchi automaton

Model Checking and Strategy Synthesis for Stochastic Games: From Theory to Practice∗ Marta Kwiatkowska University of Oxford

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

• Linear temporal logic
• Temporal logic
• Symbol
• Stochastic game
• Mathematical optimization
• Markov decision process
• Markov chain
• Probability

Probabilistic Model Checking Christel Baier, Luca de Alfaro, Vojtˇech Forejt, and Marta Kwiatkowska Abstract The model-checking approach was originally formulated for verifying qualitative properties of systems, for exa

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

• Temporal logic
• Theoretical computer science
• Probability
• Markov decision process
• Markov chain
• Probabilistic CTL
• Linear temporal logic
• Computation tree logic
• PL

Model Checking of Hybrid Systems Goran Frehse AVACS Autumn School, October 1, 2015 Univ. Grenoble Alpes – Verimag, 2 avenue de Vignate, Centre Equation, 38610 Gières, France,

Source URL: www.avacs.org

• Differential equations
• Mathematics
• Hybrid automaton
• Hybrid system
• Systems science
• X0
• Center
• FO
• Systems theory

Synthesizing Pareto Optimal Decision for Autonomic Clouds using Stochastic Games Model Checking Azlan Ismail Marta Kwiatkowska

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

Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates Roberto Barbuti1 , Francesca Levi1 , Paolo Milazzo1 , and Guido Scatena2 1 2

Source URL: pages.di.unipi.it

• Probabilistic CTL
• Temporal logic
• Markov chain