Search the dblp DataBase
Michael Huth :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Harald Fecher , Michael Huth Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise. [Citation Graph (0, 0)][DBLP ] ATVA, 2006, pp:322-336 [Conf ] Patrice Godefroid , Michael Huth , Radha Jagadeesan Abstraction-Based Model Checking Using Modal Transition Systems. [Citation Graph (0, 0)][DBLP ] CONCUR, 2001, pp:426-440 [Conf ] Reinhold Heckmann , Michael Huth A Duality Theory for Quantitative Semantics. [Citation Graph (0, 0)][DBLP ] CSL, 1997, pp:255-274 [Conf ] Michael Huth , Radha Jagadeesan , David A. Schmidt Modal Transition Systems: A Foundation for Three-Valued Program Analysis. [Citation Graph (0, 0)][DBLP ] ESOP, 2001, pp:155-169 [Conf ] Michael Huth A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems and Interval Transition Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1999, pp:369-380 [Conf ] Michael Huth On the Equivalence of State-Transition Systems. [Citation Graph (0, 0)][DBLP ] Theory and Formal Methods, 1993, pp:171-182 [Conf ] Michael Huth Interaction Orders as Games. [Citation Graph (0, 0)][DBLP ] Theory and Formal Methods, 1994, pp:21-40 [Conf ] Patrice Godefroid , Michael Huth Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics. [Citation Graph (0, 0)][DBLP ] LICS, 2005, pp:158-167 [Conf ] Michael Huth Beyond Image-Finiteness: Labelled Transition Systems as a Stone Space. [Citation Graph (0, 0)][DBLP ] LICS, 2004, pp:222-231 [Conf ] Michael Huth , Achim Jung , Klaus Keimel Linear Types, Approximation, and Topology [Citation Graph (0, 0)][DBLP ] LICS, 1994, pp:110-114 [Conf ] Michael Huth , Marta Z. Kwiatkowska Quantitative Analysis and Model Checking. [Citation Graph (0, 0)][DBLP ] LICS, 1997, pp:111-122 [Conf ] Michael Huth Cartesian Closed Categories of Domains and the Space Proj(D). [Citation Graph (0, 0)][DBLP ] MFPS, 1991, pp:259-271 [Conf ] Michael Huth Linear Domains and Linear Maps. [Citation Graph (0, 0)][DBLP ] MFPS, 1993, pp:438-453 [Conf ] Michael Huth Possibilistic and Probabilistic Abstraction-Based Model Checking. [Citation Graph (0, 0)][DBLP ] PAPM-PROBMIV, 2002, pp:115-134 [Conf ] Michael Huth , Marta Z. Kwiatkowska Comparing CTL and PCTL on labeled Markov chains. [Citation Graph (0, 0)][DBLP ] PROCOMET, 1998, pp:244-262 [Conf ] Corina S. Pasareanu , Matthew B. Dwyer , Michael Huth Assume-Guarantee Model Checking of Software: A Comparative Case Study. [Citation Graph (0, 0)][DBLP ] SPIN, 1999, pp:168-183 [Conf ] Michael Huth Model Checking Modal Transition Systems Using Kripke Structures. [Citation Graph (0, 0)][DBLP ] VMCAI, 2002, pp:302-316 [Conf ] Michael Huth An Abstraction Framework for Mixed Non-deterministic and Probabilistic Systems. [Citation Graph (0, 0)][DBLP ] Validation of Stochastic Systems, 2004, pp:419-444 [Conf ] Adam Antonik , Michael Huth Efficient Patterns for Model Checking Partial State Spaces in CTL intersection LTL. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2006, v:158, n:, pp:41-57 [Journal ] Christel Baier , Michael Huth , Marta Z. Kwiatkowska , Mark Ryan Preface. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1999, v:22, n:, pp:- [Journal ] Altaf Hussain , Michael Huth Automata Games for Multiple-model Checking. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2006, v:155, n:, pp:401-421 [Journal ] Michael Huth Abstraction and Probabilities for Hybrid Logics. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:112, n:, pp:61-76 [Journal ] Michael Huth Preface. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:128, n:6, pp:1-2 [Journal ] Michael Huth A powerdomain of possibility measures. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1997, v:6, n:, pp:- [Journal ] Michael Huth The Interval Domain: A Matchmaker for aCTL and aPCTL. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1998, v:14, n:, pp:- [Journal ] Michael Huth , Shekhar Pradhan Model-Checking View-Based Partial Specifications. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2001, v:45, n:, pp:- [Journal ] Michael Huth , Shekhar Pradhan Consistent Partial Model Checking. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2004, v:73, n:, pp:45-85 [Journal ] Michael Huth Topological Analysis of Refinement. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2006, v:161, n:, pp:3-23 [Journal ] Michael Huth Refinement is complete for implementations. [Citation Graph (0, 0)][DBLP ] Formal Asp. Comput., 2005, v:17, n:2, pp:113-137 [Journal ] Michael Huth A Maximal Monoidal Closed Category of Distributive Algebraic Domains [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1995, v:116, n:1, pp:10-25 [Journal ] Michael Huth Labelled transition systems as a Stone space. [Citation Graph (0, 0)][DBLP ] Logical Methods in Computer Science, 2005, v:1, n:1, pp:- [Journal ] Michael Huth , Achim Jung , Klaus Keimel Linear types and approximation. [Citation Graph (0, 0)][DBLP ] Mathematical Structures in Computer Science, 2000, v:10, n:6, pp:719-745 [Journal ] Michael Huth , Radha Jagadeesan , David A. Schmidt A domain equation for refinement of partial systems. [Citation Graph (0, 0)][DBLP ] Mathematical Structures in Computer Science, 2004, v:14, n:4, pp:469-505 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Reliable Computing, 2001, v:7, n:3, pp:275-277 [Journal ] Adrian Fiech , Michael Huth Algebraic Domains of Natural Transformations. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1994, v:136, n:1, pp:57-78 [Journal ] Michael Huth On finite-state approximants for probabilistic computation tree logic. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:346, n:1, pp:113-134 [Journal ] Nathaniel Charlton , Michael Huth Hector: Software Model Checking with Cooperating Analysis Plugins. [Citation Graph (0, 0)][DBLP ] CAV, 2007, pp:168-172 [Conf ] Michael Huth Labelled transition systems as a Stone space [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Michael Huth Some current topics in model checking. [Citation Graph (0, 0)][DBLP ] STTT, 2007, v:9, n:1, pp:25-36 [Journal ] A simple and expressive semantic framework for policy composition in access control. [Citation Graph (, )][DBLP ] Access-Control Policies via Belnap Logic: Effective and Efficient Composition and Analysis. [Citation Graph (, )][DBLP ] An Authorization Framework Resilient to Policy Evaluation Failures. [Citation Graph (, )][DBLP ] Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL. [Citation Graph (, )][DBLP ] Complexity of Decision Problems for Mixed and Modal Specifications. [Citation Graph (, )][DBLP ] Verification and Refutation of Probabilistic Specifications via Games. [Citation Graph (, )][DBLP ] On model checking multiple hybrid views. [Citation Graph (, )][DBLP ] Hintikka Games for PCTL on Labeled Markov Chains. [Citation Graph (, )][DBLP ] More Precise Partition Abstractions. [Citation Graph (, )][DBLP ] Model Checking for Action Abstraction. [Citation Graph (, )][DBLP ] On the Approximation of Denotational Mu-Semantics. [Citation Graph (, )][DBLP ] Falsifying Safety Properties Through Games on Over-approximating Models. [Citation Graph (, )][DBLP ] Polynomial-Time Under-Approximation of Winning Regions in Parity Games. [Citation Graph (, )][DBLP ] EXPTIME-complete Decision Problems for Modal and Mixed Specifications. [Citation Graph (, )][DBLP ] On the Complexity of Semantic Self-minimization. [Citation Graph (, )][DBLP ] Refinement Sensitive Formal Semantics of State Machines With Persistent Choice. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.307secs