Michael Huth

  • Imperial College London, UK

According to our database1, Michael Huth authored at least 117 papers between 1991 and 2022.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Digital twins: artificial intelligence and the IoT cyber-physical systems in Industry 4.0.
Int. J. Intell. Robotics Appl., 2022

Secure Bayesian Federated Analytics for Privacy-Preserving Trend Detection.
CoRR, 2021

Artificial Intelligence and the Internet of Things in Industry 4.0.
CCF Trans. Pervasive Comput. Interact., 2021

Protecting Private Inputs: Bounded Distortion Guarantees With Randomised Approximations.
Proc. Priv. Enhancing Technol., 2020

Two and Three-Party Digital Goods Auctions: Scalable Privacy Analysis.
CoRR, 2020

Effective Detection of Credential Thefts from Windows Memory: Learning Access Behaviours to Local Security Authority Subsystem Service.
Proceedings of the 23rd International Symposium on Research in Attacks, 2020

Static Analysis for Proactive Security.
Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019

Optimal Accuracy-Privacy Trade-Off for Secure Computations.
IEEE Trans. Inf. Theory, 2019

A reference architecture for integrating the Industrial Internet of Things in the Industry 4.0.
CoRR, 2019

Pseudonym Management Through Blockchain: Cost-Efficient Privacy Preservation on Intelligent Transportation Systems.
IEEE Access, 2019

Owner-Centric Sharing of Physical Resources, Data, and Data-Driven Insights in Digital Ecosystems.
Proceedings of the 24th ACM Symposium on Access Control Models and Technologies, 2019

Scalable Information Flow Analysis of Secure Three-Party Affine Computations.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Decision Support for Smart Grid: Using Reasoning to Contextualize Complex Decision Making.
Proceedings of the 7th Workshop on Modeling and Simulation of Cyber-Physical Energy Systems, 2019

Mapping the values of IoT.
J. Inf. Technol., 2018

Ontology-Based Reasoning about the Trustworthiness of Cyber-Physical Systems.
CoRR, 2018

Optimal Accuracy-Privacy Trade-Off for Secure Multi-Party Computations.
CoRR, 2018

Future developments in cyber risk assessment for the internet of things.
Comput. Ind., 2018

Satisfiability modulo theories for process systems engineering.
Comput. Chem. Eng., 2018

Reasoning about Smart City.
Proceedings of the 2018 IEEE International Conference on Smart Computing, 2018

Risk Engineering and Blockchain: Anticipating and Mitigating Risks.
Proceedings of the Business Information Systems Workshops, 2018

The Merits of Compositional Abstraction: A Case Study in Propositional Logic.
Proceedings of the Models, Mindsets, 2018

Mathematical Foundations of Advanced Informatics, Volume 1: Inductive Approaches.
Springer, ISBN: 978-3-319-68396-6, 2018

Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving.
CoRR, 2017

Constrained Bayesian Networks: Theory, Optimization, and Applications.
CoRR, 2017

Secure Multi-party Computation: Information Flow of Outputs and Game Theory.
Proceedings of the Principles of Security and Trust - 6th International Conference, 2017

Oligarchic Control of Business-to-Business Blockchains.
Proceedings of the 2017 IEEE European Symposium on Security and Privacy Workshops, 2017

Centrally Governed Blockchains: Optimizing Security, Cost, and Availability.
Proceedings of the Models, Algorithms, Logics and Tools, 2017

Optimizing Governed Blockchains for Financial Process Authentications.
CoRR, 2016

Partial Solvers for Parity Games: Effective Polynomial-Time Composition.
Proceedings of the Seventh International Symposium on Games, 2016

Static Analysis of Parity Games: Alternating Reachability Under Parity.
Proceedings of the Semantics, Logics, and Calculi, 2016

The Rabin index of parity games: Its complexity and approximation.
Inf. Comput., 2015

Confidence Analysis for Nuclear Arms Control: SMT Abstractions of Bayesian Belief Networks.
Proceedings of the Computer Security - ESORICS 2015, 2015

Authorized workflow schemas: deciding realizability through $$\mathsf{LTL }(\mathsf{F })$$ model checking.
Int. J. Softw. Tools Technol. Transf., 2014

Fatal Attractors in Parity Games: Building Blocks for Partial Solvers.
CoRR, 2014

PEALT: An Automated Reasoning Tool for Numerical Aggregation of Trust Evidence.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014

