Computing Publications

Publications Home » Authors » Dr Michael Huth

Authors

Dr Michael Huth

On this page:

Books
Book Chapters
Journal Articles
Journal Special Issue Articles
Electronic Journal Articles
Conference and Workshop Papers
Position Paper
PhD Thesis
Technical Reports
Foreword
Prefaces
BibTeX

81 publications for this author.

Books

Logic in Computer Science: modelling and reasoning about systems (Portuguese language edition): Michael Huth, Mark Ryan; Cambridge University Press; 2008
Logic in Computer Science: modelling and reasoning about systems (Chinese edition): Michael Huth, Mark Ryan; Cambridge University Press; 2005
Logic in Computer Science: modelling and reasoning about systems (Chinese language edition): Michael Huth, Mark Ryan; Cambridge University Press; 2005
Logic in Computer Science: modelling and reasoning about systems (second edition): Michael Huth, Mark Ryan; Cambridge University Press; 2004
Secure communicating systems: design, analysis, and implementation: Michael Huth; Cambridge University Press; 2001
Logic in Computer Science: Modelling and reasoning about computer systems (first edition): Michael Huth, Mark Ryan; Cambridge University Press; 2000

Book Chapters

An abstraction framework for mixed non-deterministic and probabilistic systems: Michael Huth; GI Dagstuhl research seminar on validation of stochastic systems, Dagstuhl Castle, Germany, 2002; Volume 2925, pp.419–444; Springer-Verlag; 2004
Domains of view: a foundation for specification and analysis: Michael Huth; International symposium on domain theory; domains and processes; Volume 1, pp.183–218; Kluwer Academic 2001; 2001

Journal Articles

Modal and Mixed Specifications: Key Decision Problems and their Complexities: Adam Antonik, Michael Huth, Kim Larsen, Ulrik Nyman, Andrzej Wasowski; Mathematical Structures in Computer Science; Cambridge University Press; 2010
Contributions to abstraction-based system verification: Michael Huth, Orna Grumberg; Software Tools for Technology Transfer; Springer Verlag; 2009
20 Years of Mixed and Modal Specifications: Adam Antonik, Michael Huth, Kim Larsen, Ulrik Nyman, Andrzej Wasowski; Bulletin of the European Association for Theoretical Computer Science, European Association for Theoretical Computer Science; June, 2008
Some current issues in model checking: Michael Huth; Software Tools for Technology Transfer; Volume 8, Issue 4, pp.1–10; Springer Verlag; 2006
On finite-state approximants for probabilistic computation tree logic: Michael Huth; Theoretical Computer Science; Volume 346, Issue 1, pp.113–134; Elsevier Science Bv; 2005
Refinement is complete for implementations: Michael Huth; Formal Aspects of Computing; Volume 17, Issue 2, pp.113–137; Springer; 2005
Labelled transition systems as a Stone space: Michael Huth; Logical Methods in Computer Science; Volume 1, Issue 1, pp.1–28; arxiv.org; January, 2005
Mathematics for the exploration of requirements: Michael Huth; SIGCSE Bulletin; Volume 36, Issue 2, pp.34–39; ACM Press; June, 2004
A domain equation for refinement of partial systems: Michael Huth, Radha Jagadeesan, David Schmidt; Mathematical Structures in Computer Science; Volume 14, Issue 4; January, 2004
A comment on the shape of the solution set for systems of interval linear equations with dependent coefficients: Götz Alefeld, Vladik Kreinovich, Günter Mayer, Michael Huth; Reliable Computing; Volume 7, Issue 3, pp.275–277; Springer Verlag; January, 2001
Linear Types and Approximation: Michael Huth, Achim Jung, Klaus Keimel; Mathematical Structures in Computer Science; Volume 10, Issue 6, pp.719–746; Cambridge University Press; 2000
On the Approximation of Denotational Mu-Semantics: Michael Huth; Applied Categorical Structures; Volume 7, Issues 1–2, pp.85–111; Springer Verlag; 1999
Quantitative Semantics, Topology, and Possibility Measures: RA Heckmann, Michael Huth; Topology and Its Applications; Volume 89, Issue 1, pp.151–178; Elsevier; 1998
A Maximal Monoidal Closed Category of Distributive Algebraic Domains: Michael Huth; Information and Computation; Volume 116, Issue 1, pp.10–25; 1995
Symbolic and Sub-symbolic Knowledge Organization in Computational Theories of Mind: Michael Huth; Knowledge Organization; Volume 22, Issue 1; 1995
Zero Dimensional and Connected Domains: Michael Huth; Semigroup Forum; Volume 51, Issue 1, pp.63–71; Springer Verlag; 1995
Algebraic Domains of Natural Transformations: Adrian Fiech, Michael Huth; Theoretical Computer Science; Volume 136, Issue 1, pp.57–78; Elsevier; 1994

