Bubaak: Runtime monitoring of program verifiers
M. Chalupa, T.A. Henzinger, in:, Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2023, pp. 535–540.

Vamos: Middleware for best-effort third-party monitoring
M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, in:, Fundamental Approaches to Software Engineering, Springer Nature, 2023, pp. 260–281.

VAMOS: Middleware for Best-Effort Third-Party Monitoring
M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 2023.

A learner-verifier framework for neural network controllers and certificates of stochastic systems
K. Chatterjee, T.A. Henzinger, M. Lechner, D. Zikelic, in:, Tools and Algorithms for the Construction and Analysis of Systems , Springer Nature, 2023, pp. 3–25.

Quantitative safety and liveness
T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 26th International Conference Foundations of Software Science and Computation Structures, Springer Nature, 2023, pp. 349–370.

Regular methods for operator precedence languages
T.A. Henzinger, P. Kebis, N.A. Mazzocchi, N.E. Sarac, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20.

Revisiting the adversarial robustness-accuracy tradeoff in robot learning
M. Lechner, A. Amini, D. Rus, T.A. Henzinger, IEEE Robotics and Automation Letters 8 (2023) 1595–1602.

Quantization-aware interval bound propagation for training certifiably robust quantized neural networks
M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, D. Rus, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2023, pp. 14964–14973.

Monitoring algorithmic fairness
T.A. Henzinger, M. Karimi, K. Kueffner, K. Mallik, in:, Computer Aided Verification, Springer Nature, 2023, pp. 358–382.

Safety and liveness of quantitative automata
U. Boker, T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 34th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.

Hypernode automata
E. Bartocci, T.A. Henzinger, D. Nickovic, A. Oliveira da Costa, in:, 34th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.

Monitoring algorithmic fairness under partial observations
T.A. Henzinger, K. Kueffner, K. Mallik, in:, 23rd International Conference on Runtime Verification, Springer Nature, 2023, pp. 291–311.

Learning provably stabilizing neural controllers for discrete-time stochastic systems
M. Ansaripour, K. Chatterjee, T.A. Henzinger, M. Lechner, D. Zikelic, in:, 21st International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2023, pp. 357–379.

Trap spaces of multi-valued networks: Definition, computation, and applications
V.G. Trinh, B. Benhamou, T.A. Henzinger, S. Pastva, Bioinformatics 39 (2023) i513–i522.

Binary decision diagrams on modern hardware
S. Pastva, T.A. Henzinger, in:, Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design, TU Vienna Academic Press, 2023, pp. 122–131.

Learning control policies for stochastic systems with reach-avoid guarantees
D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2023, pp. 11926–11935.

Into the unknown: Active monitoring of neural networks (extended version)
K. Kueffner, A. Lukina, C. Schilling, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 25 (2023) 575–592.

Compositional policy learning in stochastic control systems with formal guarantees
D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th Conference on Neural Information Processing Systems, 2023.

Monitoring hyperproperties with prefix transducers
M. Chalupa, T.A. Henzinger, in:, 23nd International Conference on Runtime Verification, Springer Nature, 2023, pp. 168–190.

Monitoring hyperproperties with prefix transducers
M. Chalupa, T.A. Henzinger, (2023).

Runtime monitoring of dynamic fairness properties
T.A. Henzinger, M. Karimi, K. Kueffner, K. Mallik, in:, FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, Association for Computing Machinery, 2023, pp. 604–614.

Flavors of sequential information flow
E. Bartocci, T. Ferrere, T.A. Henzinger, D. Nickovic, A.O. Da Costa, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2022, pp. 1–19.

Synthesis of parametric hybrid automata from time series
M. Garcia Soto, T.A. Henzinger, C. Schilling, in:, 20th International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2022, pp. 337–353.

History-deterministic timed automata
T.A. Henzinger, K. Lehtinen, P. Totzke, in:, 33rd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21.

An updated survey of bidding games on graphs
G. Avni, T.A. Henzinger, in:, 47th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 3:1-3:6.

Revisiting the adversarial robustness-accuracy tradeoff in robot learning
M. Lechner, A. Amini, D. Rus, T.A. Henzinger, ArXiv (n.d.).

Quantitative monitoring of software
T.A. Henzinger, in:, Software Verification, Springer Nature, 2022, pp. 3–6.

Information-flow interfaces
E. Bartocci, T. Ferrere, T.A. Henzinger, D. Nickovic, A.O. Da Costa, in:, Fundamental Approaches to Software Engineering, Springer Nature, 2022, pp. 3–22.

Abstract monitors for quantitative specifications
T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 22nd International Conference on Runtime Verification, Springer Nature, 2022, pp. 200–220.

History-deterministic timed automata are not determinizable
S. Bose, T.A. Henzinger, K. Lehtinen, S. Schewe, P. Totzke, in:, 16th International Conference on Reachability Problems, Springer Nature, 2022, pp. 67–76.

GoTube: Scalable statistical verification of continuous-depth models
S.A. Gruenbacher, M. Lechner, R. Hasani, D. Rus, T.A. Henzinger, S.A. Smolka, R. Grosu, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 6755–6764.

Stability verification in stochastic control systems via neural network supermartingales
M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 7326–7336.

Learning stabilizing policies in stochastic control systems
D. Zikelic, M. Lechner, K. Chatterjee, T.A. Henzinger, ArXiv (n.d.).

Learning control policies for stochastic systems with reach-avoid guarantees
D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, ArXiv (n.d.).

Scalable verification of quantized neural networks
T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.

Infinite time horizon safety of Bayesian neural networks
M. Lechner, Ð. dikeli, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.

Synthesis of hybrid automata with affine dynamics from time-series data
M. Garcia Soto, T.A. Henzinger, C. Schilling, in:, HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control, Association for Computing Machinery, 2021, p. 2102.12734.

Bidding mechanisms in graph games
G. Avni, T.A. Henzinger, . dikeli, Journal of Computer and System Sciences 119 (2021) 133–144.

Quantitative and approximate monitoring
T.A. Henzinger, N.E. Sarac, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021.

Long lived transients in gene regulation
T. Petrov, C. Igler, A. Sezgin, T.A. Henzinger, C.C. Guet, Theoretical Computer Science 893 (2021) 1–16.

Differential monitoring
F. Mühlböck, T.A. Henzinger, in:, International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 231–243.

Differential monitoring
F. Mühlböck, T.A. Henzinger, Differential Monitoring, IST Austria, 2021.

Determinacy in discrete-bidding infinite-duration games
M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science 17 (2021) 10:1-10:23.

Adversarial training is not ready for robot learning
M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International Conference on Robotics and Automation, 2021, pp. 4140–4147.

Into the unknown: active monitoring of neural networks
A. Lukina, C. Schilling, T.A. Henzinger, in:, 21st International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 42–61.

Monitoring event frequencies
T. Ferrere, T.A. Henzinger, B. Kragl, in:, 28th EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

Multi-dimensional long-run average problems for vector addition systems with states
K. Chatterjee, T.A. Henzinger, J. Otop, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

A survey of bidding games on graphs
G. Avni, T.A. Henzinger, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

Formal methods with a touch of magic
P.A. Alamdari, G. Avni, T.A. Henzinger, A. Lukina, in:, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–147.

How many bits does it take to quantize your neural network?
M. Giacobbe, T.A. Henzinger, M. Lechner, in:, International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2020, pp. 79–97.

Dynamic resource allocation games
G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020) 42–55.

Outside the box: Abstraction-based monitoring of neural networks
T.A. Henzinger, A. Lukina, C. Schilling, in:, 24th European Conference on Artificial Intelligence, IOS Press, 2020, pp. 2433–2440.

Neural circuit policies enabling auditable autonomy
M. Lechner, R. Hasani, A. Amini, T.A. Henzinger, D. Rus, R. Grosu, Nature Machine Intelligence 2 (2020) 642–652.

Monitorability under assumptions
T.A. Henzinger, N.E. Sarac, in:, Runtime Verification, Springer Nature, 2020, pp. 3–18.

Refinement for structured concurrent programs
B. Kragl, S. Qadeer, T.A. Henzinger, in:, Computer Aided Verification, Springer Nature, 2020, pp. 275–298.

Inductive sequentialization of asynchronous programs
B. Kragl, C. Enea, T.A. Henzinger, S.O. Mutluergil, S. Qadeer, in:, Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 227–242.

Bidding games on Markov decision processes
G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:,  Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12.

Designing worm-inspired neural networks for interpretable robotic control
M. Lechner, R. Hasani, M. Zimmer, T.A. Henzinger, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2019.

Determinacy in discrete-bidding infinite-duration games
M. Aghajohari, G. Avni, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.

Long-run average behavior of vector addition systems with states
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.

Continuous-time models for system design and analysis
R. Alur, M. Giacobbe, T.A. Henzinger, K.G. Larsen, M. Mikudionis, in:, B. Steffen, G. Woeginger (Eds.), Computing and Software Science, Springer Nature, 2019, pp. 452–477.

