Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michael Huth
2010 – today
- 2013
[c38]
[c37]Michael Huth, Jim Huan-Pu Kuo: Towards Verifiable Trust Management for Software Execution - (Extended Abstract). TRUST 2013: 275-276
[e2]Michael Huth, N. Asokan, Srdjan Capkun, Ivan Flechais, Lizzie Coles-Kemp (Eds.): Trust and Trustworthy Computing - 6th International Conference, TRUST 2013, London, UK, June 17-19, 2013. Proceedings. Lecture Notes in Computer Science 7904, Springer 2013, ISBN 978-3-642-38907-8- 2012
[j35]Michael Huth, Nir Piterman, Daniel Wagner: p-Automata: New foundations for discrete-time probabilistic verification. Perform. Eval. 69(7-8): 356-378 (2012)
[c36]Glenn Bruns, Philip W. L. Fong, Ida Siahaan, Michael Huth: Relationship-based access control: its expression and enforcement through hybrid logic. CODASPY 2012: 117-124- 2011
[j34]
[j33]Glenn Bruns, Michael Huth: Access control via belnap logic: Intuitive, expressive, and analyzable policy composition. ACM Trans. Inf. Syst. Secur. 14(1): 9 (2011)
[c35]Jason Crampton, Michael Huth: On the Modeling and Verification of Security-Aware and Process-Aware Information Systems. Business Process Management Workshops (2) 2011: 423-434
[c34]Michael Huth, Jim Huan-Pu Kuo, Nir Piterman: Concurrent Small Progress Measures. Haifa Verification Conference 2011: 130-144
[c33]Michael Huth, Jim Huan-Pu Kuo, Nir Piterman: The Rabin Index of Parity Games - (Extended Abstract). Haifa Verification Conference 2011: 259-260
[c32]Glenn Bruns, Michael Huth, Kumar Avijit: Program synthesis in administration of higher-order permissions. SACMAT 2011: 41-50
[r1]Michael Huth: Formal Methods and Access Control. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 494-495- 2010
[j32]Adam Antonik, Michael Huth, Kim G. Larsen, Ulrik Nyman, Andrzej Wasowski: Modal and mixed specifications: key decision problems and their complexities. Mathematical Structures in Computer Science 20(1): 75-103 (2010)
[j31]Harald Fecher, Michael Huth, Nir Piterman, Daniel Wagner: PCTL model checking of Markov chains: Truth and falsity as winning strategies in games. Perform. Eval. 67(9): 858-872 (2010)
[c31]Jason Crampton, Michael Huth: An Authorization Framework Resilient to Policy Evaluation Failures. ESORICS 2010: 472-487
[c30]Jason Crampton, Michael Huth: A Framework for the Modular Specification and Orchestration of Authorization Policies. NordSec 2010: 155-170
[c29]Michael Huth, Nir Piterman, Daniel Wagner: p-Automata: New Foundations for Discrete-Time Probabilistic Verification. QEST 2010: 161-170
[p1]Jason Crampton, Michael Huth: Towards an Access-Control Framework for Countering Insider Threats. Insider Threats in Cyber Security 2010: 173-195
2000 – 2009
- 2009
[j30]Michael Huth, Nir Piterman, Huaxin Wang: A workbench for preprocessor design and evaluation: toward benchmarks for parity games. ECEASST 23 (2009)
[j29]Adam Antonik, Nathaniel Charlton, Michael Huth: Polynomial-Time Under-Approximation of Winning Regions in Parity Games. Electr. Notes Theor. Comput. Sci. 225: 115-139 (2009)
[j28]Adam Antonik, Michael Huth, Kim Guldstrand Larsen, Ulrik Nyman, Andrzej Wasowski: EXPTIME-complete Decision Problems for Modal and Mixed Specifications. Electr. Notes Theor. Comput. Sci. 242(1): 19-33 (2009)
[j27]Adam Antonik, Michael Huth: On the Complexity of Semantic Self-minimization. Electr. Notes Theor. Comput. Sci. 250(1): 3-19 (2009)
[j26]Harald Fecher, Michael Huth, Heiko Schmidt, Jens Schönborn: Refinement Sensitive Formal Semantics of State Machines With Persistent Choice. Electr. Notes Theor. Comput. Sci. 250(1): 71-86 (2009)
[j25]Michael Huth, Orna Grumberg: Special section on advances in reachability analysis and decision procedures: contributions to abstraction-based system verification. STTT 11(2): 85-94 (2009)
[c28]Michael Huth, Nir Piterman, Daniel Wagner: Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL. FCT 2009: 205-216
[c27]Mark Kattenbelt, Michael Huth: Verification and Refutation of Probabilistic Specifications via Games. FSTTCS 2009: 251-262- 2008
[j24]Adam Antonik, Michael Huth, Kim G. Larsen, Ulrik Nyman, Andrzej Wasowski: 20 Years of Modal and Mixed Specifications. Bulletin of the EATCS 95: 94-129 (2008)
[j23]Nathaniel Charlton, Michael Huth: Falsifying Safety Properties Through Games on Over-approximating Models. Electr. Notes Theor. Comput. Sci. 223: 71-86 (2008)
[j22]Altaf Hussain, Michael Huth: On model checking multiple hybrid views. Theor. Comput. Sci. 404(3): 186-201 (2008)
[c26]Glenn Bruns, Michael Huth: Access-Control Policies via Belnap Logic: Effective and Efficient Composition and Analysis. CSF 2008: 163-176
[c25]Adam Antonik, Michael Huth, Kim Guldstrand Larsen, Ulrik Nyman, Andrzej Wasowski: Complexity of Decision Problems for Mixed and Modal Specifications. FoSSaCS 2008: 112-126
[c24]Harald Fecher, Michael Huth, Nir Piterman, Daniel Wagner: Hintikka Games for PCTL on Labeled Markov Chains. QEST 2008: 169-178
[c23]- 2007
[j21]
[c22]Nathaniel Charlton, Michael Huth: Hector: Software Model Checking with Cooperating Analysis Plugins. CAV 2007: 168-172
[c21]Glenn Bruns, Daniel S. Dantas, Michael Huth: A simple and expressive semantic framework for policy composition in access control. FMSE 2007: 12-21
[c20]
[e1]Orna Grumberg, Michael Huth (Eds.): Tools and Algorithms for the Construction and Analysis of Systems, 13th International Conference, TACAS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007 Braga, Portugal, March 24 - April 1, 2007, Proceedings. Lecture Notes in Computer Science 4424, Springer 2007, ISBN 978-3-540-71208-4- 2006
[j20]Altaf Hussain, Michael Huth: Automata Games for Multiple-model Checking. Electr. Notes Theor. Comput. Sci. 155: 401-421 (2006)
[j19]Adam Antonik, Michael Huth: Efficient Patterns for Model Checking Partial State Spaces in CTL intersection LTL. Electr. Notes Theor. Comput. Sci. 158: 41-57 (2006)
[j18]Michael Huth: Topological Analysis of Refinement. Electr. Notes Theor. Comput. Sci. 161: 3-23 (2006)
[c19]Harald Fecher, Michael Huth: Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise. ATVA 2006: 322-336- 2005
[j17]Michael Huth: Abstraction and Probabilities for Hybrid Logics. Electr. Notes Theor. Comput. Sci. 112: 61-76 (2005)
[j16]
[j15]
[j14]Michael Huth: Labelled transition systems as a Stone space. Logical Methods in Computer Science 1(1) (2005)
[j13]Michael Huth: On finite-state approximants for probabilistic computation tree logic. Theor. Comput. Sci. 346(1): 113-134 (2005)
[c18]Patrice Godefroid, Michael Huth: Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics. LICS 2005: 158-167- 2004
[b3]Michael Huth, Mark Dermot Ryan: Logic in computer science - modelling and reasoning about systems (2. ed.). Cambridge University Press 2004, pp. I-XIV, 1-427
[j12]Michael Huth, Shekhar Pradhan: Consistent Partial Model Checking. Electr. Notes Theor. Comput. Sci. 73: 45-85 (2004)
[j11]Michael Huth, Radha Jagadeesan, David A. Schmidt: A domain equation for refinement of partial systems. Mathematical Structures in Computer Science 14(4): 469-505 (2004)
[j10]
[c17]Michael Huth, Altaf Hussain: On model checking multiple hybrid views. ISoLA (Preliminary proceedings) 2004: 235-242
[c16]Michael Huth: Beyond Image-Finiteness: Labelled Transition Systems as a Stone Space. LICS 2004: 222-231
[c15]Michael Huth: An Abstraction Framework for Mixed Non-deterministic and Probabilistic Systems. Validation of Stochastic Systems 2004: 419-444
[i1]- 2002
[c14]Michael Huth: Possibilistic and Probabilistic Abstraction-Based Model Checking. PAPM-PROBMIV 2002: 115-134
[c13]- 2001
[b2]Michael Huth: Secure communicating systems - design, analysis, and implementation. Cambridge University Press 2001, ISBN 978-0-521-80731-9, pp. I-X, 1-283
[j9]Michael Huth, Shekhar Pradhan: Model-Checking View-Based Partial Specifications. Electr. Notes Theor. Comput. Sci. 45: 174-196 (2001)
[j8]Götz Alefeld, Vladik Kreinovich, Günter Mayer, Michael Huth: A Comment on the Shape of the Solution Set for Systems of Interval Linear Equations with Dependent Coefficients. Reliable Computing 7(3): 275-277 (2001)
[c12]Patrice Godefroid, Michael Huth, Radha Jagadeesan: Abstraction-Based Model Checking Using Modal Transition Systems. CONCUR 2001: 426-440
[c11]Michael Huth, Radha Jagadeesan, David A. Schmidt: Modal Transition Systems: A Foundation for Three-Valued Program Analysis. ESOP 2001: 155-169- 2000
[b1]Michael Huth, Mark Dermot Ryan: Logic in computer science - modelling and reasoning about systems. Cambridge University Press 2000, ISBN 978-0-521-65602-3, pp. I-XVII, 1-387
[j7]Michael Huth, Achim Jung, Klaus Keimel: Linear types and approximation. Mathematical Structures in Computer Science 10(6): 719-745 (2000)
1990 – 1999
- 1999
[j6]Michael Huth: On the Approximation of Denotational Mu-Semantics. Applied Categorical Structures 7(1-2): 85-111 (1999)
[j5]Christel Baier, Michael Huth, Marta Z. Kwiatkowska, Mark Ryan: Preface. Electr. Notes Theor. Comput. Sci. 22: 1-2 (1999)
[c10]Michael Huth: A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems and Interval Transition Systems. FSTTCS 1999: 369-380
[c9]Corina S. Pasareanu, Matthew B. Dwyer, Michael Huth: Assume-Guarantee Model Checking of Software: A Comparative Case Study. SPIN 1999: 168-183- 1998
[j4]Michael Huth: The Interval Domain: A Matchmaker for aCTL and aPCTL. Electr. Notes Theor. Comput. Sci. 14: 134-148 (1998)
[c8]Michael Huth, Marta Z. Kwiatkowska: Comparing CTL and PCTL on labeled Markov chains. PROCOMET 1998: 244-262- 1997
[j3]Michael Huth: A powerdomain of possibility measures. Electr. Notes Theor. Comput. Sci. 6: 191-202 (1997)
[c7]
[c6]- 1995
[j2]Michael Huth: A Maximal Monoidal Closed Category of Distributive Algebraic Domains. Inf. Comput. 116(1): 10-25 (1995)- 1994
[j1]Adrian Fiech, Michael Huth: Algebraic Domains of Natural Transformations. Theor. Comput. Sci. 136(1): 57-78 (1994)
[c5]
[c4]Michael Huth, Achim Jung, Klaus Keimel: Linear Types, Approximation, and Topology. LICS 1994: 110-114- 1993
[c3]Michael Huth: On the Equivalence of State-Transition Systems. Theory and Formal Methods 1993: 171-182
[c2]- 1991
[c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-13 23:03 CEST by the dblp team