Journal Special Issue Articles

PCTL Model Checking of Markov Chains: Truth and Falsity as Winning Strategies in Games: Harald Fecher, Michael Huth, Nir Piterman, Daniel Wagner; Performance Evaluation; Volume 67, Issue 9, pp.858–872; Elsevier; September, 2010
On model checking multiple hybrid views: Altaf Hussain, Michael Huth; Theoretical Computer Science; Elsevier; 2008

Electronic Journal Articles

Polynomial-Time Under-Approximation of Winning Regions in Parity Games: Adam Antonik, Nathaniel Charlton, Michael Huth; Fourth Irish Conference on the Mathematical Foundations of Computer Science and Information Technology (MFCSIT 2006); Volume 225, pp.115–139; Electronic Notes in Theoretical Computer Science, Elsevier; January, 2009
Topological analysis of refinement: Michael Huth; Electronic Notes in Theoretical Computer Science; Volume 161, pp.3–23; Elsevier; 2006
Automata games for multiple-model checking: Altaf Hussain, Michael Huth; Electronic Notes in Theoretical Computer Science; Volume 155, pp.401–421; Elsevier; May, 2006
Efficient Patterns for Model Checking Partial State Spaces in CTL & LTL: Adam Antonik, Michael Huth; Electronic Notes in Theoretical Computer Science; Volume 158, pp.41–57; Elsevier; May, 2006
Abstraction and probabilities for hybrid logics: Michael Huth; Electronic Notes in Theoretical Computer Science; Volume 112, pp.61–76; Elsevier; 2005
Consistent partial model checking: Michael Huth, Shekhar Pradhan; Electronic Notes in Theoretical Computer Science; Volume 73, pp.45–85; 2004
Model-checking view-based partial specifications: Michael Huth, Shekhar Pradhan; Electronic Notes in Theoretical Computer Science; Volume 45, pp.1–23; Elsevier; 2001
The Interval Domain: A Matchmaker for aCTL and aPCTL: Michael Huth; Electronic Notes in Theoretical Computer Science; Volume 14, pp.134–148; Elsevier; 1998
A Powerdomain of Possibility Measures: Michael Huth; Electronic Notes in Theoretical Computer Science; Volume 6, pp.191–202; Elsevier; 1997

Conference and Workshop Papers