Bidding mechanisms in graph games
G. Avni, T.A. Henzinger, D. Zikelic, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.

Run-time optimization for learned controllers through quantitative games
G. Avni, R. Bloem, K. Chatterjee, T.A. Henzinger, B. Konighofer, S. Pranger, in:, 31st International Conference on Computer-Aided Verification, Springer, 2019, pp. 630–649.

Membership-based synthesis of linear hybrid automata
M. Garcia Soto, T.A. Henzinger, C. Schilling, L. Zeleznik, in:, 31st International Conference on Computer-Aided Verification, Springer, 2019, pp. 297–314.

Infinite-duration bidding games
G. Avni, T.A. Henzinger, V.K. Chonev, Journal of the ACM 66 (2019).

Transient memory in gene regulation
C.C. Guet, T.A. Henzinger, C. Igler, T. Petrov, A. Sezgin, in:, 17th International Conference on Computational Methods in Systems Biology, Springer Nature, 2019, pp. 155–187.

Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty
H. Kong, E. Bartocci, Y. Jiang, T.A. Henzinger, in:, 17th International Conference on Formal Modeling and Analysis of Timed Systems, Springer Nature, 2019, pp. 123–141.

Handbook of Model Checking
E.M. Clarke, T.A. Henzinger, H. Veith, R. Bloem, Handbook of Model Checking, 1st ed., Springer Nature, Cham, 2018.

Graph games and reactive synthesis
R. Bloem, K. Chatterjee, B. Jobstmann, in:, T.A. Henzinger, E.M. Clarke, H. Veith, R. Bloem (Eds.), Handbook of Model Checking, 1st ed., Springer, 2018, pp. 921–962.

Introduction to model checking
E. Clarke, T.A. Henzinger, H. Veith, in:, T.A. Henzinger (Ed.), Handbook of Model Checking, Springer, 2018, pp. 1–26.

Computing average response time
K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani (Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.

Synchronizing the asynchronous
B. Kragl, S. Qadeer, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.

A theory of register monitors
T. Ferrere, T.A. Henzinger, E. Saraç, in:, IEEE, 2018, pp. 394–403.

Infinite-duration poorman-bidding games
G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.

Monitoring temporal logic with clock variables
A. Elgyütt, T. Ferrere, T.A. Henzinger, in:, Springer, 2018, pp. 53–70.

Reachable set over-approximation for nonlinear systems using piecewise barrier tubes
H. Kong, E. Bartocci, T.A. Henzinger, in:, Springer, 2018, pp. 449–467.

Space-time interpolants
G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2018, pp. 468–486.

Keynote: The first-order logic of signals
A. Bakhirkin, T. Ferrere, T.A. Henzinger, D. Nickovicl, in:, 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10.

Contracts for system design
A. Benveniste, D. Nickovic, B. Caillaud, R. Passerone, J.B. Raclet, P. Reinkemeier, A. Sangiovanni-Vincentelli, W. Damm, T.A. Henzinger, K.G. Larsen, Foundations and Trends in Electronic Design Automation 12 (2018) 124–400.

Faster statistical model checking for unbounded temporal properties
P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017).

Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).

Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).

The cost of exactness in quantitative reachability
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017, pp. 367–381.

Challenges and tool implementation of hybrid rapidly exploring random trees
S. Bak, S. Bogomolov, T.A. Henzinger, A. Kumar, in:, A. Abate, S. Bodo (Eds.), Springer, 2017, pp. 83–89.

Synchronizing the asynchronous
T.A. Henzinger, B. Kragl, S. Qadeer, Synchronizing the Asynchronous, IST Austria, 2017.

Safety verification of nonlinear hybrid systems based on invariant clusters
H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, T.A. Henzinger, in:, Proceedings of the 20th International Conference on Hybrid Systems, ACM, 2017, pp. 163–172.

Bidirectional nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Infinite-duration bidding games
G. Avni, T.A. Henzinger, V.K. Chonev, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Conic abstractions for hybrid systems
S. Bogomolov, M. Giacobbe, T.A. Henzinger, H. Kong, in:, Springer, 2017, pp. 116–132.

Counterexample guided refinement of template polyhedra
S. Bogomolov, G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2017, pp. 589–606.

From non-preemptive to preemptive scheduling using synchronization synthesis
P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta, T. Tarrach, Formal Methods in System Design 50 (2017) 97–139.

Model checking the evolution of gene regulatory networks
M. Giacobbe, C.C. Guet, A. Gupta, T.A. Henzinger, T. Paixao, T. Petrov, Acta Informatica 54 (2017) 765–787.

Model measuring for discrete and hybrid systems
T.A. Henzinger, J. Otop, Nonlinear Analysis: Hybrid Systems 23 (2017) 166–190.

Computing scores of forwarding schemes in switched networks with probabilistic faults
G. Avni, S. Goel, T.A. Henzinger, G. Rodríguez Navas, in:, Springer, 2017, pp. 169–187.

Quantitative fair simulation games
K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Information and Computation 254 (2017) 143–166.

Preface of the special issue in memoriam Helmut Veith
G. Gottlob, T.A. Henzinger, G. Weißenbacher, Formal Methods in System Design 51 (2017) 267–269.

Nested weighted limit-average automata of bounded width
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.

Local linearizability for concurrent container-type data structures
A. Haas, T.A. Henzinger, A. Holzer, C. Kirsch, M. Lippautz, H. Payer, A. Sezgin, A. Sokolova, H. Veith, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.

Quantitative automata under probabilistic semantics
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings of the 31st Annual ACM/IEEE Symposium, IEEE, 2016, pp. 76–85.

Discrete abstraction of multiaffine systems
H. Kong, E. Bartocci, S. Bogomolov, R. Grosu, T.A. Henzinger, Y. Jiang, C. Schilling, in:, Springer, 2016, pp. 128–144.

Quantitative monitor automata
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Springer, 2016, pp. 23–38.

Scalable static hybridization methods for analysis of nonlinear systems
S. Bak, S. Bogomolov, T.A. Henzinger, T. Johnson, P. Prakash, in:, Springer, 2016, pp. 155–164.

PSYNC: A partially synchronous language for fault-tolerant distributed algorithms
C. Dragoi, T.A. Henzinger, D. Zufferey, in:, ACM, 2016, pp. 400–415.

Lipschitz robustness of timed I/O systems
T.A. Henzinger, J. Otop, R. Samanta, in:, Springer, 2016, pp. 250–267.

Adaptive moment closure for parameter inference of biochemical reaction networks
C. Schilling, S. Bogomolov, T.A. Henzinger, A. Podelski, J. Ruess, Biosystems 149 (2016) 15–25.

Dynamic resource allocation games
G. Avni, T.A. Henzinger, O. Kupferman, in:, Springer, 2016, pp. 153–166.

Linear distances between Markov chains
P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.

Faster statistical model checking for unbounded temporal properties
P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Springer, 2016, pp. 112–129.

Abstraction-driven concolic testing
P. Daca, A. Gupta, T.A. Henzinger, in:, Springer, 2016, pp. 328–347.

Array folds logic
P. Daca, T.A. Henzinger, A. Kupriyanov, in:, Springer, 2016, pp. 230–248.

The need for language support for fault-tolerant distributed systems
C. Dragoi, T.A. Henzinger, D. Zufferey, 32 (2015) 90–102.

Adaptive moment closure for parameter inference of biochemical reaction networks
S. Bogomolov, T.A. Henzinger, A. Podelski, J. Ruess, C. Schilling, 9308 (2015) 77–89.

The complexity of multi-mean-payoff and multi-energy games
Y. Velner, K. Chatterjee, L. Doyen, T.A. Henzinger, A. Rabinovich, J. Raskin, Information and Computation 241 (2015) 177–196.

Guest editors' introduction to special issue on computational methods in systems biology
A. Gupta, T.A. Henzinger, ACM Transactions on Modeling and Computer Simulation 25 (2015).

Segment abstraction for worst-case execution time analysis
P. Cerny, T.A. Henzinger, L. Kovács, A. Radhakrishna, J. Zwirchmayr, 9032 (2015) 105–131.

The equivalence problem for finite automata: Technical perspective
T.A. Henzinger, J. Raskin, Communications of the ACM 58 (2015) 86–86.

Succinct representation of concurrent trace sets
A. Gupta, T.A. Henzinger, A. Radhakrishna, R. Samanta, T. Tarrach, in:, ACM, 2015, pp. 433–444.

Aspect-oriented linearizability proofs
S. Chakraborty, T.A. Henzinger, A. Sezgin, V. Vafeiadis, Logical Methods in Computer Science 11 (2015).

Randomness for free
K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation 245 (2015) 3–16.

Measuring and synthesizing systems in probabilistic environments
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, Journal of the ACM 62 (2015).

Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015.

Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2015.

The target discounted-sum problem
U. Boker, T.A. Henzinger, J. Otop, in:, LICS, IEEE, 2015, pp. 750–761.

Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International Colloquium, Springer Nature, 2015, pp. 121–133.

