| 2008 |
|---|
| 44 | EE | Adam Antonik,
Michael Huth,
Kim Guldstrand Larsen,
Ulrik Nyman,
Andrzej Wasowski:
Complexity of Decision Problems for Mixed and Modal Specifications.
FoSSaCS 2008: 112-126 |
| 43 | EE | Harald Fecher,
Michael Huth:
Model Checking for Action Abstraction.
VMCAI 2008: 112-126 |
| 2007 |
|---|
| 42 | | Orna Grumberg,
Michael Huth:
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
Springer 2007 |
| 41 | EE | Nathaniel Charlton,
Michael Huth:
Hector: Software Model Checking with Cooperating Analysis Plugins.
CAV 2007: 168-172 |
| 40 | EE | Glenn Bruns,
Daniel S. Dantas,
Michael Huth:
A simple and expressive semantic framework for policy composition in access control.
FMSE 2007: 12-21 |
| 39 | EE | Harald Fecher,
Michael Huth:
More Precise Partition Abstractions.
VMCAI 2007: 167-181 |
| 38 | EE | Michael Huth:
Some current topics in model checking.
STTT 9(1): 25-36 (2007) |
| 2006 |
|---|
| 37 | EE | Harald Fecher,
Michael Huth:
Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise.
ATVA 2006: 322-336 |
| 36 | EE | Altaf Hussain,
Michael Huth:
Automata Games for Multiple-model Checking.
Electr. Notes Theor. Comput. Sci. 155: 401-421 (2006) |
| 35 | EE | 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) |
| 34 | EE | Michael Huth:
Topological Analysis of Refinement.
Electr. Notes Theor. Comput. Sci. 161: 3-23 (2006) |
| 2005 |
|---|
| 33 | EE | Patrice Godefroid,
Michael Huth:
Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics.
LICS 2005: 158-167 |
| 32 | EE | Michael Huth:
Abstraction and Probabilities for Hybrid Logics.
Electr. Notes Theor. Comput. Sci. 112: 61-76 (2005) |
| 31 | EE | Michael Huth:
Preface.
Electr. Notes Theor. Comput. Sci. 128(6): 1-2 (2005) |
| 30 | EE | Michael Huth:
Refinement is complete for implementations.
Formal Asp. Comput. 17(2): 113-137 (2005) |
| 29 | EE | Michael Huth:
Labelled transition systems as a Stone space.
Logical Methods in Computer Science 1(1): (2005) |
| 28 | EE | Michael Huth:
On finite-state approximants for probabilistic computation tree logic.
Theor. Comput. Sci. 346(1): 113-134 (2005) |
| 2004 |
|---|
| 27 | EE | Michael Huth:
Beyond Image-Finiteness: Labelled Transition Systems as a Stone Space.
LICS 2004: 222-231 |
| 26 | EE | Michael Huth:
An Abstraction Framework for Mixed Non-deterministic and Probabilistic Systems.
Validation of Stochastic Systems 2004: 419-444 |
| 25 | EE | Michael Huth:
Labelled transition systems as a Stone space
CoRR abs/cs/0412063: (2004) |
| 24 | EE | Michael Huth,
Shekhar Pradhan:
Consistent Partial Model Checking.
Electr. Notes Theor. Comput. Sci. 73: 45-85 (2004) |
| 23 | EE | 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) |
| 2002 |
|---|
| 22 | EE | Michael Huth:
Possibilistic and Probabilistic Abstraction-Based Model Checking.
PAPM-PROBMIV 2002: 115-134 |
| 21 | EE | Michael Huth:
Model Checking Modal Transition Systems Using Kripke Structures.
VMCAI 2002: 302-316 |
| 2001 |
|---|
| 20 | EE | Patrice Godefroid,
Michael Huth,
Radha Jagadeesan:
Abstraction-Based Model Checking Using Modal Transition Systems.
CONCUR 2001: 426-440 |
| 19 | EE | Michael Huth,
Radha Jagadeesan,
David A. Schmidt:
Modal Transition Systems: A Foundation for Three-Valued Program Analysis.
ESOP 2001: 155-169 |
| 18 | EE | Michael Huth,
Shekhar Pradhan:
Model-Checking View-Based Partial Specifications.
Electr. Notes Theor. Comput. Sci. 45: (2001) |
| 17 | EE | 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) |
| 2000 |
|---|
| 16 | | Michael Huth,
Achim Jung,
Klaus Keimel:
Linear types and approximation.
Mathematical Structures in Computer Science 10(6): 719-745 (2000) |
| 1999 |
|---|
| 15 | EE | Michael Huth:
A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems and Interval Transition Systems.
FSTTCS 1999: 369-380 |
| 14 | EE | Corina S. Pasareanu,
Matthew B. Dwyer,
Michael Huth:
Assume-Guarantee Model Checking of Software: A Comparative Case Study.
SPIN 1999: 168-183 |
| 13 | EE | Christel Baier,
Michael Huth,
Marta Z. Kwiatkowska,
Mark Ryan:
Preface.
Electr. Notes Theor. Comput. Sci. 22: (1999) |
| 1998 |
|---|
| 12 | | Michael Huth,
Marta Z. Kwiatkowska:
Comparing CTL and PCTL on labeled Markov chains.
PROCOMET 1998: 244-262 |
| 11 | EE | Michael Huth:
The Interval Domain: A Matchmaker for aCTL and aPCTL.
Electr. Notes Theor. Comput. Sci. 14: (1998) |
| 1997 |
|---|
| 10 | | Reinhold Heckmann,
Michael Huth:
A Duality Theory for Quantitative Semantics.
CSL 1997: 255-274 |
| 9 | EE | Michael Huth,
Marta Z. Kwiatkowska:
Quantitative Analysis and Model Checking.
LICS 1997: 111-122 |
| 8 | EE | Michael Huth:
A powerdomain of possibility measures.
Electr. Notes Theor. Comput. Sci. 6: (1997) |
| 1995 |
|---|
| 7 | | Michael Huth:
A Maximal Monoidal Closed Category of Distributive Algebraic Domains
Inf. Comput. 116(1): 10-25 (1995) |
| 1994 |
|---|
| 6 | | Michael Huth,
Achim Jung,
Klaus Keimel:
Linear Types, Approximation, and Topology
LICS 1994: 110-114 |
| 5 | | Michael Huth:
Interaction Orders as Games.
Theory and Formal Methods 1994: 21-40 |
| 4 | | Adrian Fiech,
Michael Huth:
Algebraic Domains of Natural Transformations.
Theor. Comput. Sci. 136(1): 57-78 (1994) |
| 1993 |
|---|
| 3 | | Michael Huth:
Linear Domains and Linear Maps.
MFPS 1993: 438-453 |
| 2 | | Michael Huth:
On the Equivalence of State-Transition Systems.
Theory and Formal Methods 1993: 171-182 |
| 1991 |
|---|
| 1 | | Michael Huth:
Cartesian Closed Categories of Domains and the Space Proj(D).
MFPS 1991: 259-271 |