p-Automata: New Foundations for Discrete-Time Probabilistic Verification: Michael Huth, Nir Piterman, Daniel Wagner; QEST 2010, 7th International Conference on Quantitative Evaluation of Systems; pp.161–170; IEEE Computer Society; September, 2010
A workbench for preprocessor design and evaluation: toward benchmarks for parity games: Michael Huth, Nir Piterman, Huaxin Wang; Electronic Communications of the EASST; European Association of Software Science and Technology; 2009
Detecting and Countering Insider Threats: Can Policy-Based Access Control Help?: Jason Crampton, Michael Huth; 5th International Workshop on Security and Trust Management (STM 2009); Electronic Notes in Theoretical Computer Science, Elsevier; 2009
Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL: Michael Huth, Nir Piterman, Daniel Wagner; FCT 2009, 17th International Symposium on Fundamentals of Computation Theory; Volume 5699, pp.205–216; Lecture Notes in Computer Science, Springer; September, 2009
On the complexity of semantic self-minimization: Adam Antonik, Michael Huth; Electronic Notes in Theoretical Computer Science; Elsevier; 2008
Refinement sensitive formal semantics of state machines with persistent choice: Harald Fecher, Michael Huth, Heiko Schmidt, Jens Schoenborn; Electronic Notes in Theoretical Computer Science; Elsevier; 2008
Falsifying safety properties through games on over-approximating models: Nathaniel Charlton, Michael Huth; Second Workshop on Reachability Problems; Electronic Notes in Theoretical Computer Science, Elsevier; 2008
Hintikka Games for PCTL on Labeled Markov Chains: Harald Fecher, Michael Huth, Nir Piterman, Daniel Wagner; QEST 2008; pp.169–178; IEEE Computer Society Press; September, 2008
EXPTIME-complete Decision Problems for Mixed and Modal Specifications: Adam Antonik, Michael Huth, Kim Larsen, Ulrik Nyman, Andrzej Wasowski; Electronic Notes in Theoretical Computer Science; Elsevier; August, 2008
Access-Control via Belnap Logic: Effective and Efficient Composition and Analysis: Glenn Bruns, Michael Huth; 21st IEEE Computer Security Foundations Symposium; IEEE Computer Society Press; June, 2008
Complexity of decision problems for mixed and modal transition systems: Adam Antonik, Michael Huth, Kim Larsen, Ulrik Nyman, Andrzej Wasowski; Lecture Notes in Computer Science; Springer Verlag; March, 2008
A simple and expressive semantic framework for policy composition in access control: Glenn Bruns, Daniel S. Dantas, Michael Huth; FMSE 2007; Formal Methods in Security Engineering: From Specifications to Code, ACM Press; November, 2007
Hector: software model checking with cooperating analysis plugins: Nathaniel Charlton, Michael Huth; Computer Aided Verification (CAV 2007); Lecture Notes in Computer Science, Springer; July, 2007
Cleanly combining specialised program analysers: Nathaniel Charlton, Michael Huth; Automated Reasoning Workshop 2007, 19th-20th April 2007, Department of Computing, Imperial College, London; April, 2007
More precise partition abstractions: Harald Fecher, Michael Huth; Eighth International Conference on Verification, Model Checking, and Abstract Interpretation, 14-16 January 2007, Nice, France; Volume 4349, pp.167–182; Lecture Notes in Computer Science, Springer Verlag; January, 2007
Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise: Harald Fecher, Michael Huth; Fourth international symposium on Automated Technology for Verification and Analysis, 23-26 October 2006, Beijing, China; Volume 4218, pp.322–336; Springer Verlag; October, 2006
Computing safe winning regions of parity games in polynomial time: Adam Antonik, Nathaniel Charlton, Michael Huth; Fourth Irish Conference on the Mathematical Foundations of Computer Science and Information Technology'06, MFCSIT'06, 1-5 August 2006, Cork, Ireland; August, 2006
Model checking vs. generalized model checking: semantic minimization for temporal logics: Patrice Godefroid, Michael Huth; IEEE Annual Symposium on Logic in Computer Science; pp.158–167; IEEE Computer Society Press; June, 2005
Beyond image-finiteness: labelled transition systems as a Stone space: Michael Huth; IEEE Annual Symposium on Logic in Computer Science; pp.222–231; IEEE Computer Soc; July, 2004
Possibilistic and probabilistic abstraction-based model checking: Michael Huth; Process algebra and probabilistic methods. performance modeling and verification: second joint international workshop PAPM-PROBMIV 2002, Copenhagen, Denmark, 25 - 26 July 2002; Volume 2399, pp.115–134; Springer Verlag; 2002
Model checking modal transition systems using Kripke structures: Michael Huth; Verification, model checking, and abstract interpretation: 3rd international workshop, VMCAI 2002, Venice, Italy, 21 - 22 January 2002; Volume 2294, pp.302–316; Lecture Notes in Computer Science, Springer Verlag; 2002
Abstraction-based model checking using modal transition systems: Patrice Godefroid, Michael Huth, Radha Jagadeesan; CONCUR 2001 - concurrency theory: 12th international conference, Aalborg, Denmark, 20 - 25 August 2001; Volume 2154, pp.426–440; Lecture Notes in Computer Science, Springer; 2001
Modal transition systems: a foundation for three-valued program analysis: Michael Huth, Radha Jagadeesan, S Schmidt; Programming languages and systems, proceedings; Volume 2028, pp.155–169; Lecture Notes in Computer Science, Springer Verlag; 2001
Logic in Computer Science: tool-based modeling and reasoning about systems: Michael Huth; International Conference on Frontiers in Education 2000 in Kansas City, Missouri; Volume 1; IEEE Education Society; 2000
A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems, and Interval Transition Systems: Michael Huth; 19th International Conference on the Foundations of Software Technology & Theoretical Computer Science; Volume 1738, pp.369–380; Lecture Notes in Computer Science, Springer Verlag; 1999
The interval domain as a semantic foundation for reasoning about uncertainty and vagueness: Michael Huth; International Symposium of Domain Theory 1999 at the Normal University of Shanghai, China; October, 1999
Assume-Guarantee Model Checking of Software: A Comparative Case Study: Corina Pasareanu, Matthew B. Dwyer, Michael Huth; 6th International SPIN Workshop on Practical Aspects of Model Checking; Volume 1680, pp.168–183; Lecture Notes in Computer Science, Springer Verlag; 1999
Comparing CTL and PCTL on Labeled Markov Chains: Michael Huth, Marta Z. Kwiatkowska; IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods 1998, June 2-6, Shelter Island, New York; pp.244–262; Chapman & Hall; 1998
Quantitative Analysis and Model Checking: Michael Huth, Marta Z. Kwiatkowska; IEEE Annual Symposium on Logic in Computer Science; pp.111–122; IEEE Computer Society Press; June, 1997
Linear Domains and Linear Maps: Michael Huth; 9th International Conference on Mathematical Foundations of Programming Semantics; Volume 802, pp.438–453; Lecture Notes in Computer Science, Springer Verlag; 1997
Finite but Unbounded Delay in Synchronous CCS: Michael Huth, Marta Z. Kwiatkowska; Third Imperial College Workshop; pp.312–323; Imperial College Press; 1996
Interaction Orders as Games: Michael Huth; Second Imperial College Department of Computing Workshop on Theory and Formal Methods; pp.21–40; Imperial College Press; 1995
Linear Types, Approximation, and Topology: Michael Huth, Achim Jung, Klaus Keimel; IEEE Annual Symposium on Logic in Computer Science; pp.110–114; IEEE Computer Society Press; July, 1994
On the equivalence of state-transition systems: Michael Huth; Workshops in Computing; pp.171–182; Springer Verlag; 1993
Cartesian closed categories of domains and the space Proj(D): Michael Huth; Seventh International Conference on Mathematical Foundations of Programming Semantics; Volume 598, pp.259–271; Lecture Notes in Computer Science, Springer Verlag; 1991