The target discounted-sum problem
U. Boker, T.A. Henzinger, J. Otop, The Target Discounted-Sum Problem, IST Austria, 2015.

Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for Pushdown Automata, IST Austria, 2015.

Complete composition operators for IOCO-testing theory
N. Benes, P. Daca, T.A. Henzinger, J. Kretinsky, D. Nickovic, in:, ACM, 2015, pp. 101–110.

From non-preemptive to preemptive scheduling using synchronization synthesis
P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta, T. Tarrach, 9207 (2015) 180–197.

Model checking gene regulatory networks
M. Giacobbe, C.C. Guet, A. Gupta, T.A. Henzinger, T. Paixao, T. Petrov, 9035 (2015) 469–483.

A logic-based framework for verifying consensus algorithms
C. Dragoi, T.A. Henzinger, H. Veith, J. Widder, D. Zufferey, in:, Springer, 2014, pp. 161–181.

Probabilistic programming
A. Gordon, T.A. Henzinger, A. Nori, S. Rajamani, in:, Proceedings of the on Future of Software Engineering, ACM, 2014, pp. 167–181.

Lipschitz robustness of finite-state transducers
T.A. Henzinger, J. Otop, R. Samanta, in:, Leibniz International Proceedings in Informatics, LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 431–443.

Synthesizing robust systems
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, G. Hofferek, B. Jobstmann, B. Könighofer, R. Könighofer, Acta Informatica 51 (2014) 193–220.

Exact and approximate determinization of discounted-sum automata
U. Boker, T.A. Henzinger, Logical Methods in Computer Science 10 (2014).

Battery transition systems
U. Boker, T.A. Henzinger, A. Radhakrishna, in:, ACM, 2014, pp. 595–606.

Interface simulation distances
P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363.

Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 15 (2014).

Compositional specifications for IOCO testing
P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, Compositional Specifications for IOCO Testing, IST Austria, 2014.

Model measuring for hybrid systems
T.A. Henzinger, J. Otop, in:, Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, Springer, 2014, pp. 213–222.

From model checking to model measuring
T.A. Henzinger, J. Otop, From Model Checking to Model Measuring, IST Austria, 2014.

Model measuring for hybrid systems
T.A. Henzinger, J. Otop, Model Measuring for Hybrid Systems, IST Austria, 2014.

Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.

Regression-free synthesis for concurrency
P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer, 2014, pp. 568–584.

Compositional specifications for IOCO testing
P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, in:, IEEE 7th International Conference on Software Testing, Verification and Validation, IEEE, 2014.

Quantitative fair simulation games
K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Quantitative Fair Simulation Games, IST Austria, 2014.

Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation
A. Haas, M. Lippautz, T.A. Henzinger, H. Payer, A. Sokolova, C.M. Kirsch, A. Sezgin, in:, Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, ACM Press, 2013.

Quantitative relaxation of concurrent data structures
T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–328.

Quantitative abstraction refinement
P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–128.

Quantitative reactive modeling and verification
T.A. Henzinger, Computer Science Research and Development 28 (2013) 331–344.

Computational Methods in Systems Biology
A. Gupta, T.A. Henzinger, eds., Computational Methods in Systems Biology, Springer, 2013.

Synthesis of AMBA AHB from formal specification: A case study
Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 585–601.

Aspect-oriented linearizability proofs
T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.

Strategy improvement for concurrent reachability and turn based stochastic safety games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, Journal of Computer and System Sciences 79 (2013) 640–657.

Mathematical and Engineering Methods in Computer Science
A. Kucera, T.A. Henzinger, J. Nesetril, T. Vojnar, D. Antos, eds., Mathematical and Engineering Methods in Computer Science, Springer, 2013.

How free is your linearizable concurrent data structure?
T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.

Distributed synthesis for LTL fragments
K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, in:, 13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25.

Distributed synthesis for LTL Fragments
K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis for LTL Fragments, IST Austria, 2013.

From model checking to model measuring
T.A. Henzinger, J. Otop, 8052 (2013) 273–287.

Replacing competition with cooperation to achieve scalable lock-free FIFO queues 
T.A. Henzinger, H. Payer, A. Sezgin, Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues , IST Austria, 2013.

Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates
C. Dragoi, A. Gupta, T.A. Henzinger, in:, Computer Aided Verification, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 174–190.

Efficient synthesis for concurrency by semantics-preserving transformations
P. Cerny, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, T. Tarrach, in:, Springer, 2013, pp. 951–967.

Conditional model checking: A technique to pass information between verifiers
D. Beyer, T.A. Henzinger, M. Keremoglu, P. Wendler, in:, Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, ACM, 2012.

The propagation approach for computing biochemical reaction networks
T.A. Henzinger, M. Mateescu, IEEE ACM Transactions on Computational Biology and Bioinformatics 10 (2012) 310–322.

Approximate determinization of quantitative automata
U. Boker, T.A. Henzinger, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–373.

Synthesis from incompatible specifications
P. Cerny, S. Gopi, T.A. Henzinger, A. Radhakrishna, N. Totla, in:, Proceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 53–62.

Quantitative reactive models
T.A. Henzinger, in:, Conference Proceedings MODELS 2012, Springer, 2012, pp. 1–2.

Interface Simulation Distances
P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.

Finite automata with time delay blocks
K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52.

Independent implementability of viewpoints
T.A. Henzinger, D. Nickovic, in:,  Conference Proceedings Monterey Workshop 2012, Springer, 2012, pp. 380–395.

Delayed continuous time Markov chains for genetic regulatory circuits
C.C. Guet, A. Gupta, T.A. Henzinger, M. Mateescu, A. Sezgin, in:, Springer, 2012, pp. 294–309.

Lumpability abstractions of rule based systems
J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, Theoretical Computer Science 431 (2012) 137–164.

A survey of stochastic <9 regular games
K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78 (2012) 394–413.

A survey of partial-observation stochastic parity games
K. Chatterjee, L. Doyen, T.A. Henzinger, Formal Methods in System Design 43 (2012) 268–284.

Synchronous interface theories and time triggered scheduling
B. Delahaye, U. Fahrenberg, T.A. Henzinger, A. Legay, D. Nickovic, in:, Springer, 2012, pp. 203–218.

Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code
A. Ghosal, D. Iercan, C. Kirsch, T.A. Henzinger, A. Sangiovanni Vincentelli, Science of Computer Programming 77 (2012) 96–112.

Simulation distances
P. Cerny, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 413 (2012) 21–35.

Ideal abstractions for well structured transition systems
D. Zufferey, T. Wies, T.A. Henzinger, in:, Springer, 2012, pp. 445–460.

Static scheduling in clouds
T.A. Henzinger, A. Singh, V. Singh, T. Wies, D. Zufferey, in:, USENIX, 2011, pp. 1–6.

Tail approximation for the chemical master equation
T.A. Henzinger, M. Mateescu, in:, Tampere International Center for Signal Processing, 2011.

Propagation models for computing biochemical reaction networks
T.A. Henzinger, M. Mateescu, in:, Springer, 2011, pp. 1–3.

Specification-centered robustness
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–185.

A theory of synchronous relational interfaces
S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2011).

Quantitative evaluation of BFT protocols
R. Halalai, T.A. Henzinger, V. Singh, in:, IEEE, 2011, pp. 255–264.

Qualitative concurrent parity games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 12 (2011).

Biology as reactivity
J. Fisher, D. Harel, T.A. Henzinger, Communications of the ACM 54 (2011) 72–82.

Dynamic reactive modules
J. Fisher, T.A. Henzinger, D. Nickovic, N. Piterman, A. Singh, M. Vardi, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–418.

QUASY: quantitative synthesis tool
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271.

The decidability frontier for probabilistic automata on infinite words
K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).

Formalisms for specifying Markovian population models
T.A. Henzinger, B. Jobstmann, V. Wolf, IJFCS: International Journal of Foundations of Computer Science 22 (2011) 823–841.

Timed parity games: Complexity and robustness
K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).

Determinizing discounted-sum automata
U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.

The complexity of quantitative information flow problems
P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.

Scheduling large jobs by abstraction refinement
T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 329–342.

From boolean to quantitative synthesis
P. Cerny, T.A. Henzinger, in:, ACM, 2011, pp. 149–154.

The complexity of request-response games
K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.

Approximation of event probabilities in noisy cellular processes
F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, Theoretical Computer Science 412 (2011) 2128–2141.

Verification of STM on relaxed memory models
R. Guerraoui, T.A. Henzinger, V. Singh, Formal Methods in System Design 39 (2011) 297–331.

Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.

Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.

Quantitative synthesis for concurrent programs
P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.

ABC: Algebraic Bound Computation for loops
R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118.

Lumpability abstractions of rule-based systems
J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, in:, Open Publishing Association, 2010, pp. 142–161.

SABRE: A tool for the stochastic analysis of biochemical reaction networks
F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2010, pp. 193–194.

