## Talks of Michael Huth |

Arms Verification with Information Barriers: Constraining Bayesian Networks For Confidence Building, Security Seminar, School of Computer Science, University of Birmingham, 30 March 2017, Birmingham, England.

Partial Solvers for Parity Games: Effective Polynomial-Time Composition, talk given by Patrick Ah-Fat, GandALF 2016, 14 September 2016, Catania, Sicily, Italy.

Static Analysis of Parity Games: Alternating Reachability Under Parity, Festschrift Colloquium Dedicated to Hanne Riis Nielson and Flemming Nielson, 8 January 2016, DTU Denmark, Lyngby, Denmark.

Confidence analysis for nuclear arms control: SMT abstractions of Bayesian Belief NetworksConfidence analysis for nuclear arms control: SMT abstractions of Bayesian Belief Networks, talk given by Paul Beaumont, ESORICS 2015, 23 September 2015, Vienna, Austria.

Quantitative threat analysis via a logical service, Departmental Seminar (slides) in Computer Science, University of Surrey, 13 November 2014, Guildford, UK

Automated decision making informed by trust, risk or security, Guest Lecture at the Centre for Academic English, Imperial College London, 2 September 2014, London, UK

On Designing Usable Policy Languages for Declarative Trust Aggregation, talk given at HAS 2014, 26 June 2014, Heraklion, Crete

Should you believe everything you see and interact with online? (slides and video), Inaugural Lecture, 30 April 2014, Imperial College London, London, England

PEALT: An Automated Reasoning Tool for Numerical Aggregation of Trust Evidence, talk given at TACAS 2014, 7 April 2014, Grenoble, France.

Numerical Aggregation of Trust Evidence: From Foundations to Decision Support, talk given at the Cloud Computing Security and Identity Workshop, 4 April 2014, National Museum of Computing, Bletchley Park, England.

Mit Verwundbarkeit verifizierbar rechnen: Schadensbegrenzung statt Sicherheit?, talk given at GI Sicherheit 2014, 20 March 2014, Vienna, Austria.

Numerial Aggregation of Trust Evidence: From Foundations to Reasoning Support, talk given at the Seminar of the Department of Computer Science, RHUL, 19 November 2013, Egham, England.

A language for verifiable numerical aggregation of trust evidence, talk given at Security & Trust Management (STM) 2013, working group of the European Research Consortium for Informatics and Mathematics (ERCIM), 13 September 2013, Egham, England.

The Rabin Index of Parity Games, talk given by Jim Kuo at the Fourth International Symposium on Games, Automata, Logics and Formal Verification, 29 August 2013, Borca di Cadore, Dolomites, Italy.

Towards Usable Generation and Enforcement of Trust Evidence from Programmers' Intent, talk given at Human Computer Interaction Internatioal 2013, 24 July 2013, Las Vegas, Nevada.

Numerical Aggregation of Trust Evidence, talk given at the Workshop on Addressing R&D Challenges in Cybersecurity: Innovation and Collaboration Strategy, 20 June 2013, London, UK.

Fatal Attractors in Parity Games, talk given by Jim Kuo on 18 March 2013 at the 16th International Conference on Foundations of Software Science and Computation Structures, Rome, Italy.

Fatal Attractors in Parity Games, talk given on 11 September 2012 at the Annual Workshop of the ESF Networking Programme on Games for Design and Verification, Napoli, Italy.

Authorization Enforcement in Workflows: Maintaining Realizability Via Automated Reasoning, talk given on 1 July 2012 at the Third Workshop on Practical Aspects of Automated Reasoning (PAAR-2012), Manchester University, England.

Information Security as a Resource in Process-Aware Information Systems, talk given on 14 October 2011 at the workshop on Information Security as a Resource, Oxford University, England.

On the Modeling and Verification of Security-Aware and Process-Aware Information Systems, talk given on 29 August 2011 at the BPM Workshop on Workflow Security Audit and Certification, Clermont-Ferrand, France.

Program Synthesis in Administration of Higher-Order Permissions, talk given by Glenn Bruns on 15 June 2011 at the 16th ACM Symposium on Access Control Models and Technologies (SACMAT) in Innsbruck, Austria.

Synthesizing and Verifying Plans for Constrained Workflows: Transferring Tools from Formal Methods, talk given on 13 June 2011 at the VVPS 2001 workshop, Freiburg, Germany.

Policy Languages for User Managed Access, Departmental Seminar given on 25 February 2011, School of Computing Science, Newcastle University

From validating quantitative models to generating valid ones

talk given on 9 July 2010 at the annual meeting of the ERCIM working group Models and Logics for Quantitative Analysis

p-Automata: New Foundations for Discrete-Time Probabilistic Verification

talk given on 11 March 2010 at the
Informatik Kolloquium of the RWTH Aachen, Aachen, Germany

Computing Compact DNFs Via Reductions in the Egli-Milner Order