On Designing Usable Policy Languages for Declarative Trust Aggregation.
Proceedings of the Human Aspects of Information Security, Privacy, and Trust, 2014

Verifiably Secure Process-Aware Information Systems (Dagstuhl Seminar 13341).
Dagstuhl Reports, 2013

The Rabin index of parity games.
Proceedings of the Proceedings Fourth International Symposium on Games, 2013

Towards Verifiable Trust Management for Software Execution - (Extended Abstract).
Proceedings of the Trust and Trustworthy Computing - 6th International Conference, 2013

Towards Usable Generation and Enforcement of Trust Evidence from Programmers' Intent.
Proceedings of the Human Aspects of Information Security, Privacy, and Trust, 2013

Fatal Attractors in Parity Games.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

p-Automata: New foundations for discrete-time probabilistic verification.
Perform. Evaluation, 2012

Relationship-based access control: its expression and enforcement through hybrid logic.
Proceedings of the Second ACM Conference on Data and Application Security and Privacy, 2012

Authorization Enforcement in Workflows: Maintaining Realizability Via Automated Reasoning.
Proceedings of the Third Workshop on Practical Aspects of Automated Reasoning, 2012

Formal Methods and Access Control.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Access control via belnap logic: Intuitive, expressive, and analyzable policy composition.
ACM Trans. Inf. Syst. Secur., 2011

Message from the program chairs.
Perform. Evaluation, 2011

Program synthesis in administration of higher-order permissions.
Proceedings of the 16th ACM Symposium on Access Control Models and Technologies, 2011

The Rabin Index of Parity Games - (Extended Abstract).
Proceedings of the Hardware and Software: Verification and Testing, 2011

Concurrent Small Progress Measures.
Proceedings of the Hardware and Software: Verification and Testing, 2011

On the Modeling and Verification of Security-Aware and Process-Aware Information Systems.
Proceedings of the Business Process Management Workshops, 2011

Towards an Access-Control Framework for Countering Insider Threats.
Proceedings of the Insider Threats in Cyber Security, 2010

A Tunable Strain Sensor Using Nanogranular Metals.
Sensors, 2010

PCTL model checking of Markov chains: Truth and falsity as winning strategies in games.
Perform. Evaluation, 2010

Modal and mixed specifications: key decision problems and their complexities.
Math. Struct. Comput. Sci., 2010

A Framework for the Modular Specification and Orchestration of Authorization Policies.
Proceedings of the Information Security Technology for Applications, 2010

An Authorization Framework Resilient to Policy Evaluation Failures.
Proceedings of the Computer Security, 2010

Special section on advances in reachability analysis and decision procedures: contributions to abstraction-based system verification.
Int. J. Softw. Tools Technol. Transf., 2009

Refinement Sensitive Formal Semantics of State Machines With Persistent Choice.
Electron. Notes Theor. Comput. Sci., 2009

On the Complexity of Semantic Self-minimization.
Electron. Notes Theor. Comput. Sci., 2009

Polynomial-Time Under-Approximation of Winning Regions in Parity Games.
Electron. Notes Theor. Comput. Sci., 2009

A workbench for preprocessor design and evaluation: toward benchmarks for parity games.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2009

Verification and Refutation of Probabilistic Specifications via Games.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

On model checking multiple hybrid views.
Theor. Comput. Sci., 2008

Falsifying Safety Properties Through Games on Over-approximating Models.
Electron. Notes Theor. Comput. Sci., 2008

EXPTIME-complete Decision Problems for Modal and Mixed Specifications.
Proceedings of the 15th Workshop on Expressiveness in Concurrency, 2008

20 Years of Modal and Mixed Specifications.
Bull. EATCS, 2008

Model Checking for Action Abstraction.
Proceedings of the Verification, 2008

Hintikka Games for PCTL on Labeled Markov Chains.
Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008

Complexity of Decision Problems for Mixed and Modal Specifications.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

Access-Control Policies via Belnap Logic: Effective and Efficient Composition and Analysis.
Proceedings of the 21st IEEE Computer Security Foundations Symposium, 2008

Some current topics in model checking.
Int. J. Softw. Tools Technol. Transf., 2007

More Precise Partition Abstractions.
Proceedings of the Verification, 2007

A simple and expressive semantic framework for policy composition in access control.
Proceedings of the 2007 ACM workshop on Formal methods in security engineering, 2007