Aligators for arrays
T.A. Henzinger, T. Hottelier, L. Kovács, A. Rybalchenko, in:, Springer, 2010, pp. 348–356.

Fast adaptive uniformization of the chemical master equation
F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, IET Systems Biology 4 (2010) 441–452.

Randomness for free
K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, pp. 246–257.

Formal modeling and analysis of timed systems
K. Chatterjee, T.A. Henzinger, eds., Formal Modeling and Analysis of Timed Systems, Springer, 2010.

Robustness in the presence of liveness
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, T. Touili, B. Cook, P. Jackson (Eds.), Springer, 2010, pp. 410–424.

Model checking transactional memories
R. Guerraoui, T.A. Henzinger, V. Singh, Distributed Computing 22 (2010) 129–145.

Solving the chemical master equation using sliding windows
V. Wolf, R. Goel, M. Mateescu, T.A. Henzinger, BMC Systems Biology 4 (2010) 1–19.

From boolean to quantitative notions of correctness
T.A. Henzinger, in:, ACM, 2010, pp. 157–158.

Invariant and type inference for matrices
T.A. Henzinger, T. Hottelier, L. Kovács, A. Voronkov, in:, Springer, 2010, pp. 163–179.

Hybrid numerical solution of the chemical master equation
T.A. Henzinger, M. Mateescu, L. Mikeev, V. Wolf, in:, Springer, 2010, pp. 55–65.

Mean-payoff automaton expressions
K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.

Generalized mean-payoff and energy games
K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–516.

Quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 11 (2010).

Measuring and synthesizing systems in probabilistic environments
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395.

Strategy construction for parity games with imperfect information
D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information and Computation 208 (2010) 1206–1220.

Strategy logic
K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208 (2010) 677–693.

FlexPRICE: Flexible provisioning of resources in a cloud environment
T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, IEEE, 2010, pp. 83–90.

Transactions in the jungle
R. Guerraoui, T.A. Henzinger, M. Kapalka, V. Singh, in:, ACM, 2010, pp. 263–272.

A marketplace for cloud resources
T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2010, pp. 1–8.

Robustness of sequential circuits
L. Doyen, T.A. Henzinger, A. Legay, D. Nickovic, in:, IEEE, 2010, pp. 77–84.

Quantitative Simulation Games
P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Z. Manna, D. Peled (Eds.), Time For Verification: Essays in Memory of Amir Pnueli, Springer, 2010, pp. 42–60.

Shape refinement through explicit heap analysis
D. Beyer, T.A. Henzinger, G. Théoduloz, D. Zufferey, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 263–277.

Expressiveness and closure properties for quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23.

Simulation distances
P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–268.

Quantitative synthesis for concurrent programs
K. Chatterjee, P. Cerny, T.A. Henzinger, A. Radhakrishna, R. Singh, Quantitative Synthesis for Concurrent Programs, IST Austria, 2010.

Simulation distances
P. Cerny, T.A. Henzinger, A. Radhakrishna, Simulation Distances, IST Austria, 2010.

GIST: A solver for probabilistic games
K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.

Probabilistic Automata on infinite words: decidability and undecidability results
K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.

Qualitative analysis of partially-observable Markov Decision Processes
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.

Forward analysis of depth-bounded processes
T. Wies, D. Zufferey, T.A. Henzinger, in:, L. Ong (Ed.), Springer, 2010, pp. 94–108.

Probabilistic systems with limsup and liminf objectives
K. Chatterjee, T.A. Henzinger, in:, Springer, 2009, pp. 32–45.

Fast adaptive uniformization of the chemical master equation
F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2009, pp. 118–127.

Formalisms for specifying Markovian population models
T.A. Henzinger, B. Jobstmann, V. Wolf, in:, Springer, 2009, pp. 3–23.

Distributed, modular HTL
T.A. Henzinger, C. Kirsch, E. Marques, A. Sokolova, in:, IEEE, 2009, pp. 171–180.

Probabilistic weighted automata
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 244–258.

Finitary winning in omega-regular games
K. Chatterjee, T.A. Henzinger, F. Horn, ACM Transactions on Computational Logic (TOCL) 11 (2009).

On relational interfaces
S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, in:, EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, ACM, 2009, pp. 67–76.

Synthesizing robust systems
R. Bloem, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, Springer, 2009, pp. 85–92.

Software transactional memory on relaxed memory models
R. Guerraoui, T.A. Henzinger, V. Singh, in:, Springer, 2009, pp. 321–336.

Sliding-window abstraction for infinite Markov chains
T.A. Henzinger, M. Mateescu, V. Wolf, in:, Springer, 2009, pp. 337–352.

Approximation of event probabilities in noisy cellular processes
F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, Springer, 2009, pp. 173–188.

Alternating weighted automata
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 3–13.

A survey of stochastic games with limsup and liminf objectives
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 1–15.

Stochastic games with finitary objectives
K. Chatterjee, T.A. Henzinger, F. Horn, in:, Springer, 2009, pp. 34–54.

Termination criteria for solving concurrent safety and reachability games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, SIAM, 2009, pp. 197–206.

Expressiveness and closure properties for quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, IEEE, 2009, pp. 199–208.

Better quality in synthesis through quantitative objectives
R. Bloem, K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Springer, 2009, pp. 140–156.

Alpaga: A tool for solving parity games with imperfect information
D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 58–61.

Gist: A solver for probabilistic games
K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, Gist: A Solver for Probabilistic Games, IST Austria, 2009.

Improved lower bounds for request-response and finitary Streett games
K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.

Qualitative analysis of partially-observable Markov decision processes
K. Chatterjee, L. Doyen, T.A. Henzinger, Qualitative Analysis of Partially-Observable Markov Decision Processes, IST Austria, 2009.

Model-checking omega-regular properties of interval Markov chains
K. Chatterjee, T.A. Henzinger, K. Sen, in:, Springer, 2008, pp. 302–317.

Controller synthesis with budget constraints
K. Chatterjee, R. Majumdar, T.A. Henzinger, in:, Springer, 2008, pp. 72–86.

Timed parity games: complexity and robustness
K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Springer, 2008, pp. 124–140.

Environment assumptions for synthesis
K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 147–161.

Trading infinite memory for uniform randomness in timed games
K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Springer, 2008, pp. 87–100.

Quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2008, pp. 385–400.

Value iteration
K. Chatterjee, T.A. Henzinger, in:, 25 Years in Model Checking, Springer, 2008, pp. 107–138.

Strategy construction for parity games with imperfect information
D. Berwanger, K. Chatterjee, L. Doyen, T.A. Henzinger, S. Raje, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 325–339.

Model checking transactional memories
R. Guerraoui, T.A. Henzinger, B. Jobstmann, V. Singh, in:, ACM, 2008, pp. 372–382.

Permissiveness in transactional memories
R. Guerraoui, T.A. Henzinger, V. Singh, in:, Springer, 2008, pp. 305–319.

Completeness and nondeterminism in model checking transactional memories
R. Guerraoui, T.A. Henzinger, V. Singh, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 21–35.

Valigator: A verification tool with bound and invariant generation
T.A. Henzinger, T. Hottelier, L. Kovács, in:, Springer, 2008, pp. 333–342.

Two challenges in embedded systems design: Predictability and robustness
T.A. Henzinger, Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences 366 (2008) 3727–3736.

Proving non-termination
A. Gupta, T.A. Henzinger, R. Majumdar, A. Rybalchenko, R. Xu, in:, ACM, 2008, pp. 147–158.

Bounded asynchrony: Concurrency for modeling cell-cell interactions
J. Fisher, T.A. Henzinger, M. Mateescu, N. Piterman, in:, Springer, 2008, pp. 17–32.

Equivalence of labeled Markov chains
L. Doyen, T.A. Henzinger, J. Raskin, International Journal of Foundations of Computer Science 19 (2008) 549–563.

Interface theories with component reuse
L. Doyen, T.A. Henzinger, B. Jobstmann, T. Petrov, in:, ACM, 2008, pp. 79–88.

Reduction of stochastic parity to stochastic mean-payoff games
K. Chatterjee, T.A. Henzinger, Information Processing Letters 106 (2008) 1–7.

Logical reliability of interacting real-time tasks
K. Chatterjee, A. Ghosal, T.A. Henzinger, D. Iercan, C. Kirsch, C. Pinello, A. Sangiovanni Vincentelli, in:, IEEE, 2008, pp. 909–914.

Stochastic limit-average games are in EXPTIME
K. Chatterjee, R. Majumdar, T.A. Henzinger, International Journal of Game Theory 37 (2008) 219–234.

Program analysis with dynamic change of precision
D. Beyer, T.A. Henzinger, G. Théoduloz, in:, ACM, 2008, pp. 29–38.

Generalized parity games
K. Chatterjee, T.A. Henzinger, N. Piterman, in:, Springer, 2007, pp. 153–167.

Strategy logic
K. Chatterjee, T.A. Henzinger, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007, pp. 59–73.