talk given on 26 January 2010 at the
The Dutch-British workshop on
Algebra & Coalgebra meet Proof Theory, London, England

Verification and Refutation of
Probabilistic Specifications via Games

talk given by Mark Kattenbelt on 15 December 2009 at the IARCS Annual
Conference on Foundations of Software Technology and Theoretical Computer Science, IIT Kanpur, India

Access Control via Belnap Logic: Intuitive,
Expressive, and Analyzable Policy Composition

talk to be given on 5 November 2009 at the LogIC Seminar, Imperial College London

Access Control via Belnap Logic: Intuitive,
Expressive, and Analyzable Policy Composition

talk given on 22 October 2009 in the Information Security Group Seminar, Royal Holloway, University of London

Workbench for preprocessor design and evaluation with parity games

talk given on 25 September 2009 by Huaxin Wang at the
Ninth Int'l Workshop on Automated Verification of Critical Systems, Gregynog, Wales

Towards Executable Access-Control Policies Written By Managers

Departmental Seminar given on 21 October 2008 at the Computing Laboratory, University of Oxford

Towards Executable Access-Control Policies Written By Managers

talk given on 10 October 2008 at the
13th Nordic Worshop
in Secure IT Systems, Copenhagen (Denmark), 9-10 OCtober 2008

Hintikka Games for PCTL on Labeled Markov Chains

talk given by
Daniel Wagner on 16 September 2008 at the 5th International Conference on
the Quantitative Evaluation of SysTems (QEST), St. Malo (France),
14-17 September 2008

Access-Control Policies via Belnap logic: expressive composition and
simple analysis

talk given on 11 September 2008 at the DFG-Graduiertenkolleg:
GRK 806/2 Mathematische Logik und Anwendungen, Freiburg (Germany),
10-11 September 2008

Falsifying safety properties through games on over-approximating models

talk given by
Nathaniel "Billiejoe" Charlton on 15 September 2008 at the 2nd Workshop on Reachability Problems, Liverpool (England),
15-17 September 2008

EXPTIME-complete Decision Problems for Modal and Mixed Specifications

talk kindly given by Ulrich Fahrenberg
on 23 August 2008 at the 15th International Workshop on
Expressiveness in Concurrency, Toronto (Canada), 23
August, 2008

A Simple Language for Policy Composition and Analysis

talk given
on 23 July 2008 at the
Countering
Insider Threats, Dagstuhl Seminar, Schloss Dagstuhl (Germany), 20-25
July, 2008

Access-Control Policies via Belnap Logic

talk given by Glenn Bruns on 24 June 2008 at the
21st IEEE Computer Security Foundations Symposium, Pittsburgh (USA),
23-25 June, 2008

Complexity of decision problems for mixed and modal specifications

talk given by Adam Antonik on 2 April 2008 at
FoSSaCS 2008, Budapest (Hungary),
29 March - 6 April 2008

Identity Management: Key Technologies

talk given on 24 January 2008 at the
Danish Workshop on IT Security in Practice, Aarhus (Denmark),
23-25 January 2008

Model checking for action abstraction

talk given by Harald Fecher on 7 January 2008 at the
Ninth International Conference on Verification, Model Checking and
Abstract Interpretation, San Fransisco (USA), 7-9 January 2008

On the complexity of semantic self-minimization

talk to be given on 10 September 2007 at the
Seventh International Workshop
on Automated Verification
of Critical Systems
, Oxford, 10-12 September 2007

HECTOR: a software model checker with cooporating analysis plugins

talk given by Nathaniel "Billiejoe" Charlton on 4 July 2007 at the
19th International Conference on Computer Aided Verification
(CAV 2007) in Berlin, Germany

Polynomial-Time Under-Approximation Of Winning Regions In Parity Games

talk given on 2 February 2007 at the
Logic Group,
Department of Mathematics, Technical University Darmstadt, in Darmstadt,
Germany

More precise partition abstractions

talk given on 15 January 2007 at
VMCAI'07, in Nice,
France

Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise

talk given by Harald Fecher on 26 October 2006 at
ATVA'06, in Beijing,
China

Free Lunch in the Borel Hierarchy for Partial Spaces?

talk given on 22 August 2006 at the Dagstuhl Seminar
Computational Structures for Modelling Space, Time and Causality, Schloss Dagstuhl, Germany

Computing safe winning regions of parity games in polynomial time

talk given on 2 August 2006 at
MFCSIT'06, at the
National University of Ireland, Cork, Ireland

Secure information flow: opportunities and challenges in security & forensics

talk given on 14 July 2006 at the 1st Conference on Advances in Computer Security and Forensics, Liverpool, United Kingdom

Efficient Patterns for Model Checking Partial State Spaces in CTL &
LTL

talk given by Adam Antonik on Friday, 26 May 2006 at MFPS 22,
Genova, Italy

Semantic Minimizations for Temporal Logics