Hector: Software Model Checking with Cooperating Analysis Plugins.
Proceedings of the Computer Aided Verification, 19th International Conference, 2007

Topological Analysis of Refinement.
Electron. Notes Theor. Comput. Sci., 2006

Efficient Patterns for Model Checking Partial State Spaces in CTL <i>intersection</i> LTL.
Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programming Semantics, 2006

Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise.
Proceedings of the Automated Technology for Verification and Analysis, 2006

On finite-state approximants for probabilistic computation tree logic.
Theor. Comput. Sci., 2005

Labelled transition systems as a Stone space.
Log. Methods Comput. Sci., 2005

Refinement is complete for implementations.
Formal Aspects Comput., 2005

Electron. Notes Theor. Comput. Sci., 2005

Abstraction and Probabilities for Hybrid Logics.
Electron. Notes Theor. Comput. Sci., 2005

Automata Games for Multiple-model Checking.
Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Mathematics for the exploration of requirements.
ACM SIGCSE Bull., 2004

A domain equation for refinement of partial systems.
Math. Struct. Comput. Sci., 2004

Consistent Partial Model Checking.
Electron. Notes Theor. Comput. Sci., 2004

An Abstraction Framework for Mixed Non-deterministic and Probabilistic Systems.
Proceedings of the Validation of Stochastic Systems - A Guide to Current Research, 2004

Beyond Image-Finiteness: Labelled Transition Systems as a Stone Space.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Logic in computer science - modelling and reasoning about systems (2. ed.).
Cambridge University Press, 2004

Model Checking Modal Transition Systems Using Kripke Structures.
Proceedings of the Verification, 2002

Possibilistic and Probabilistic Abstraction-Based Model Checking.
Proceedings of the Process Algebra and Probabilistic Methods, 2002

A Comment on the Shape of the Solution Set for Systems of Interval Linear Equations with Dependent Coefficients.
Reliab. Comput., 2001

Model-Checking View-Based Partial Specifications.
Proceedings of the Seventeenth Conference on the Mathematical Foundations of Programming Semantics, 2001

Modal Transition Systems: A Foundation for Three-Valued Program Analysis.
Proceedings of the Programming Languages and Systems, 2001

Abstraction-Based Model Checking Using Modal Transition Systems.
Proceedings of the CONCUR 2001, 2001

Secure communicating systems - design, analysis, and implementation.
Cambridge University Press, ISBN: 978-0-521-80731-9, 2001

Linear types and approximation.
Math. Struct. Comput. Sci., 2000

Logic in computer science - modelling and reasoning about systems.
Cambridge University Press, ISBN: 978-0-521-65602-3, 2000

Electron. Notes Theor. Comput. Sci., 1999

On the Approximation of Denotational Mu-Semantics.
Appl. Categorical Struct., 1999

Assume-Guarantee Model Checking of Software: A Comparative Case Study.
Proceedings of the Theoretical and Practical Aspects of SPIN Model Checking, 1999

A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems and Interval Transition Systems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

The Interval Domain: A Matchmaker for aCTL and aPCTL.
Electron. Notes Theor. Comput. Sci., 1998

Comparing CTL and PCTL on labeled Markov chains.
Proceedings of the Programming Concepts and Methods, 1998

A powerdomain of possibility measures.
Proceedings of the Thirteenth Annual Conference on Mathematical Foundations of Progamming Semantics, 1997

Quantitative Analysis and Model Checking.
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

A Duality Theory for Quantitative Semantics.
Proceedings of the Computer Science Logic, 11th International Workshop, 1997

A Maximal Monoidal Closed Category of Distributive Algebraic Domains
Inf. Comput., January, 1995

Algebraic Domains of Natural Transformations.
Theor. Comput. Sci., 1994

Linear Types, Approximation, and Topology
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

Interaction Orders as Games.
Proceedings of the Proceedings for the Second Imperial College Department of Computing Workshop on Theory and Formal Methods, 1994

Linear Domains and Linear Maps.
Proceedings of the Mathematical Foundations of Programming Semantics, 1993

On the Equivalence of State-Transition Systems.
Proceedings of the Theory and Formal Methods 1993, 1993

Cartesian Closed Categories of Domains and the Space Proj(D).
Proceedings of the Mathematical Foundations of Programming Semantics, 1991