Algorithms for interface synthesis
D. Beyer, T.A. Henzinger, V. Singh, in:, Springer, 2007, pp. 4–19.

Qualitative networks: A symbolic approach to analyze biological signaling networks
M. Schaub, T.A. Henzinger, J. Fisher, BMC Systems Biology 1 (2007).

Abstract counterexample-based refinement for powerset domains
R. Manevich, J. Field, T.A. Henzinger, G. Ramalingam, M. Sagiv, in:, Program Analysis and Compilation, Theory and Practice: Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday, Springer, 2007, pp. 273–292.

The embedded machine: Predictable, portable real-time code
T.A. Henzinger, C. Kirsch, ACM Transactions on Programming Languages and Systems (TOPLAS) 29 (2007).

Games, time, and probability: Graph models for system design and analysis
T.A. Henzinger, in:, Springer, 2007, pp. 103–110.

Quantitative generalizations of languages
T.A. Henzinger, in:, Springer, 2007, pp. 20–22.

Predictive modeling of signaling crosstalk during C. elegans vulval development
J. Fisher, N. Piterman, A. Hajnal, T.A. Henzinger, PLoS Computational Biology 3(5):e92 (2007).

Executable cell biology
J. Fisher, T.A. Henzinger, Nature Biotechnology 25 (2007) 1239–1249.

CSL: Computer Science Logic 
J. Duparc, T.A. Henzinger, CSL: Computer Science Logic , Springer, 2007.

Assume-guarantee synthesis
K. Chatterjee, T.A. Henzinger, in:, Springer, 2007, pp. 261–275.

Algorithms for omega-regular games with imperfect information
K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, Logical Methods in Computer Science 3 (2007) 1–23.

The software model checker BLAST: Applications to software engineering
D. Beyer, T.A. Henzinger, R. Jhala, R. Majumdar, International Journal on Software Tools for Technology Transfer 9 (2007) 505–525.

Minimum-time reachability in timed games
T. Brihaye, T.A. Henzinger, V. Prabhu, J. Raskin, in:, Springer, 2007, pp. 825–837.

Configurable software verification: Concretizing the convergence of model checking and program analysis
D. Beyer, T.A. Henzinger, G. Théoduloz, in:, Springer, 2007, pp. 504–518.

Invariant synthesis for combined theories
D. Beyer, T.A. Henzinger, R. Majumdar, A. Rybalchenko, in:, Springer, 2007, pp. 378–394.

Path invariants
D. Beyer, T.A. Henzinger, R. Majumdar, A. Rybalchenko, in:, ACM, 2007, pp. 300–309.

An application of web-service interfaces
D. Beyer, A. Chakrabarti, T.A. Henzinger, S. Seshia, in:, IEEE, 2007, pp. 831–838.

Concurrent reachability games
L. De Alfaro, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 386 (2007) 188–217.

Algorithms for Büchi Games
K. Chatterjee, T.A. Henzinger, N. Piterman, in:, ACM, 2006.

The complexity of quantitative concurrent parity games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, SIAM, 2006, pp. 678–687.

Algorithms for omega-regular games with imperfect information
K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Springer, 2006, pp. 287–302.

Strategy improvement for stochastic Rabin and Streett games
K. Chatterjee, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2006, pp. 375–389.

Antichains: A new algorithm for checking universality of finite automata
M. De Wulf, L. Doyen, T.A. Henzinger, J. Raskin, in:, Springer, 2006, pp. 17–30.

Solving games without determinization
T.A. Henzinger, N. Piterman, in:, Springer, 2006, pp. 395–410.

An interface algebra for real-time components
T.A. Henzinger, S. Matic, in:, IEEE, 2006, pp. 253–266.

Timed alternating-time temporal logic
T.A. Henzinger, V. Prabhu, in:, Springer, 2006, pp. 1–17.

The embedded systems design challenge
T.A. Henzinger, J. Sifakis, in:, Springer, 2006, pp. 1–15.

On the universal and existential fragments of the mu-calculus
T.A. Henzinger, O. Kupferman, R. Majumdar, Theoretical Computer Science 354 (2006) 173–186.

Synergy: A new algorithm for property checking
B. Gulavani, T.A. Henzinger, Y. Kannan, A. Nori, S. Rajamani, in:, ACM, 2006, pp. 117–127.

A hierarchical coordination language for interacting real-time tasks
A. Ghosal, T.A. Henzinger, D. Iercan, C. Kirsch, A. Sangiovanni Vincentelli, in:, ACM, 2006, pp. 132–141.

Executable biology
J. Fisher, T.A. Henzinger, in:, IEEE, 2006, pp. 1675–1682.

Finitary winning in omega-regular games
K. Chatterjee, T.A. Henzinger, in:, Springer, 2006, pp. 257–271.

Strategy improvement and randomized subexponential algorithms for stochastic parity games
K. Chatterjee, T.A. Henzinger, in:, Springer, 2006, pp. 512–523.

Markov decision processes with multiple objectives
K. Chatterjee, R. Majumdar, T.A. Henzinger, in:, Springer, 2006, pp. 325–336.

Games with secure equilibria
K. Chatterjee, T.A. Henzinger, M. Jurdziski, Theoretical Computer Science 365 (2006) 67–82.

Compositional quantitative reasoning
K. Chatterjee, L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga, in:, IEEE, 2006, pp. 179–188.

Strategy improvement for concurrent reachability games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, IEEE, 2006, pp. 291–300.

Lazy shape analysis
D. Beyer, T.A. Henzinger, G. Théoduloz, in:, Springer, 2006, pp. 532–546.

Games with secure equilibria
K. Chatterjee, T.A. Henzinger, M. Jurdziski, in:, Springer, 2005, pp. 141–161.

Trading end-to-end latency for composability
S. Matic, T.A. Henzinger, in:, IEEE, 2005, pp. 99–110.

A programmable microkernel for real-time systems
C. Kirsch, M. Sanvido, T.A. Henzinger, in:, ACM, 2005, pp. 35–45.

A classification of symbolic transition systems
T.A. Henzinger, R. Majumdar, J. Raskin, ACM Transactions on Computational Logic (TOCL) 6 (2005) 1–32.

Quantifying similarities between timed systems
T.A. Henzinger, R. Majumdar, V. Prabhu, in:, Springer, 2005, pp. 226–241.

Permissive interfaces
T.A. Henzinger, R. Jhala, R. Majumdar, in:, ACM, 2005, pp. 31–40.

Composable code generation for distributed Giotto
T.A. Henzinger, C. Kirsch, S. Matic, in:, ACM, 2005, pp. 21–30.

Automatic rectangular refinement of affine hybrid systems
L. Doyen, T.A. Henzinger, J. Raskin, in:, Springer, 2005, pp. 144–161.

Semiperfect-information games
K. Chatterjee, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2005, pp. 1–18.

The complexity of stochastic Rabin and Streett games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, Springer, 2005, pp. 878–890.

Mean-payoff parity games
K. Chatterjee, T.A. Henzinger, M. Jurdziski, in:, IEEE, 2005, pp. 178–187.

Verifying quantitative properties using bound functions
A. Chakrabarti, K. Chatterjee, T.A. Henzinger, O. Kupferman, R. Majumdar, in:, Springer, 2005, pp. 50–64.

Counterexample-guided planning
K. Chatterjee, T.A. Henzinger, R. Jhala, R. Majumdar, in:, AUAI Press, 2005, pp. 104–111.

Checking memory safety with BLAST
D. Beyer, T.A. Henzinger, R. Jhala, R. Majumdar, in:, Springer, 2005, pp. 2–18.

Web service interfaces
D. Beyer, A. Chakrabarti, T.A. Henzinger, in:, ACM, 2005, pp. 148–159.

Model checking discounted temporal properties
L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga, Theoretical Computer Science 345 (2005) 139–170.

Interface-based design
L. De Alfaro, T.A. Henzinger, in:, Springer, 2005, pp. 83–104.

Games with secure equilibria
K. Chatterjee, T.A. Henzinger, M. Jurdziski, in:, IEEE, 2004, pp. 160–169.

A typed assembly language for real-time programs
T.A. Henzinger, C. Kirsch, in:, ACM, 2004, pp. 104–113.

Abstractions from proofs
T.A. Henzinger, R. Jhala, R. Majumdar, K. Mcmillan, in:, ACM, 2004, pp. 232–244.

Extreme model checking
T.A. Henzinger, R. Jhala, R. Majumdar, M. Sanvido, in:, Verification: Theory and Practice, Springer, 2004, pp. 332–358.

Race checking by context inference
T.A. Henzinger, R. Jhala, R. Majumdar, in:, ACM, 2004, pp. 1–13.

Event-driven programming with logical execution times
A. Ghosal, T.A. Henzinger, C. Kirsch, M. Sanvido, in:, Springer, 2004, pp. 167–170.

Trading memory for randomness
K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, IEEE, 2004, pp. 206–217.

Quantitative stochastic parity games
K. Chatterjee, M. Jurdziski, T.A. Henzinger, in:, SIAM, 2004, pp. 121–130.