talk given on
Thursday, 2 March 2006 at the Computer Science Department of
the University of Wales, Swansea, United Kingdom.

Semantic Minimizations for Temporal Logics

talk given on Tuesday,
20 December 2005 at the Semantics
and its Applications Workshop at Tel Aviv Univerisity, Tel Aviv,
Israel.

Hybrid
logics, abstraction, and probabilities

talk given on Wednesday, 5
October 2005 at the Intelligent
Systems Seminar at University College London.

Checking Under-specified Models

talk given on Tuesday, 27
September 2005 at the UK Model
Checking Days 2005, York.

Model
Checking Vs. Generalized Model Checking: Semantic Minimizations for
Temporal Logics

talk given by Patrice Godefroid at LICS 2005 in
Chicago, Illinois, on Monday, 27 June 2005.

Automata games for multiple-model checking

talk given by Altaf
Hussain at MFPS'XXI
in Birmingham (UK) on 20 May 2005.

Topological analysis of Refinement

talk given at Oxford
University on 12 November 2004, Concepts
of Space Seminar, Michaelmas 2004.

On
Model Checking Multiple Hybrid Views

talk given by Altaf Hussain
at the 1st
International Symposium on Leveraging Applications of Formal Methods
(ISOLA'04), Paphos, Cyprus, October 2004.

Refinement is complete
for implementations

talk given at the seminar Spatial
Representation : Discrete vs. Continuous Computational Models, Schloss
Dagstuhl, Germany, 23 August 2004

Topological analysis
of refinement

talk given at the Third Irish Conference on the
Mathematical Foundations of Computer Science and Information Technolo,
Trinity College, Dublin, 22-23 July 2004

Beyond
image-finiteness: labelled transition systems as a Stone space

Logic In Computer Science, 13-17 July 2004, Turku, Finland

Abstraction and probabilities
for hybrid logics

Quantitative Aspects of Programming
Languages, 27-28 March, Satellite Event of ETAPS 2004, Barcelona,
Spain

Consistent
partial model checking

DIMACS Workshop on Applications of
Lattices and Ordered Sets to Computer Science, July 8 - 10, 2003
DIMACS Center, CoRE Building, Rutgers University, Piscataway, New
Jersey

Robust
models for generalized model checking

Concurrency Seminar,
Computing Laboratory, Oxford University, 4 June 2003, Oxford (UK);
these slides contain more mathematical details than
the talk given at AVoCS 2003 and focus on modal transition systems
(ignoring ``shape'')

Robust models
for generalized model checking

Joint Theory Seminar (QMUL and
Imperial College), Wednesday, 21 May 2003, London (UK); slides in POSTSCRIPT these
slides contain more mathematical details than the talk given at AVoCS
2003

Robust
models for Generalized Model Checking

Third Workshop on Automated
Verification of Critical Systems : AVoCS 2003 April 2-3 2003,
Southampton (UK)

Generalized Model Checking for Shape Analysis

Schloss Dagstuhl
Workshop ``Reasoning about shape'' Dagstuhl, Germany, 3-7 March 2003

Don't
know and don't care: applications of executable
under-specifications

Distributed Software Engineering Seminar,
Department of Computing, Imperial College London; 7 February 2003

An ontology
for consistent partial model checking

Geometric Topology Seminar,
Department of Computing, Imperial College London; 28 Januray 2003

An
abstraction framework for mixed non-deterministic and probabilistic
systems

Verification of Stochastic Systems, GI/Dagstuhl Seminar,
December 9-11, 2002

Assertion-consistency lattices

Workshop on Domains 6, Birmingham,
England, September 19, 2002

Abstraction

SFM 2002 on Model Checking, Bertinoro, Italy, September 8-14, 2002

Possibilistic and
probabilistic abstraction-based model checking

PAPM-Probmiv2002

Computer Science 101 -- Preparing programmers to be architects

talk of college seminar ``Technically Speaking''

Model
checking modal transition systems using Kripke structures

Third
International Workshop on Verification, Model Checking and Abstract
Interpretation; January 21-22, 2002, Venice, Italy

Lifting
assertion and consistency checkers to multiple viewpoints

SE Seminar of the University College London, January 7, 2002.

Abstraction and
refinement for model checking inconsistent systems

with Shekhar
Pradhan;
Second International Workshop on Living
with Inconsistencies; 13 May, Toronto, Canada.

Modal transition
systems: a foundation for the analysis of partial systems

(with Patrice Godefroid, Radha Jagadeesan, and David Schmidt); slides
in postscript format, April 2001.

Modal
transition systems: a foundation for three-valued program analysis

with Radha Jagadeesan and David Schmidt; 15pp, January 2001; ESOP2001

Logic in
Computer Science: tool-based modeling and reasoning about systems

6pp, March 2000; Proceedings of the International Conference on
Frontiers in Education 2000, Kansas City, October 2000