Position Paper

Abstraction and refinement for model checking inconsistent systems: Michael Huth, Shekhar Pradhan; University of Toronto; May, 2001

PhD Thesis

Projection-Stable and Zero Dimensional Domains: Michael Huth; Tulane University of Louisiana, United States of America; May, 1991

Technical Reports

PCTL Model Checking of Markov Chains: Truth and Falsity as Winning Strategies in Games: Harald Fecher, Michael Huth, Nir Piterman, Daniel Wagner; Performance Evaluation; Elsevier; 2010
Complete abstractions through extensions of disjunctive modal transition systems: Harald Fecher, Michael Huth; March, 2006
On model checking multiple hybrid views: Altaf Hussain, Michael Huth; First International Symposium on Leveraging Applications of Formal Methods (ISOLA'04); University of Cyprus; 2004
Lifting assertion and consistency checkers from single to multiple models: Michael Huth, Shekhar Pradhan; 2002
An Abstraction-Based Analysis of Rule Systems for Active Database Management Systems: Tarek Ghazi, Michael Huth; Department of Computing and Information Sciences, Kansas State University; April, 1998

Foreword

Foreword to the special issue of the journal Mathematical Structures in Computer Science (1997): Michael Huth, Achim Jung, Klaus Keimel; Mathematical Structures in Computer Science; Volume 7, pp.399–400; Cambridge University Press; 1997

Prefaces

Preface (AVoCS'05): Michael Huth; Electronic Notes in Theoretical Computer Science; Volume 128, Issue 6, pp.1–2; Elsevier; 2005
Preface (Probmiv'98): Christel Baier, Michael Huth, Marta Z. Kwiatkowska, Mark Ryan; Electronic Notes in Theoretical Computer Science; Volume 22, pp.1–2; Elsevier; 1999

BibTeX file for these publications

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.