Stack size analysis for interrupt-driven programs
K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, J. Palsberg, Information and Computation 194 (2004) 144–174.

The BLAST query language for software verification
D. Beyer, A. Chlipala, T.A. Henzinger, R. Jhala, R. Majumdar, in:, Springer, 2004, pp. 2–18.

An eclipse plug-in for model checking
D. Beyer, T.A. Henzinger, R. Jhala, R. Majumdar, in:, IEEE, 2004, pp. 251–255.

Generating tests from counterexamples
D. Beyer, A. Chlipala, T.A. Henzinger, R. Jhala, R. Majumdar, in:, IEEE, 2004, pp. 326–335.

Model checking discounted temporal properties
L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga, in:, Springer, 2004, pp. 77–92.

Simple stochastic parity games
K. Chatterjee, M. Jurdziski, T.A. Henzinger, in:, Springer, 2003, pp. 100–113.

Stack size analysis for interrupt-driven programs
K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, J. Palsberg, in:, Springer, 2003, pp. 109–126.

Discounting the future in systems theory
L. De Alfaro, T.A. Henzinger, R. Majumdar, in:, Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Springer, 2003, pp. 1022–1037.

Resource interfaces
A. Chakrabarti, L. De Alfaro, T.A. Henzinger, M. Stoelinga, in:, Third International Conference on Embedded Software, ACM, 2003, pp. 117–133.

The element of surprise in timed games
L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga, in:, Proceedings of the 14th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2003, pp. 144–158.

From control models to real-time code using Giotto
T.A. Henzinger, C. Kirsch, M. Sanvido, W. Pree, IEEE Control Systems Magazine 23 (2003) 50–64.

Embedded control systems development with Giotto
T.A. Henzinger, B. Horowitz, C. Kirsch, in:, Software-Enabled Control: Information Technology for Dynamical Systems, Wiley-Blackwell, 2003, pp. 123–146.

On the universal and existential fragments of the mu-calculus
T.A. Henzinger, O. Kupferman, R. Majumdar, in:, Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , Springer, 2003, pp. 49–64.

Software verification with BLAST
T.A. Henzinger, R. Jhala, R. Majumdar, G. Sutre, in:, Proceedings of the 10th International SPIN Workshop , Springer, 2003, pp. 235–239.

Thread-modular abstraction refinement
T.A. Henzinger, R. Jhala, R. Majumdar, S. Qadeer, in:, Proceedings of the 15th International Conference on Computer Aided Verification, Springer, 2003, pp. 262–274.

Counterexample-guided control
T.A. Henzinger, R. Jhala, R. Majumdar, in:, Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Springer, 2003, pp. 886–902.

Schedule-carrying code
T.A. Henzinger, C. Kirsch, S. Matic, in:, Proceedings of the 3rd International Conference on Embedded Software, ACM, 2003, pp. 241–256.

From pre-historic to post-modern symbolic model checking
T.A. Henzinger, O. Kupferman, S. Qadeer, Formal Methods in System Design 23 (2003) 303–327.

Giotto: A time-triggered language for embedded programming
T.A. Henzinger, B. Horowitz, C. Kirsch, Proceedings of the IEEE 91 (2003) 84–99.

Timed interfaces
L. De Alfaro, T.A. Henzinger, M. Stoelinga, in:, Proceedings of the 2nd International Conference on Embedded Software, ACM, 2002, pp. 108–122.

Synchronous and bidirectional component interfaces
A. Chakrabarti, L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 14th International Conference on Computer Aided Verification, Springer, 2002, pp. 414–427.

A comparison of control problems for timed and hybrid systems
F. Cassez, T.A. Henzinger, J. Raskin, in:, Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control, Springer, 2002, pp. 134–148.

Alternating-time temporal logic
R. Alur, T.A. Henzinger, O. Kupferman, Journal of the ACM 49 (2002) 672–713.

Synthesis of uninitialized systems
T.A. Henzinger, S. Krishnan, O. Kupferman, F. Mang, in:, Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Springer, 2002, pp. 644–656.

Fair simulation
T.A. Henzinger, O. Kupferman, S. Rajamani, Information and Computation 173 (2002) 64–81.

Interface compatibility checking for software modules
A. Chakrabarti, L. De Alfaro, T.A. Henzinger, M. Jurdziski, F. Mang, in:, Proceedings of the 14th International Conference on Computer Aided Verification, Springer, 2002, pp. 428–441.

Temporal safety proofs for systems code
T.A. Henzinger, G. Necula, R. Jhala, G. Sutre, R. Majumdar, W. Weimer, in:, Proceedings of the 14th International Conference on Computer Aided Verification, Springer, 2002, pp. 526–538.

Time-safety checking for embedded programs
T.A. Henzinger, C. Kirsch, R. Majumdar, S. Matic, in:, Proceedings of the 2nd International Conference on Embedded Software, ACM, 2002, pp. 76–92.

The embedded machine: predictable, portable real-time code
T.A. Henzinger, C. Kirsch, in:, Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation, ACM, 2002, pp. 315–326.

Lazy abstraction
T.A. Henzinger, R. Jhala, R. Majumdar, G. Sutre, in:, Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, 2002, pp. 58–70.

An assume-guarantee rule for checking simulation
T.A. Henzinger, S. Qadeer, S. Rajamani, S. Tasiran, ACM Transactions on Programming Languages and Systems (TOPLAS) 24 (2002) 51–64.

Embedded software design and system integration for rotorcraft UAV using platforms
B. Horowitz, J. Liebman, C. Ma, T.J. Koo, T.A. Henzinger, A. Sangiovanni Vincentelli, S. Sastry, in:, Proceedings of the 15th Triennial World Congress of the International Federation of Automatic Control, Elsevier, 2002.

A Giotto-based helicopter control system
C. Kirsch, M. Sanvido, T.A. Henzinger, W. Pree, in:, Proceedings of the 2nd International Conference on Embedded Software, ACM, 2002, pp. 46–60.

Trading probability for fairness
M. Jurdziski, O. Kupferman, T.A. Henzinger, in:, Proceedings of the 16th International Workshop on Computer Science Logic, Springer, 2002, pp. 292–305.

Convertibility verification and converter synthesis: Two faces of the same coin
R. Passerone, L. De Alfaro, T.A. Henzinger, A. Sangiovanni Vincentelli, in:, Proceedings of the 11th IEEE/ACM International Conference on Computer-Aided Design, IEEE, 2002, pp. 132–139.

Axioms for real-time logics
J. Raskin, P. Schobbens, T.A. Henzinger, Theoretical Computer Science 274 (2002) 151–182.

The control of synchronous systems, Part II
L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 12th International Conference on on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 566–581.

Symbolic algorithms for infinite-state games
L. De Alfaro, T.A. Henzinger, R. Majumdar, in:, Proceedings of the 12th International Conference on on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 536–550.

From verification to control: dynamic programs for omega-regular objectives
L. De Alfaro, T.A. Henzinger, R. Majumdar, in:, Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, IEEE, 2001, pp. 279–290.

MCWEB: A model-checking tool for web-site debugging
L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 10th International Conference on World Wide Web, ACM, 2001, pp. 86–87.

Compositional methods for probabilistic systems
L. De Alfaro, T.A. Henzinger, R. Jhala, in:, Proceedings of the 12th International Conference on on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 351–365.

jMocha: A model-checking tool that exploits design structure
R. Alur, L. De Alfaro, R. Grosu, T.A. Henzinger, M. Kang, C. Kirsch, R. Majumdar, F. Mang, B. Wang, in:, Proceedings of the 23rd International Conference on Software Engineering, IEEE, 2001, pp. 835–836.

Partial-order reduction in symbolic state-space exploration
R. Alur, R. Brayton, T.A. Henzinger, S. Qadeer, S. Rajamani, Formal Methods in System Design 18 (2001) 97–116.

Interface automata
L. De Alfaro, T.A. Henzinger, in:, Proceedings of the 8th European Software Engineering Conference, ACM, 2001, pp. 109–120.

Interface theories for component-based design
L. De Alfaro, T.A. Henzinger, in:, Proceedings of the 1st International Workshop on Embedded Software, ACM, 2001, pp. 148–165.

A reusable and platform-independent framework for distributed control systems
T. Brown, A. Pasetti, W. Pree, T.A. Henzinger, C. Kirsch, in:, Proceedings of the 20th Digital Avionics Systems Conference, IEEE, 2001, pp. 1–11.

Assume-guarantee reasoning for hierarchical hybrid systems
T.A. Henzinger, M. Minea, V. Prabhu, in:, Proceedings of the 4th International Workshop on Hybrid Systems, Springer, 2001, pp. 275–290.

Embedded control systems development with Giotto
T.A. Henzinger, B. Horowitz, C. Kirsch, in:, Proceedings of the 2nd ACM SIGPLAN Workshop on Languages, Compilers and Tools for Embedded Systems, ACM, 2001, pp. 64–72.

Giotto: A time-triggered language for embedded programming
T.A. Henzinger, B. Horowitz, C. Kirsch, in:, Proceedings of the 1st International Workshop on Embedded Software, ACM, 2001, pp. 166–184.

Some lessons from the HYTECH experience
T.A. Henzinger, J. Preussig, H. Wong Toi, in:, Proceedings of the 40th IEEE Conference on Decision and Control, IEEE, 2001, pp. 2887–2892.

EMSOFT: Embedded Software
T.A. Henzinger, ed., EMSOFT: Embedded Software, ACM, 2001.

The control of synchronous systems
L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 11th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2000, pp. 458–473.

Detecting errors before reaching them
L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 12th International Conference on Computer Aided Verification, Springer, 2000, pp. 186–201.

Concurrent omega-regular games
L. De Alfaro, T.A. Henzinger, in:, Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, IEEE, 2000, pp. 141–154.

Masaccio: A formal model for embedded components
T.A. Henzinger, in:, Proceedings of the 1st International Conference on Theoretical Computer Science , Springer, 2000, pp. 549–563.

Discrete abstractions of hybrid systems
R. Alur, T.A. Henzinger, G. Lafferriere, G. Pappas, Proceedings of the IEEE 88 (2000) 971–984.

Abstract interpretation of game properties
T.A. Henzinger, R. Majumdar, F. Mang, J. Raskin, in:, Proceedings of the 7th International Symposium on Static Analysis, Springer, 2000, pp. 220–239.

Beyond HyTech: Hybrid systems analysis using interval numerical methods
T.A. Henzinger, B. Horowitz, R. Majumdar, H. Wong Toi, in:, Proceedings of the 3rd International Workshop on Hybrid Systems, Springer, 2000, pp. 130–144.

Decomposing refinement proofs using assume-guarantee reasoning
T.A. Henzinger, S. Qadeer, S. Rajamani, in:, Proceedings of the 2000 International Conference on Computer-Aided Design, IEEE, 2000, pp. 245–252.

The theory of hybrid automata
T.A. Henzinger, in:, M. Inan, R. Kurshan (Eds.), Verification of Digital and Hybrid Systems, Springer, 2000, pp. 265–292.

Fair bisimulation
T.A. Henzinger, S. Rajamani, in:, Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2000, pp. 299–314.

A classification of symbolic transition systems
T.A. Henzinger, R. Majumdar, in:, Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, Springer, 2000, pp. 13–34.

Symbolic model checking for rectangular hybrid systems
T.A. Henzinger, R. Majumdar, in:, Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2000, pp. 142–156.

Robust undecidability of timed and hybrid systems
T.A. Henzinger, J. Raskin, in:, Proceedings of the 3rd International Workshop on Hybrid Systems, Springer, 2000, pp. 145–159.

Discrete-time control for rectangular hybrid automata
T.A. Henzinger, P. Kopke, Theoretical Computer Science 221 (1999) 369–392.

Verifying sequential consistency on shared-memory multiprocessor systems
T.A. Henzinger, S. Qadeer, S. Rajamani, in:, Proceedings of the 11th International Conference on Computer Aided Verification, Springer, 1999, pp. 301–315.

Rectangular hybrid games
T.A. Henzinger, B. Horowitz, R. Majumdar, in:, Proceedings of the 10th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1999, pp. 320–335.

Formal specification and verification of a dataflow processor array
T.A. Henzinger, X. Liu, S. Qadeer, S. Rajamani, in:, IEEE, 1999, pp. 494–499.

Assume-guarantee refinement between different time scales
T.A. Henzinger, S. Qadeer, S. Rajamani, in:, Proceedings of the 11th International Conference on Computer Aided Verification, Springer, 1999, pp. 208–221.

Reactive modules
R. Alur, T.A. Henzinger, Formal Methods in System Design 15 (1999) 7–48.

Alternating-time temporal logic
R. Alur, T.A. Henzinger, O. Kupferman, in:, Proceedings of the International Symposium on Compositionality, Springer, 1999, pp. 23–60.

Automating modular verification
R. Alur, L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 10th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1999, pp. 82–97.

An algorithm for the approximative analysis of rectangular automata
J. Preußig, S. Kowalewski, H. Wong Toi, T.A. Henzinger, in:, Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, Springer, 1998, pp. 228–240.

Axioms for real-time logics
J. Raskin, P. Schobbens, T.A. Henzinger, in:, Proceedings of the 9th Interantional Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 219–236.

Reachability verification for hybrid automata
T.A. Henzinger, V. Rusu, in:, Proceedings of the 1st International Workshop on Hybrid Systems: Computation and Control, Springer, 1998, pp. 190–204.

HSCC: Hybrid Systems—Computation and Control
T.A. Henzinger, ed., HSCC: Hybrid Systems—Computation and Control, Springer, 1998.

An assume-guarantee rule for checking simulation
T.A. Henzinger, S. Qadeer, S. Rajamani, S. Tasiran, in:, Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design, Springer, 1998, pp. 421–432.

The regular real-time languages
T.A. Henzinger, J. Raskin, P. Schobbens, in:, Proceedings of the 25th International Colloqium on Automata, Languages and Programming, Springer, 1998, pp. 580–591.

From pre-historic to post-modern symbolic model checking
T.A. Henzinger, O. Kupferman, S. Qadeer, in:, Proceedings of the 10th International Conference on Computer Aided Verification, Springer, 1998, pp. 195–206.

You assume, we guarantee: Methodology and case studies
T.A. Henzinger, S. Qadeer, S. Rajamani, in:, Proceedings of the 10th International Conference on Computer Aided Verification, Springer, 1998, pp. 440–451.

Algorithmic analysis of nonlinear hybrid systems
T.A. Henzinger, P. Ho, H. Wong Toi, IEEE Transactions on Automatic Control 43 (1998) 540–554.

What's decidable about hybrid automata?
T.A. Henzinger, P. Kopke, A. Puri, P. Varaiya, Journal of Computer and System Sciences 57 (1998) 94–124.

It's about time: Real-time logics reviewed
T.A. Henzinger, in:, Proceedings of the 9th Interantional Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 439–454.

Symbolic exploration of transition hierarchies
R. Alur, T.A. Henzinger, S. Rajamani, in:, Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer, 1998, pp. 330–344.

Alternating refinement relations
R. Alur, T.A. Henzinger, O. Kupferman, M. Vardi, in:, Proceedings of the 9th Interantional Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 163–178.

Mocha: Modularity in model checking
R. Alur, T.A. Henzinger, F. Mang, S. Qadeer, S. Rajamani, S. Tasiran, in:, Proceedings of the 10th International Conference on Computer Aided Verification, Springer, 1998, pp. 521–525.

Concurrent reachability games
L. De Alfaro, T.A. Henzinger, O. Kupferman, in:,  Proceedings 39th Annual Symposium on Foundations of Computer Science, IEEE, 1998, pp. 564–575.

From quantity to quality
T.A. Henzinger, O. Kupferman, in:, Proceedings of the 5th International Workshop on Hybrid and Real-Time Systems, Springer, 1997, pp. 48–62.

Discrete-time control for rectangular hybrid automata
T.A. Henzinger, P. Kopke, in:, Proceedings of the 24th International Colloquium on Automata, Languages and Programming, Springer, 1997, pp. 582–593.

Fair simulation
T.A. Henzinger, O. Kupferman, S. Rajamani, in:, Proceedings of the 8th International Conference on Concurrency Theory, Springer, 1997, pp. 273–287.

HyTech: A model checker for hybrid systems
T.A. Henzinger, P. Ho, H. Wong Toi, in:, Springer, 1997, pp. 460–463.

HyTech: A model checker for hybrid systems
T.A. Henzinger, P. Ho, H. Wong Toi, Software Tools For Technology Transfer 1 (1997) 110–122.

Robust timed automata
V. Gupta, T.A. Henzinger, R. Jagadeesan, in:, Proceedings of the 5th International Workshop on Hybrid and Real-Time Systems, Springer, 1997, pp. 331–345.

Modularity for timed and hybrid systems
R. Alur, T.A. Henzinger, in:, 8th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1997, pp. 74–88.

Real-time system = discrete system + clock variables
R. Alur, T.A. Henzinger, Software Tools For Technology Transfer 1 (1997) 86–109.

Partial-order reduction in symbolic state-space exploration
R. Alur, R. Brayton, T.A. Henzinger, S. Qadeer, S. Rajamani, in:, 9th International Conference on Computer Aided Verification, Springer, 1997, pp. 340–351.

Alternating-time temporal logic
R. Alur, T.A. Henzinger, O. Kupferman, in:, Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Association for Computing Machinery (ACM), 1997, pp. 100–109.

Computing accumulated delays in real-time systems
R. Alur, C. Courcoubetis, T.A. Henzinger, Formal Methods in System Design 11 (1997) 137–156.

Symbolic analysis of hybrid systems
R. Alur, T.A. Henzinger, H. Wong Toi, in:, Proceedings of the 36th IEEE Conference on Decision and Control, IEEE, 1997, pp. 702–707.

Linear phase-portrait approximations for nonlinear hybrid systems
T.A. Henzinger, H. Wong Toi, in:, R. Alur, T.A. Henzinger, E. Sontag (Eds.), Hybrid Systems III: Verification and Control, Springer, 1996, pp. 377–388.

Using HyTech to synthesize control parameters for a steam boiler
T.A. Henzinger, H. Wong Toi, in:, Formal Methods for Industrial Applications: Specifying and Programming the Steam Boiler Control, Springer, 1996, pp. 265–282.

State equivalences for rectangular hybrid automata
T.A. Henzinger, P. Kopke, in:, 7th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1996, pp. 530–545.

A space-efficient on-the-fly algorithm for real-time model checking
T.A. Henzinger, O. Kupferman, M. Vardi, in:, 7th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1996, pp. 514–529.

The theory of hybrid automata
T.A. Henzinger, in:, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1996, pp. 278–292.

 8th International Conference on Computer Aided Verification
T.A. Henzinger, R. Alur, eds.,  8th International Conference on Computer Aided Verification, Springer, 1996.

Reactive modules
R. Alur, T.A. Henzinger, in:, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1996, pp. 207–218.

Automatic symbolic verification of embedded systems
R. Alur, T.A. Henzinger, P. Ho, IEEE Transactions on Software Engineering 22 (1996) 181–201.

The benefits of relaxing punctuality
R. Alur, T. Feder, T.A. Henzinger, Journal of the ACM 43 (1996) 116–146.

Hybrid Systems III: Verification and Control
R. Alur, T.A. Henzinger, E.D. Sontag, eds., Hybrid Systems III: Verification and Control, Springer, Berlinf; Heidelberg, 1996.

Algorithmic analysis of nonlinear hybrid systems
T.A. Henzinger, P. Ho, in:, 7th International Conference on Computer Aided Verification, Springer, 1995, pp. 225–238.

A note on abstract-interpretation strategies for hybrid automata
T.A. Henzinger, P. Ho, in:, A. Panos, W. Kohn, A. Nerode, S. Sastry (Eds.), 3rd International Hybrid Systems Workshop, Springer, 1995, pp. 252–264.

HyTech: The Cornell Hybrid Technology Tool
T.A. Henzinger, P. Ho, in:, A. Panos, W. Kohn, A. Nerode, S. Sastry (Eds.), 4th International Hybrid Systems Workshop, Springer, 1995, pp. 265–293.

A user guide to HyTech
T.A. Henzinger, P. Ho, H. Wong Toi, in:, 1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, Springer, 1995, pp. 41–71.

HyTech: The next generation
T.A. Henzinger, P. Ho, H. Wong Toi, in:, Proceedings 16th IEEE Real-Time Systems Symposium, IEEE, 1995, pp. 56–65.

Computing simulations on finite and infinite graphs
M.H. Henzinger, T.A. Henzinger, P. Kopke, in:, Proceedings of IEEE 36th Annual Foundations of Computer Science, IEEE, 1995, pp. 453–462.

What's decidable about hybrid automata?
T.A. Henzinger, P. Kopke, A. Puri, P. Varaiya, in:, Proceedings of the 27th Annual ACM Symposium on Theory of Computing, ACM, 1995, pp. 373–382.

The expressive power of clocks
T.A. Henzinger, P. Kopke, H. Wong Toi, in:, 22nd International Colloquium on Automata, Languages and Programming , Springer, 1995, pp. 417–428.

Hybrid automata with finite bisimulations
T.A. Henzinger, in:, 22nd International Colloquium on Automata, Languages and Programming , Springer, 1995, pp. 324–335.

Local liveness for compositional modeling of fair reactive systems
R. Alur, T.A. Henzinger, in:, 7th International Conference on Computer Aided Verification, Springer, 1995, pp. 166–179.

The algorithmic analysis of hybrid systems
R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine, Theoretical Computer Science 138 (1995) 3–34.

Proving safety properties of hybrid systems
A. Kapur, T.A. Henzinger, Z. Manna, A. Pnueli, in:, 3rd International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, Springer, 1994, pp. 431–454.

Verification methods for the divergent runs of clock systems
T.A. Henzinger, P. Kopke, in:, 3rd International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, Springer, 1994, pp. 351–372.

Temporal proof methodologies for timed transition systems
T.A. Henzinger, Z. Manna, A. Pnueli, Information and Computation 112 (1994) 273–337.

Symbolic model checking for real-time systems
T.A. Henzinger, X. Nicollin, J. Sifakis, S. Yovine, Information and Computation 111 (1994) 193–244.

Finitary fairness
R. Alur, T.A. Henzinger, in:, Proceedings 9th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1994, pp. 52–61.

Real-time system = discrete system + clock variables
R. Alur, T.A. Henzinger, in:, T. Rus, C. Rattray (Eds.), Theories and Experiences for Real-Time System Development, World Scientific Publishing, 1994, pp. 1–29.

A really temporal logic
R. Alur, T.A. Henzinger, Journal of the ACM 41 (1994) 181–204.

The observational power of clocks
R. Alur, C. Courcoubetis, T.A. Henzinger, in:, 5th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1994, pp. 162–177.

A determinizable class of timed automata
R. Alur, L. Fix, T.A. Henzinger, in:, International Conference on Computer Aided Verification, Springer, 1994, pp. 1–13.

The algorithmic analysis of hybrid systems
R. Alur, C. Courcoubetis, T.A. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine, in:, 11th International Conference on Analysis and Optimization of Systems Discrete Event Systems, Springer, 1994, pp. 331–351.

Towards refining temporal specifications into hybrid systems
T.A. Henzinger, Z. Manna, A. Pnueli, in:, R. Grossman, A. Nerode, A. Ravn, H. Rischel (Eds.), International Hybrid Systems Workshop, Springer, 1993, pp. 60–76.

Real-time logics: Complexity and expressiveness
R. Alur, T.A. Henzinger, Information and Computation 104 (1993) 35–77.

Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems
R. Alur, C. Courcoubetis, T.A. Henzinger, P. Ho, in:, R. Grossman, A. Nerode, A. Ravn, H. Rischel (Eds.), Hybrid Systems, Springer, 1993, pp. 209–229.

Automatic symbolic verification of embedded systems
R. Alur, T.A. Henzinger, P. Ho, in:, 1993 Proceedings Real-Time Systems Symposium, IEEE, 1993, pp. 2–11.

Computing accumulated delays in real-time systems
R. Alur, C. Courcoubetis, T.A. Henzinger, in:, 5th International Conference on Computer Aided Verification, Springer, 1993, pp. 181–193.

Parametric real-time reasoning
R. Alur, T.A. Henzinger, M. Vardi, in:, Proceedings of the 25th Annual ACM Symposium on Theory of Computing, ACM, 1993, pp. 592–601.

Symbolic model checking for real-time systems
T.A. Henzinger, X. Nicollin, J. Sifakis, S. Yovine, in:, Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1992, pp. 394–406.

What good are digital clocks?
T.A. Henzinger, Z. Manna, A. Pnueli, in:, 19th International Colloquium on Automata, Languages and Programming, Springer, 1992, pp. 545–558.

Timed transition systems
T.A. Henzinger, Z. Manna, A. Pnueli, in:, Real Time: Theory in Practice, Springer, 1992, pp. 226–251.

Sooner Is Safer Than Later
T.A. Henzinger, Information Processing Letters 43 (1992) 135–141.

Logics and models of real time: A survey
R. Alur, T.A. Henzinger, in:, REX Workshop on Real Time: Theory in Practice, Springer, 1992, pp. 74–106.

Back to the future: Towards a theory of timed regular languages
R. Alur, T.A. Henzinger, in:, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992, pp. 177–186.

Temporal proof methodologies for real-time systems
T.A. Henzinger, Z. Manna, A. Pnueli, in:, Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, 1991, pp. 353–366.

The temporal specification and verification of real-time systems 
T.A. Henzinger, The Temporal Specification and Verification of Real-Time Systems , Stanford University, 1991.

Time for logic
R. Alur, T.A. Henzinger, SIGACT News 22 (1991) 6–12.

The benefits of relaxing punctuality
R. Alur, T. Feder, T.A. Henzinger, in:, Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, ACM, 1991, pp. 139–152.

An interleaving model for real time
T.A. Henzinger, Z. Manna, A. Pnueli, in:,  Proceedings of the 5th Jerusalem Conference on Information Technology, IEEE, 1990, pp. 717–730.

Half-order modal logic: How to prove real-time properties
T.A. Henzinger, in:, Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, ACM, 1990, pp. 281–296.

Real-time logics: Complexity and expressiveness
R. Alur, T.A. Henzinger, in:,  5th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1990, pp. 390–401.

A really temporal logic
R. Alur, T.A. Henzinger, in:, 30th Annual Symposium on Foundations of Computer Science, IEEE, 1989, pp. 164–169.