M. Chalupa and T. A. Henzinger, “Bubaak: Runtime monitoring of program verifiers,” in Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13994, pp. 535–540.

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

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

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

T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Quantitative safety and liveness,” in 26th International Conference Foundations of Software Science and Computation Structures, Paris, France, 2023, vol. 13992, pp. 349–370.

T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Regular methods for operator precedence languages,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261, p. 129:1--129:20.

M. Lechner, A. Amini, D. Rus, and T. A. Henzinger, “Revisiting the adversarial robustness-accuracy tradeoff in robot learning,” IEEE Robotics and Automation Letters, vol. 8, no. 3. Institute of Electrical and Electronics Engineers, pp. 1595–1602, 2023.

M. Lechner, D. Zikelic, K. Chatterjee, T. A. Henzinger, and D. Rus, “Quantization-aware interval bound propagation for training certifiably robust quantized neural networks,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 12, pp. 14964–14973.

T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness,” in Computer Aided Verification, Paris, France, 2023, vol. 13965, pp. 358–382.

U. Boker, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Safety and liveness of quantitative automata,” in 34th International Conference on Concurrency Theory, Antwerp, Belgium, 2023, vol. 279.

E. Bartocci, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Hypernode automata,” in 34th International Conference on Concurrency Theory, Antwerp, Belgium, 2023, vol. 279.

T. A. Henzinger, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness under partial observations,” in 23rd International Conference on Runtime Verification, Thessaloniki, Greece, 2023, vol. 14245, pp. 291–311.

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

V. G. Trinh, B. Benhamou, T. A. Henzinger, and S. Pastva, “Trap spaces of multi-valued networks: Definition, computation, and applications,” Bioinformatics, vol. 39, no. Supplement_1. Oxford Academic, pp. i513–i522, 2023.

S. Pastva and T. A. Henzinger, “Binary decision diagrams on modern hardware,” in Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design, Ames, IA, United States, 2023, pp. 122–131.

D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 10, pp. 11926–11935.

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

D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional policy learning in stochastic control systems with formal guarantees,” in 37th Conference on Neural Information Processing Systems, New Orleans, LO, United States, 2023.

M. Chalupa and T. A. Henzinger, “Monitoring hyperproperties with prefix transducers,” in 23nd International Conference on Runtime Verification, Thessaloniki, Greek, 2023, vol. 14245, pp. 168–190.

M. Chalupa and T. A. Henzinger, “Monitoring hyperproperties with prefix transducers.” Zenodo, 2023.

T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Runtime monitoring of dynamic fairness properties,” in FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, Chicago, IL, United States, 2023, pp. 604–614.

E. Bartocci, T. Ferrere, T. A. Henzinger, D. Nickovic, and A. O. Da Costa, “Flavors of sequential information flow,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Philadelphia, PA, United States, 2022, vol. 13182, pp. 1–19.

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

T. A. Henzinger, K. Lehtinen, and P. Totzke, “History-deterministic timed automata,” in 33rd International Conference on Concurrency Theory, Warsaw, Poland, 2022, vol. 243, p. 14:1-14:21.

G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,” in 47th International Symposium on Mathematical Foundations of Computer Science, Vienna, Austria, 2022, vol. 241, p. 3:1-3:6.

M. Lechner, A. Amini, D. Rus, and T. A. Henzinger, “Revisiting the adversarial robustness-accuracy tradeoff in robot learning,” arXiv. .

T. A. Henzinger, “Quantitative monitoring of software,” in Software Verification, New Haven, CT, United States, 2022, vol. 13124, pp. 3–6.

E. Bartocci, T. Ferrere, T. A. Henzinger, D. Nickovic, and A. O. Da Costa, “Information-flow interfaces,” in Fundamental Approaches to Software Engineering, Munich, Germany, 2022, vol. 13241, pp. 3–22.

T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Abstract monitors for quantitative specifications,” in 22nd International Conference on Runtime Verification, Tbilisi, Georgia, 2022, vol. 13498, pp. 200–220.

S. Bose, T. A. Henzinger, K. Lehtinen, S. Schewe, and P. Totzke, “History-deterministic timed automata are not determinizable,” in 16th International Conference on Reachability Problems, Kaiserslautern, Germany, 2022, vol. 13608, pp. 67–76.

S. A. Gruenbacher et al., “GoTube: Scalable statistical verification of continuous-depth models,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 6. Association for the Advancement of Artificial Intelligence, pp. 6755–6764, 2022.

M. Lechner, D. Zikelic, K. Chatterjee, and T. A. Henzinger, “Stability verification in stochastic control systems via neural network supermartingales,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7. Association for the Advancement of Artificial Intelligence, pp. 7326–7336, 2022.

D. Zikelic, M. Lechner, K. Chatterjee, and T. A. Henzinger, “Learning stabilizing policies in stochastic control systems,” arXiv. .

D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” arXiv. .

T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized neural networks,” in Proceedings of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795.

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

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

G. Avni, T. A. Henzinger, and . dikeli, “Bidding mechanisms in graph games,” Journal of Computer and System Sciences, vol. 119, no. 8. Elsevier, pp. 133–144, 2021.

T. A. Henzinger and N. E. Sarac, “Quantitative and approximate monitoring,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Online, 2021.

T. Petrov, C. Igler, A. Sezgin, T. A. Henzinger, and C. C. Guet, “Long lived transients in gene regulation,” Theoretical Computer Science, vol. 893. Elsevier, pp. 1–16, 2021.

F. Mühlböck and T. A. Henzinger, “Differential monitoring,” in International Conference on Runtime Verification, Virtual, 2021, vol. 12974, pp. 231–243.

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

M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” Logical Methods in Computer Science, vol. 17, no. 1. International Federation for Computational Logic, p. 10:1-10:23, 2021.

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

A. Lukina, C. Schilling, and T. A. Henzinger, “Into the unknown: active monitoring of neural networks,” in 21st International Conference on Runtime Verification, Virtual, 2021, vol. 12974, pp. 42–61.

T. Ferrere, T. A. Henzinger, and B. Kragl, “Monitoring event frequencies,” in 28th EACSL Annual Conference on Computer Science Logic, Barcelona, Spain, 2020, vol. 152.

K. Chatterjee, T. A. Henzinger, and J. Otop, “Multi-dimensional long-run average problems for vector addition systems with states,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171.

G. Avni and T. A. Henzinger, “A survey of bidding games on graphs,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171.

P. A. Alamdari, G. Avni, T. A. Henzinger, and A. Lukina, “Formal methods with a touch of magic,” in Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, Online Conference, 2020, pp. 138–147.

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

G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020.

T. A. Henzinger, A. Lukina, and C. Schilling, “Outside the box: Abstraction-based monitoring of neural networks,” in 24th European Conference on Artificial Intelligence, Santiago de Compostela, Spain, 2020, vol. 325, pp. 2433–2440.

M. Lechner, R. Hasani, A. Amini, T. A. Henzinger, D. Rus, and R. Grosu, “Neural circuit policies enabling auditable autonomy,” Nature Machine Intelligence, vol. 2. Springer Nature, pp. 642–652, 2020.

T. A. Henzinger and N. E. Sarac, “Monitorability under assumptions,” in Runtime Verification, Los Angeles, CA, United States, 2020, vol. 12399, pp. 3–18.

B. Kragl, S. Qadeer, and T. A. Henzinger, “Refinement for structured concurrent programs,” in Computer Aided Verification, 2020, vol. 12224, pp. 275–298.

B. Kragl, C. Enea, T. A. Henzinger, S. O. Mutluergil, and S. Qadeer, “Inductive sequentialization of asynchronous programs,” in Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, London, United Kingdom, 2020, pp. 227–242.

G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in  Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.

M. Lechner, R. Hasani, M. Zimmer, T. A. Henzinger, and R. Grosu, “Designing worm-inspired neural networks for interpretable robotic control,” in Proceedings - IEEE International Conference on Robotics and Automation, Montreal, QC, Canada, 2019, vol. 2019–May.

M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.

K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.

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

G. Avni, T. A. Henzinger, and D. Zikelic, “Bidding mechanisms in graph games,” presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany, 2019, vol. 138.

G. Avni, R. Bloem, K. Chatterjee, T. A. Henzinger, B. Konighofer, and S. Pranger, “Run-time optimization for learned controllers through quantitative games,” in 31st International Conference on Computer-Aided Verification, New York, NY, United States, 2019, vol. 11561, pp. 630–649.

M. Garcia Soto, T. A. Henzinger, C. Schilling, and L. Zeleznik, “Membership-based synthesis of linear hybrid automata,” in 31st International Conference on Computer-Aided Verification, New York City, NY, USA, 2019, vol. 11561, pp. 297–314.

G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” Journal of the ACM, vol. 66, no. 4. ACM, 2019.

C. C. Guet, T. A. Henzinger, C. Igler, T. Petrov, and A. Sezgin, “Transient memory in gene regulation,” in 17th International Conference on Computational Methods in Systems Biology, Trieste, Italy, 2019, vol. 11773, pp. 155–187.

H. Kong, E. Bartocci, Y. Jiang, and T. A. Henzinger, “Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty,” in 17th International Conference on Formal Modeling and Analysis of Timed Systems, Amsterdam, The Netherlands, 2019, vol. 11750, pp. 123–141.

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

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

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

K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. Springer, 2018, pp. 143–161.

B. Kragl, S. Qadeer, and T. A. Henzinger, “Synchronizing the asynchronous,” presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.

T. Ferrere, T. A. Henzinger, and E. Saraç, “A theory of register monitors,” presented at the LICS: Logic in Computer Science, Oxford, UK, 2018, vol. Part 8033, pp. 394–403.

G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.

A. Elgyütt, T. Ferrere, and T. A. Henzinger, “Monitoring temporal logic with clock variables,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China, 2018, vol. 11022, pp. 53–70.

H. Kong, E. Bartocci, and T. A. Henzinger, “Reachable set over-approximation for nonlinear systems using piecewise barrier tubes,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 449–467.

G. Frehse, M. Giacobbe, and T. A. Henzinger, “Space-time interpolants,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 468–486.

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

A. Benveniste et al., “Contracts for system design,” Foundations and Trends in Electronic Design Automation, vol. 12, no. 2–3. Now Publishers, pp. 124–400, 2018.

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

K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4. ACM, 2017.

K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.

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

S. Bak, S. Bogomolov, T. A. Henzinger, and A. Kumar, “Challenges and tool implementation of hybrid rapidly exploring random trees,” presented at the NSV: Numerical Software Verification, Heidelberg, Germany, 2017, vol. 10381, pp. 83–89.

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

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

K. Chatterjee, T. A. Henzinger, and J. Otop, “Bidirectional nested weighted automata,” presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany, 2017, vol. 85.

G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” presented at the CONCUR: Concurrency Theory, Berlin, Germany, 2017, vol. 85.

S. Bogomolov, M. Giacobbe, T. A. Henzinger, and H. Kong, “Conic abstractions for hybrid systems,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 116–132.

S. Bogomolov, G. Frehse, M. Giacobbe, and T. A. Henzinger, “Counterexample guided refinement of template polyhedra,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 589–606.

P. Cerny et al., “From non-preemptive to preemptive scheduling using synchronization synthesis,” Formal Methods in System Design, vol. 50, no. 2–3. Springer, pp. 97–139, 2017.

M. Giacobbe, C. C. Guet, A. Gupta, T. A. Henzinger, T. Paixao, and T. Petrov, “Model checking the evolution of gene regulatory networks,” Acta Informatica, vol. 54, no. 8. Springer, pp. 765–787, 2017.

T. A. Henzinger and J. Otop, “Model measuring for discrete and hybrid systems,” Nonlinear Analysis: Hybrid Systems, vol. 23. Elsevier, pp. 166–190, 2017.

G. Avni, S. Goel, T. A. Henzinger, and G. Rodríguez Navas, “Computing scores of forwarding schemes in switched networks with probabilistic faults,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10206, pp. 169–187.

K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, “Quantitative fair simulation games,” Information and Computation, vol. 254, no. 2. Elsevier, pp. 143–166, 2017.

G. Gottlob, T. A. Henzinger, and G. Weißenbacher, “Preface of the special issue in memoriam Helmut Veith,” Formal Methods in System Design, vol. 51, no. 2. Springer, pp. 267–269, 2017.

K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted limit-average automata of bounded width,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland, 2016, vol. 58.

A. Haas et al., “Local linearizability for concurrent container-type data structures,” in Leibniz International Proceedings in Informatics, Quebec City; Canada, 2016, vol. 59.

K. Chatterjee, T. A. Henzinger, and J. Otop, “Quantitative automata under probabilistic semantics,” in Proceedings of the 31st Annual ACM/IEEE Symposium, New York, NY, USA, 2016, pp. 76–85.

H. Kong et al., “Discrete abstraction of multiaffine systems,” presented at the HSB: Hybrid Systems Biology, Grenoble, France, 2016, vol. 9957, pp. 128–144.

K. Chatterjee, T. A. Henzinger, and J. Otop, “Quantitative monitor automata,” presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom, 2016, vol. 9837, pp. 23–38.

S. Bak, S. Bogomolov, T. A. Henzinger, T. Johnson, and P. Prakash, “Scalable static hybridization methods for analysis of nonlinear systems,” presented at the HSCC 2016: International Conference on Hybrid Systems: Computation and Control, Vienna, Austria, 2016, pp. 155–164.

C. Dragoi, T. A. Henzinger, and D. Zufferey, “PSYNC: A partially synchronous language for fault-tolerant distributed algorithms,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 400–415.

T. A. Henzinger, J. Otop, and R. Samanta, “Lipschitz robustness of timed I/O systems,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, St. Petersburg, FL, USA, 2016, vol. 9583, pp. 250–267.

C. Schilling, S. Bogomolov, T. A. Henzinger, A. Podelski, and J. Ruess, “Adaptive moment closure for parameter inference of biochemical reaction networks,” Biosystems, vol. 149. Elsevier, pp. 15–25, 2016.

G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom, 2016, vol. 9928, pp. 153–166.

P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Linear distances between Markov chains,” presented at the CONCUR: Concurrency Theory, Quebec City; Canada, 2016, vol. 59.

P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Eindhoven, The Netherlands, 2016, vol. 9636, pp. 112–129.

P. Daca, A. Gupta, and T. A. Henzinger, “Abstraction-driven concolic testing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, St. Petersburg, FL, USA, 2016, vol. 9583, pp. 328–347.

P. Daca, T. A. Henzinger, and A. Kupriyanov, “Array folds logic,” presented at the CAV: Computer Aided Verification, Toronto, Canada, 2016, vol. 9780, pp. 230–248.

C. Dragoi, T. A. Henzinger, and D. Zufferey, “The need for language support for fault-tolerant distributed systems,” vol. 32. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 90–102, 2015.

S. Bogomolov, T. A. Henzinger, A. Podelski, J. Ruess, and C. Schilling, “Adaptive moment closure for parameter inference of biochemical reaction networks,” vol. 9308. Springer, pp. 77–89, 2015.

Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. Rabinovich, and J. Raskin, “The complexity of multi-mean-payoff and multi-energy games,” Information and Computation, vol. 241, no. 4. Elsevier, pp. 177–196, 2015.

A. Gupta and T. A. Henzinger, “Guest editors’ introduction to special issue on computational methods in systems biology,” ACM Transactions on Modeling and Computer Simulation, vol. 25, no. 2. ACM, 2015.

P. Cerny, T. A. Henzinger, L. Kovács, A. Radhakrishna, and J. Zwirchmayr, “Segment abstraction for worst-case execution time analysis,” vol. 9032. Springer, pp. 105–131, 2015.

T. A. Henzinger and J. Raskin, “The equivalence problem for finite automata: Technical perspective,” Communications of the ACM, vol. 58, no. 2. ACM, pp. 86–86, 2015.

A. Gupta, T. A. Henzinger, A. Radhakrishna, R. Samanta, and T. Tarrach, “Succinct representation of concurrent trace sets,” presented at the POPL: Principles of Programming Languages, Mumbai, India, 2015, pp. 433–444.

S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” Logical Methods in Computer Science, vol. 11, no. 1. International Federation of Computational Logic, 2015.

K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” Information and Computation, vol. 245, no. 12. Elsevier, pp. 3–16, 2015.

K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” Journal of the ACM, vol. 62, no. 1. ACM, 2015.

K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.

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

U. Boker, T. A. Henzinger, and J. Otop, “The target discounted-sum problem,” in LICS, Kyoto, Japan, 2015, pp. 750–761.

K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in 42nd International Colloquium, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.

U. Boker, T. A. Henzinger, and J. Otop, The target discounted-sum problem. IST Austria, 2015.

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

N. Benes, P. Daca, T. A. Henzinger, J. Kretinsky, and D. Nickovic, “Complete composition operators for IOCO-testing theory,” presented at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada, 2015, pp. 101–110.

P. Cerny et al., “From non-preemptive to preemptive scheduling using synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015.

M. Giacobbe, C. C. Guet, A. Gupta, T. A. Henzinger, T. Paixao, and T. Petrov, “Model checking gene regulatory networks,” vol. 9035. Springer, pp. 469–483, 2015.

C. Dragoi, T. A. Henzinger, H. Veith, J. Widder, and D. Zufferey, “A logic-based framework for verifying consensus algorithms,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, San Diego, USA, 2014, vol. 8318, pp. 161–181.

A. Gordon, T. A. Henzinger, A. Nori, and S. Rajamani, “Probabilistic programming,” in Proceedings of the on Future of Software Engineering, Hyderabad, India, 2014, pp. 167–181.

T. A. Henzinger, J. Otop, and R. Samanta, “Lipschitz robustness of finite-state transducers,” in Leibniz International Proceedings in Informatics, LIPIcs, Delhi, India, 2014, vol. 29, pp. 431–443.

R. Bloem et al., “Synthesizing robust systems,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 193–220, 2014.

U. Boker and T. A. Henzinger, “Exact and approximate determinization of discounted-sum automata,” Logical Methods in Computer Science, vol. 10, no. 1. International Federation of Computational Logic, 2014.

U. Boker, T. A. Henzinger, and A. Radhakrishna, “Battery transition systems,” presented at the POPL: Principles of Programming Languages, San Diego, USA, 2014, vol. 49, no. 1, pp. 595–606.

P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3. Elsevier, pp. 348–363, 2014.

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

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

T. A. Henzinger and J. Otop, “Model measuring for hybrid systems,” in Proceedings of the 17th international conference on Hybrid systems: computation and control, Berlin, Germany, 2014, pp. 213–222.

T. A. Henzinger and J. Otop, From model checking to model measuring. IST Austria, 2014.

T. A. Henzinger and J. Otop, Model measuring for hybrid systems. IST Austria, 2014.

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

P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Regression-free synthesis for concurrency,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 568–584.

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

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

A. Haas et al., “Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation,” in Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, Ischia, Italy, 2013, no. 5.

T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 317–328.

P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction refinement,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 115–128.

T. A. Henzinger, “Quantitative reactive modeling and verification,” Computer Science Research and Development, vol. 28, no. 4. Springer, pp. 331–344, 2013.

A. Gupta and T. A. Henzinger, Eds., Computational Methods in Systems Biology, vol. 8130. Springer, 2013.

Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6. Springer, pp. 585–601, 2013.

T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” vol. 8052. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 242–256, 2013.

K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Strategy improvement for concurrent reachability and turn based stochastic safety games,” Journal of Computer and System Sciences, vol. 79, no. 5. Elsevier, pp. 640–657, 2013.

A. Kucera, T. A. Henzinger, J. Nesetril, T. Vojnar, and D. Antos, Eds., Mathematical and Engineering Methods in Computer Science, vol. 7721. Springer, 2013, pp. 1–228.

T. A. Henzinger and A. Sezgin, How free is your linearizable concurrent data structure? IST Austria, 2013.

K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in 13th International Conference on Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013, pp. 18–25.

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

T. A. Henzinger and J. Otop, “From model checking to model measuring,” vol. 8052. Springer, pp. 273–287, 2013.

T. A. Henzinger, H. Payer, and A. Sezgin, Replacing competition with cooperation to achieve scalable lock-free FIFO queues . IST Austria, 2013.

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

P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Efficient synthesis for concurrency by semantics-preserving transformations,” presented at the CAV: Computer Aided Verification, St. Petersburg, Russia, 2013, vol. 8044, pp. 951–967.

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

T. A. Henzinger and M. Mateescu, “The propagation approach for computing biochemical reaction networks,” IEEE ACM Transactions on Computational Biology and Bioinformatics, vol. 10, no. 2. IEEE, pp. 310–322, 2012.

U. Boker and T. A. Henzinger, “Approximate determinization of quantitative automata,” in Leibniz International Proceedings in Informatics, Hyderabad, India, 2012, vol. 18, pp. 362–373.

P. Cerny, S. Gopi, T. A. Henzinger, A. Radhakrishna, and N. Totla, “Synthesis from incompatible specifications,” in Proceedings of the tenth ACM international conference on Embedded software, Tampere, Finland, 2012, pp. 53–62.

T. A. Henzinger, “Quantitative reactive models,” in Conference proceedings MODELS 2012, Innsbruck, Austria, 2012, vol. 7590, pp. 1–2.

P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in Electronic Proceedings in Theoretical Computer Science, Napoli, Italy, 2012, vol. 96, pp. 29–42.

K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in roceedings of the tenth ACM international conference on Embedded software, Tampere, Finland, 2012, pp. 43–52.

T. A. Henzinger and D. Nickovic, “Independent implementability of viewpoints,” in  Conference proceedings Monterey Workshop 2012, Oxford, UK, 2012, vol. 7539, pp. 380–395.

C. C. Guet, A. Gupta, T. A. Henzinger, M. Mateescu, and A. Sezgin, “Delayed continuous time Markov chains for genetic regulatory circuits,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 294–309.

J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule based systems,” Theoretical Computer Science, vol. 431. Elsevier, pp. 137–164, 2012.

K. Chatterjee and T. A. Henzinger, “A survey of stochastic <9 regular games,” Journal of Computer and System Sciences, vol. 78, no. 2. Elsevier, pp. 394–413, 2012.

K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of partial-observation stochastic parity games,” Formal Methods in System Design, vol. 43, no. 2. Springer, pp. 268–284, 2012.

B. Delahaye, U. Fahrenberg, T. A. Henzinger, A. Legay, and D. Nickovic, “Synchronous interface theories and time triggered scheduling,” presented at the FORTE: Formal Techniques for Networked and Distributed Systems &; FMOODS: Formal Methods for Open Object-Based Distributed Systems , Stockholm, Sweden, 2012, vol. 7273, pp. 203–218.

A. Ghosal, D. Iercan, C. Kirsch, T. A. Henzinger, and A. Sangiovanni Vincentelli, “Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code,” Science of Computer Programming, vol. 77, no. 2. Elsevier, pp. 96–112, 2012.

P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” Theoretical Computer Science, vol. 413, no. 1. Elsevier, pp. 21–35, 2012.

D. Zufferey, T. Wies, and T. A. Henzinger, “Ideal abstractions for well structured transition systems,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 445–460.

T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling in clouds,” presented at the HotCloud: Workshop on Hot Topics in Cloud Computing, 2011, pp. 1–6.

T. A. Henzinger and M. Mateescu, “Tail approximation for the chemical master equation,” presented at the WCSB: Workshop on Computational Systems Biology (TICSP), 2011.

T. A. Henzinger and M. Mateescu, “Propagation models for computing biochemical reaction networks,” presented at the CMSB: Computational Methods in Systems Biology, Paris, France, 2011, pp. 1–3.

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

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

R. Halalai, T. A. Henzinger, and V. Singh, “Quantitative evaluation of BFT protocols,” presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany, 2011, pp. 255–264.

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

J. Fisher, D. Harel, and T. A. Henzinger, “Biology as reactivity,” Communications of the ACM, vol. 54, no. 10. ACM, pp. 72–82, 2011.

J. Fisher, T. A. Henzinger, D. Nickovic, N. Piterman, A. Singh, and M. Vardi, “Dynamic reactive modules,” presented at the CONCUR: Concurrency Theory, Aachen, Germany, 2011, vol. 6901, pp. 404–418.

K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.

K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.

T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” IJFCS: International Journal of Foundations of Computer Science, vol. 22, no. 4. World Scientific Publishing, pp. 823–841, 2011.

K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” Logical Methods in Computer Science, vol. 7, no. 4. International Federation of Computational Logic, 2011.

U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.

P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.

T. A. Henzinger, V. Singh, T. Wies, and D. Zufferey, “Scheduling large jobs by abstraction refinement,” presented at the EuroSys, Salzburg, Austria, 2011, pp. 329–342.

P. Cerny and T. A. Henzinger, “From boolean to quantitative synthesis,” presented at the EMSOFT: Embedded Software , Taipei; Taiwan, 2011, pp. 149–154.

K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.

F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Approximation of event probabilities in noisy cellular processes,” Theoretical Computer Science, vol. 412, no. 21. Elsevier, pp. 2128–2141, 2011.

R. Guerraoui, T. A. Henzinger, and V. Singh, “Verification of STM on relaxed memory models,” Formal Methods in System Design, vol. 39, no. 3. Springer, pp. 297–331, 2011.

U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.

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

P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.

R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound Computation for loops,” in Logic for Programming, Artificial Intelligence, and Reasoning, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.

J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule-based systems,” presented at the MECBIC: Membrane Computing and Biologically Inspired Process Calculi, Jena, Germany, 2010, vol. 40, pp. 142–161.

F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “SABRE: A tool for the stochastic analysis of biochemical reaction networks,” presented at the QEST: Quantitative Evaluation of Systems, Williamsburg, USA, 2010, pp. 193–194.

T. A. Henzinger, T. Hottelier, L. Kovács, and A. Rybalchenko, “Aligators for arrays,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 348–356.

F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Fast adaptive uniformization of the chemical master equation,” IET Systems Biology, vol. 4, no. 6. Institution of Engineering and Technology, pp. 441–452, 2010.

K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 246–257.

K. Chatterjee and T. A. Henzinger, Eds., Formal modeling and analysis of timed systems, vol. 6246. Springer, 2010.

R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness in the presence of liveness,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 410–424.

R. Guerraoui, T. A. Henzinger, and V. Singh, “Model checking transactional memories,” Distributed Computing, vol. 22, no. 3. Springer, pp. 129–145, 2010.

V. Wolf, R. Goel, M. Mateescu, and T. A. Henzinger, “Solving the chemical master equation using sliding windows,” BMC Systems Biology, vol. 4, no. 42. BioMed Central, pp. 1–19, 2010.

T. A. Henzinger, “From boolean to quantitative notions of correctness,” presented at the POPL: Principles of Programming Languages, Madrid, Spain, 2010, vol. 45, no. 1, pp. 157–158.

T. A. Henzinger, T. Hottelier, L. Kovács, and A. Voronkov, “Invariant and type inference for matrices,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 163–179.

T. A. Henzinger, M. Mateescu, L. Mikeev, and V. Wolf, “Hybrid numerical solution of the chemical master equation,” presented at the CMSB: Computational Methods in Systems Biology, Trento, Italy, 2010, pp. 55–65.

K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283.

K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Generalized mean-payoff and energy games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 505–516.

K. Chatterjee, L. Doyen, and T. A. Henzinger, “Quantitative languages,” ACM Transactions on Computational Logic (TOCL), vol. 11, no. 4. ACM, 2010.

K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395.

D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Strategy construction for parity games with imperfect information,” Information and Computation, vol. 208, no. 10. Elsevier, pp. 1206–1220, 2010.

K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” Information and Computation, vol. 208, no. 6. Elsevier, pp. 677–693, 2010.

T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “FlexPRICE: Flexible provisioning of resources in a cloud environment,” presented at the CLOUD: Cloud Computing, Miami, USA, 2010, pp. 83–90.

R. Guerraoui, T. A. Henzinger, M. Kapalka, and V. Singh, “Transactions in the jungle,” presented at the SPAA: ACM Symposium on Parallel Algorithms and Architectures, Santorini, Greece, 2010, pp. 263–272.

T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “A marketplace for cloud resources,” presented at the EMSOFT: Embedded Software , Arizona, USA, 2010, pp. 1–8.

L. Doyen, T. A. Henzinger, A. Legay, and D. Nickovic, “Robustness of sequential circuits,” presented at the ACSD: Application of Concurrency to System Design, 2010, pp. 77–84.

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

D. Beyer, T. A. Henzinger, G. Théoduloz, and D. Zufferey, “Shape refinement through explicit heap analysis,” presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus, 2010, vol. 6013, pp. 263–277.

K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” Logical Methods in Computer Science, vol. 6, no. 3. International Federation of Computational Logic, pp. 1–23, 2010.

P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 235–268.

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

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

K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, “GIST: A solver for probabilistic games,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 665–669.

K. Chatterjee and T. A. Henzinger, “Probabilistic Automata on infinite words: decidability and undecidability results,” presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore, 2010, vol. 6252, pp. 1–16.

K. Chatterjee, L. Doyen, and T. A. Henzinger, “Qualitative analysis of partially-observable Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 258–269.

T. Wies, D. Zufferey, and T. A. Henzinger, “Forward analysis of depth-bounded processes,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus, 2010, vol. 6014, pp. 94–108.

K. Chatterjee and T. A. Henzinger, “Probabilistic systems with limsup and liminf objectives,” presented at the ILC: Infinity in Logic and Computation, 2009, vol. 5489, pp. 32–45.

F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Fast adaptive uniformization of the chemical master equation,” presented at the HIBI: High-Performance Computational Systems Biology, Trento, Italy, 2009, vol. 4, no. 6, pp. 118–127.

T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” presented at the RP: Reachability Problems, Palaiseau, France, 2009, vol. 5797, pp. 3–23.

T. A. Henzinger, C. Kirsch, E. Marques, and A. Sokolova, “Distributed, modular HTL,” presented at the RTSS: Real-Time Systems Symposium, Washington, DC, United States, 2009, pp. 171–180.

K. Chatterjee, L. Doyen, and T. A. Henzinger, “Probabilistic weighted automata,” presented at the CONCUR: Concurrency Theory, Bologna, Italy, 2009, vol. 5710, pp. 244–258.

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

S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “On relational interfaces,” in EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded software, Grenoble, France, 2009, pp. 67–76.

R. Bloem, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Synthesizing robust systems,” presented at the FMCAD: Formal Methods in Computer-Aided Design, 2009, pp. 85–92.

R. Guerraoui, T. A. Henzinger, and V. Singh, “Software transactional memory on relaxed memory models,” presented at the CAV: Computer Aided Verification, 2009, vol. 5643, pp. 321–336.

T. A. Henzinger, M. Mateescu, and V. Wolf, “Sliding-window abstraction for infinite Markov chains,” presented at the CAV: Computer Aided Verification, 2009, vol. 5643, pp. 337–352.

F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Approximation of event probabilities in noisy cellular processes,” presented at the CMSB: Computational Methods in Systems Biology, 2009, vol. 5688, pp. 173–188.

K. Chatterjee, L. Doyen, and T. A. Henzinger, “Alternating weighted automata,” presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland, 2009, vol. 5699, pp. 3–13.

K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of stochastic games with limsup and liminf objectives,” presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece, 2009, vol. 5556, pp. 1–15.

K. Chatterjee, T. A. Henzinger, and F. Horn, “Stochastic games with finitary objectives,” presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia, 2009, vol. 5734, pp. 34–54.

K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Termination criteria for solving concurrent safety and reachability games,” presented at the SODA: Symposium on Discrete Algorithms, 2009, pp. 197–206.

K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” presented at the LICS: Logic in Computer Science, 2009, pp. 199–208.

R. Bloem, K. Chatterjee, T. A. Henzinger, and B. Jobstmann, “Better quality in synthesis through quantitative objectives,” presented at the CAV: Computer Aided Verification, Grenoble, France, 2009, vol. 5643, pp. 140–156.

D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Alpaga: A tool for solving parity games with imperfect information,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2009, vol. 5505, pp. 58–61.

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

K. Chatterjee, T. A. Henzinger, and F. Horn, Improved lower bounds for request-response and finitary Streett games. IST Austria, 2009.

K. Chatterjee, L. Doyen, and T. A. Henzinger, Qualitative analysis of partially-observable Markov decision processes. IST Austria, 2009.

K. Chatterjee, T. A. Henzinger, and K. Sen, “Model-checking omega-regular properties of interval Markov chains,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, 2008, vol. 4962, pp. 302–317.

K. Chatterjee, R. Majumdar, and T. A. Henzinger, “Controller synthesis with budget constraints,” presented at the HSCC: Hybrid Systems - Computation and Control, 2008, vol. 4981, pp. 72–86.

K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: complexity and robustness,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, 2008, vol. 5215, pp. 124–140.

K. Chatterjee, T. A. Henzinger, and B. Jobstmann, “Environment assumptions for synthesis,” presented at the CONCUR: Concurrency Theory, 2008, vol. 5201, pp. 147–161.

K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Trading infinite memory for uniform randomness in timed games,” presented at the HSCC: Hybrid Systems - Computation and Control, 2008, vol. 4981, pp. 87–100.

K. Chatterjee, L. Doyen, and T. A. Henzinger, “Quantitative languages,” presented at the CSL: Computer Science Logic, 2008, vol. 5213, pp. 385–400.

K. Chatterjee and T. A. Henzinger, “Value iteration,” in 25 Years in Model Checking, vol. 5000, Springer, 2008, pp. 107–138.

D. Berwanger, K. Chatterjee, L. Doyen, T. A. Henzinger, and S. Raje, “Strategy construction for parity games with imperfect information,” presented at the CONCUR: Concurrency Theory, 2008, vol. 5201, pp. 325–339.

R. Guerraoui, T. A. Henzinger, B. Jobstmann, and V. Singh, “Model checking transactional memories,” presented at the PLDI: Programming Languages Design and Implementation, 2008, pp. 372–382.

R. Guerraoui, T. A. Henzinger, and V. Singh, “Permissiveness in transactional memories,” presented at the DISC: Distributed Computing, 2008, vol. 5218, pp. 305–319.

R. Guerraoui, T. A. Henzinger, and V. Singh, “Completeness and nondeterminism in model checking transactional memories,” presented at the CONCUR: Concurrency Theory, 2008, vol. 5201, pp. 21–35.

T. A. Henzinger, T. Hottelier, and L. Kovács, “Valigator: A verification tool with bound and invariant generation,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, 2008, vol. 5330, pp. 333–342.

T. A. Henzinger, “Two challenges in embedded systems design: Predictability and robustness,” Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences, vol. 366, no. 1881. Royal Society of London, pp. 3727–3736, 2008.

A. Gupta, T. A. Henzinger, R. Majumdar, A. Rybalchenko, and R. Xu, “Proving non-termination,” presented at the POPL: Principles of Programming Languages, 2008, pp. 147–158.

J. Fisher, T. A. Henzinger, M. Mateescu, and N. Piterman, “Bounded asynchrony: Concurrency for modeling cell-cell interactions,” presented at the FMSB: Formal Methods in Systems Biology, 2008, vol. 5054, pp. 17–32.

L. Doyen, T. A. Henzinger, and J. Raskin, “Equivalence of labeled Markov chains,” International Journal of Foundations of Computer Science, vol. 19, no. 3. World Scientific Publishing, pp. 549–563, 2008.

L. Doyen, T. A. Henzinger, B. Jobstmann, and T. Petrov, “Interface theories with component reuse,” presented at the EMSOFT: Embedded Software , 2008, pp. 79–88.

K. Chatterjee and T. A. Henzinger, “Reduction of stochastic parity to stochastic mean-payoff games,” Information Processing Letters, vol. 106, no. 1. Elsevier, pp. 1–7, 2008.

K. Chatterjee et al., “Logical reliability of interacting real-time tasks,” presented at the DATE: Design, Automation and Test in Europe, 2008, pp. 909–914.

K. Chatterjee, R. Majumdar, and T. A. Henzinger, “Stochastic limit-average games are in EXPTIME,” International Journal of Game Theory, vol. 37, no. 2. Springer, pp. 219–234, 2008.

D. Beyer, T. A. Henzinger, and G. Théoduloz, “Program analysis with dynamic change of precision,” presented at the ASE: Automated Software Engineering, 2008, pp. 29–38.

K. Chatterjee, T. A. Henzinger, and N. Piterman, “Generalized parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, 2007, vol. 4423, pp. 153–167.

K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” presented at the CONCUR: Concurrency Theory, 2007, vol. 4703, pp. 59–73.

D. Beyer, T. A. Henzinger, and V. Singh, “Algorithms for interface synthesis,” presented at the CAV: Computer Aided Verification, 2007, vol. 4590, pp. 4–19.

M. Schaub, T. A. Henzinger, and J. Fisher, “Qualitative networks: A symbolic approach to analyze biological signaling networks,” BMC Systems Biology, vol. 1, no. 4. BioMed Central, 2007.

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

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

T. A. Henzinger, “Games, time, and probability: Graph models for system design and analysis,” presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, 2007, vol. 4362, pp. 103–110.

T. A. Henzinger, “Quantitative generalizations of languages,” presented at the DLT: Developments in Language Theory, 2007, vol. 4588, pp. 20–22.

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

J. Fisher and T. A. Henzinger, “Executable cell biology,” Nature Biotechnology, vol. 25. Nature Publishing Group, pp. 1239–1249, 2007.

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

K. Chatterjee and T. A. Henzinger, “Assume-guarantee synthesis,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2007, vol. 4424, pp. 261–275.

K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Algorithms for omega-regular games with imperfect information,” Logical Methods in Computer Science, vol. 3, no. 184. International Federation of Computational Logic, pp. 1–23, 2007.

D. Beyer, T. A. Henzinger, R. Jhala, and R. Majumdar, “The software model checker BLAST: Applications to software engineering,” International Journal on Software Tools for Technology Transfer, vol. 9, no. 5. Springer, pp. 505–525, 2007.

T. Brihaye, T. A. Henzinger, V. Prabhu, and J. Raskin, “Minimum-time reachability in timed games,” presented at the ICALP: Automata, Languages and Programming, 2007, vol. 4596, pp. 825–837.

D. Beyer, T. A. Henzinger, and G. Théoduloz, “Configurable software verification: Concretizing the convergence of model checking and program analysis,” presented at the CAV: Computer Aided Verification, 2007, vol. 4590, pp. 504–518.

D. Beyer, T. A. Henzinger, R. Majumdar, and A. Rybalchenko, “Invariant synthesis for combined theories,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, 2007, vol. 4349, pp. 378–394.

D. Beyer, T. A. Henzinger, R. Majumdar, and A. Rybalchenko, “Path invariants,” presented at the PLDI: Programming Languages Design and Implementation, 2007, pp. 300–309.

D. Beyer, A. Chakrabarti, T. A. Henzinger, and S. Seshia, “An application of web-service interfaces,” presented at the ICWS: International Conference on Web Service, 2007, pp. 831–838.

L. De Alfaro, T. A. Henzinger, and O. Kupferman, “Concurrent reachability games,” Theoretical Computer Science, vol. 386, no. 3. Elsevier, pp. 188–217, 2007.

K. Chatterjee, T. A. Henzinger, and N. Piterman, “Algorithms for Büchi Games,” presented at the GDV: Games in Design and Verification, 2006.

K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “The complexity of quantitative concurrent parity games,” presented at the SODA: Symposium on Discrete Algorithms, 2006, pp. 678–687.

K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Algorithms for omega-regular games with imperfect information,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 287–302.

K. Chatterjee and T. A. Henzinger, “Strategy improvement for stochastic Rabin and Streett games,” presented at the CONCUR: Concurrency Theory, 2006, vol. 4137, pp. 375–389.

M. De Wulf, L. Doyen, T. A. Henzinger, and J. Raskin, “Antichains: A new algorithm for checking universality of finite automata,” presented at the CAV: Computer Aided Verification, 2006, vol. 4144, pp. 17–30.

T. A. Henzinger and N. Piterman, “Solving games without determinization,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 395–410.

T. A. Henzinger and S. Matic, “An interface algebra for real-time components,” presented at the RTAS: Real-time and Embedded Technology and Applications Symposium, 2006, pp. 253–266.

T. A. Henzinger and V. Prabhu, “Timed alternating-time temporal logic,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, 2006, vol. 4202, pp. 1–17.

T. A. Henzinger and J. Sifakis, “The embedded systems design challenge,” presented at the FM: Formal Methods, 2006, vol. 4085, pp. 1–15.

T. A. Henzinger, O. Kupferman, and R. Majumdar, “On the universal and existential fragments of the mu-calculus,” Theoretical Computer Science, vol. 354, no. 2. Elsevier, pp. 173–186, 2006.

B. Gulavani, T. A. Henzinger, Y. Kannan, A. Nori, and S. Rajamani, “Synergy: A new algorithm for property checking,” presented at the FSE: Foundations of Software Engineering, 2006, pp. 117–127.

A. Ghosal, T. A. Henzinger, D. Iercan, C. Kirsch, and A. Sangiovanni Vincentelli, “A hierarchical coordination language for interacting real-time tasks,” presented at the EMSOFT: Embedded Software , 2006, pp. 132–141.

J. Fisher and T. A. Henzinger, “Executable biology,” presented at the WSC: Winter Simulation Conference, 2006, pp. 1675–1682.

K. Chatterjee and T. A. Henzinger, “Finitary winning in omega-regular games,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2006, vol. 3920, pp. 257–271.

K. Chatterjee and T. A. Henzinger, “Strategy improvement and randomized subexponential algorithms for stochastic parity games,” presented at the STACS: Theoretical Aspects of Computer Science, 2006, vol. 3884, pp. 512–523.

K. Chatterjee, R. Majumdar, and T. A. Henzinger, “Markov decision processes with multiple objectives,” presented at the STACS: Theoretical Aspects of Computer Science, 2006, vol. 3884, pp. 325–336.

K. Chatterjee, T. A. Henzinger, and M. Jurdziski, “Games with secure equilibria,” Theoretical Computer Science, vol. 365, no. 1–2. Elsevier, pp. 67–82, 2006.

K. Chatterjee, L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, “Compositional quantitative reasoning,” presented at the QEST: Quantitative Evaluation of Systems, 2006, pp. 179–188.

K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Strategy improvement for concurrent reachability games,” presented at the QEST: Quantitative Evaluation of Systems, 2006, pp. 291–300.

D. Beyer, T. A. Henzinger, and G. Théoduloz, “Lazy shape analysis,” presented at the CAV: Computer Aided Verification, 2006, vol. 4144, pp. 532–546.

K. Chatterjee, T. A. Henzinger, and M. Jurdziski, “Games with secure equilibria,” presented at the FMCO: Formal Methods for Components and Objects, 2005, vol. 3657, pp. 141–161.

S. Matic and T. A. Henzinger, “Trading end-to-end latency for composability,” presented at the RTSS: Real-Time Systems Symposium, 2005, pp. 99–110.

C. Kirsch, M. Sanvido, and T. A. Henzinger, “A programmable microkernel for real-time systems,” presented at the VEE: Virtual Execution Environments, 2005, pp. 35–45.

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

T. A. Henzinger, R. Majumdar, and V. Prabhu, “Quantifying similarities between timed systems,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, 2005, vol. 3829, pp. 226–241.

T. A. Henzinger, R. Jhala, and R. Majumdar, “Permissive interfaces,” presented at the FSE: Foundations of Software Engineering, 2005, pp. 31–40.

T. A. Henzinger, C. Kirsch, and S. Matic, “Composable code generation for distributed Giotto,” presented at the LCTES: Languages, Compilers, and Tools for Embedded Systems, 2005, pp. 21–30.

L. Doyen, T. A. Henzinger, and J. Raskin, “Automatic rectangular refinement of affine hybrid systems,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, 2005, vol. 3829, pp. 144–161.

K. Chatterjee and T. A. Henzinger, “Semiperfect-information games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 2005, vol. 3821, pp. 1–18.

K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “The complexity of stochastic Rabin and Streett games,” presented at the ICALP: Automata, Languages and Programming, 2005, vol. 3580, pp. 878–890.

K. Chatterjee, T. A. Henzinger, and M. Jurdziski, “Mean-payoff parity games,” presented at the LICS: Logic in Computer Science, 2005, pp. 178–187.

A. Chakrabarti, K. Chatterjee, T. A. Henzinger, O. Kupferman, and R. Majumdar, “Verifying quantitative properties using bound functions,” presented at the CHARME: Correct Hardware Design and Verification Methods, 2005, vol. 3725, pp. 50–64.

K. Chatterjee, T. A. Henzinger, R. Jhala, and R. Majumdar, “Counterexample-guided planning,” presented at the UAI: Uncertainty in Artificial Intelligence, 2005, pp. 104–111.

D. Beyer, T. A. Henzinger, R. Jhala, and R. Majumdar, “Checking memory safety with BLAST,” presented at the FASE: Fundamental Approaches To Software Engineering, 2005, vol. 3442, pp. 2–18.

D. Beyer, A. Chakrabarti, and T. A. Henzinger, “Web service interfaces,” presented at the WWW: World Wide Web Conference, 2005, pp. 148–159.

L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, “Model checking discounted temporal properties,” Theoretical Computer Science, vol. 345, no. 1. Elsevier, pp. 139–170, 2005.

L. De Alfaro and T. A. Henzinger, “Interface-based design,” presented at the Engineering Theories of Software Intensive Systems, 2005, vol. 195, pp. 83–104.

K. Chatterjee, T. A. Henzinger, and M. Jurdziski, “Games with secure equilibria,” presented at the LICS: Logic in Computer Science, 2004, pp. 160–169.

T. A. Henzinger and C. Kirsch, “A typed assembly language for real-time programs,” presented at the EMSOFT: Embedded Software , 2004, pp. 104–113.

T. A. Henzinger, R. Jhala, R. Majumdar, and K. Mcmillan, “Abstractions from proofs,” presented at the POPL: Principles of Programming Languages, 2004, pp. 232–244.

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

T. A. Henzinger, R. Jhala, and R. Majumdar, “Race checking by context inference,” presented at the PLDI: Programming Languages Design and Implementation, 2004, pp. 1–13.

A. Ghosal, T. A. Henzinger, C. Kirsch, and M. Sanvido, “Event-driven programming with logical execution times,” presented at the HSCC: Hybrid Systems - Computation and Control, 2004, vol. 2993, pp. 167–170.

K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Trading memory for randomness,” presented at the QEST: Quantitative Evaluation of Systems, 2004, pp. 206–217.

K. Chatterjee, M. Jurdziski, and T. A. Henzinger, “Quantitative stochastic parity games,” presented at the SODA: Symposium on Discrete Algorithms, 2004, pp. 121–130.

K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T. A. Henzinger, and J. Palsberg, “Stack size analysis for interrupt-driven programs,” Information and Computation, vol. 194, no. 2. Elsevier, pp. 144–174, 2004.

D. Beyer, A. Chlipala, T. A. Henzinger, R. Jhala, and R. Majumdar, “The BLAST query language for software verification,” presented at the SAS: Static Analysis Symposium, 2004, vol. 3148, pp. 2–18.

D. Beyer, T. A. Henzinger, R. Jhala, and R. Majumdar, “An eclipse plug-in for model checking,” presented at the IWPC: Program Comprehension, 2004, pp. 251–255.

D. Beyer, A. Chlipala, T. A. Henzinger, R. Jhala, and R. Majumdar, “Generating tests from counterexamples,” presented at the ICSE: Software Engineering, 2004, pp. 326–335.

L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, “Model checking discounted temporal properties,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2004, vol. 2988, pp. 77–92.

K. Chatterjee, M. Jurdziski, and T. A. Henzinger, “Simple stochastic parity games,” presented at the CSL: Computer Science Logic, 2003, vol. 2803, pp. 100–113.

K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T. A. Henzinger, and J. Palsberg, “Stack size analysis for interrupt-driven programs,” presented at the SAS: Static Analysis Symposium, 2003, vol. 2694, pp. 109–126.

L. De Alfaro, T. A. Henzinger, and R. Majumdar, “Discounting the future in systems theory,” in Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Eindhoven, The Netherlands, 2003, vol. 2719, pp. 1022–1037.

A. Chakrabarti, L. De Alfaro, T. A. Henzinger, and M. Stoelinga, “Resource interfaces,” in Third International Conference on Embedded Software, Philadelphia, PA, USA, 2003, vol. 2855, pp. 117–133.

L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, “The element of surprise in timed games,” in Proceedings of the 14th International Conference on Concurrency Theory, Marseille, France, 2003, vol. 2761, pp. 144–158.

T. A. Henzinger, C. Kirsch, M. Sanvido, and W. Pree, “From control models to real-time code using Giotto,” IEEE Control Systems Magazine, vol. 23, no. 1. IEEE, pp. 50–64, 2003.

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

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

T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre, “Software verification with BLAST,” in Proceedings of the 10th International SPIN Workshop , Portland, OR, USA, 2003, vol. 2648, pp. 235–239.

T. A. Henzinger, R. Jhala, R. Majumdar, and S. Qadeer, “Thread-modular abstraction refinement,” in Proceedings of the 15th International Conference on Computer Aided Verification, Boulder, CO, USA, 2003, vol. 2725, pp. 262–274.

T. A. Henzinger, R. Jhala, and R. Majumdar, “Counterexample-guided control,” in Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Eindhoven, The Netherlands, 2003, vol. 2719, pp. 886–902.

T. A. Henzinger, C. Kirsch, and S. Matic, “Schedule-carrying code,” in Proceedings of the 3rd International Conference on Embedded Software, Philadelphia, PA, USA, 2003, vol. 2855, pp. 241–256.

T. A. Henzinger, O. Kupferman, and S. Qadeer, “From pre-historic to post-modern symbolic model checking,” Formal Methods in System Design, vol. 23, no. 3. Springer, pp. 303–327, 2003.

T. A. Henzinger, B. Horowitz, and C. Kirsch, “Giotto: A time-triggered language for embedded programming,” Proceedings of the IEEE, vol. 91, no. 1. IEEE, pp. 84–99, 2003.

L. De Alfaro, T. A. Henzinger, and M. Stoelinga, “Timed interfaces,” in Proceedings of the 2nd International Conference on Embedded Software, Grenoble, France, 2002, vol. 2491, pp. 108–122.

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

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

R. Alur, T. A. Henzinger, and O. Kupferman, “Alternating-time temporal logic,” Journal of the ACM, vol. 49, no. 5. ACM, pp. 672–713, 2002.

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

T. A. Henzinger, O. Kupferman, and S. Rajamani, “Fair simulation,” Information and Computation, vol. 173, no. 1. Elsevier, pp. 64–81, 2002.

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

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

T. A. Henzinger, C. Kirsch, R. Majumdar, and S. Matic, “Time-safety checking for embedded programs,” in Proceedings of the 2nd International Conference on Embedded Software, Grenoble, France, 2002, vol. 2491, pp. 76–92.

T. A. Henzinger and C. Kirsch, “The embedded machine: predictable, portable real-time code,” in Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation, Berlin, Germany, 2002, pp. 315–326.

T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre, “Lazy abstraction,” in Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Portland, OR, USA, 2002, pp. 58–70.

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

B. Horowitz et al., “Embedded software design and system integration for rotorcraft UAV using platforms,” in Proceedings of the 15th Triennial World Congress of the International Federation of Automatic Control, Barcelona, Spain, 2002, vol. 15, no. 1.

C. Kirsch, M. Sanvido, T. A. Henzinger, and W. Pree, “A Giotto-based helicopter control system,” in Proceedings of the 2nd International Conference on Embedded Software, Grenoble, France, 2002, vol. 2491, pp. 46–60.

M. Jurdziski, O. Kupferman, and T. A. Henzinger, “Trading probability for fairness,” in Proceedings of the 16th International Workshop on Computer Science Logic, Edinburgh, Scotland, 2002, vol. 2471, pp. 292–305.

R. Passerone, L. De Alfaro, T. A. Henzinger, and A. Sangiovanni Vincentelli, “Convertibility verification and converter synthesis: Two faces of the same coin,” in Proceedings of the 11th IEEE/ACM international conference on Computer-aided design, San Jose, CA, USA, 2002, pp. 132–139.

J. Raskin, P. Schobbens, and T. A. Henzinger, “Axioms for real-time logics,” Theoretical Computer Science, vol. 274, no. 1–2. Elsevier, pp. 151–182, 2002.

L. De Alfaro, T. A. Henzinger, and F. Mang, “The control of synchronous systems, Part II,” in Proceedings of the 12th International Conference on on Concurrency Theory, Aalborg, Denmark, 2001, vol. 2154, pp. 566–581.

L. De Alfaro, T. A. Henzinger, and R. Majumdar, “Symbolic algorithms for infinite-state games,” in Proceedings of the 12th International Conference on on Concurrency Theory, Aalborg, Denmark, 2001, vol. 2154, pp. 536–550.

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

L. De Alfaro, T. A. Henzinger, and F. Mang, “MCWEB: A model-checking tool for web-site debugging,” in Proceedings of the 10th international conference on World Wide Web, Hong Kong, Hong Kong, 2001, pp. 86–87.

L. De Alfaro, T. A. Henzinger, and R. Jhala, “Compositional methods for probabilistic systems,” in Proceedings of the 12th International Conference on on Concurrency Theory, Aalborg, Denmark, 2001, vol. 2154, pp. 351–365.

R. Alur et al., “jMocha: A model-checking tool that exploits design structure,” in Proceedings of the 23rd International Conference on Software Engineering, 2001, pp. 835–836.

R. Alur, R. Brayton, T. A. Henzinger, S. Qadeer, and S. Rajamani, “Partial-order reduction in symbolic state-space exploration,” Formal Methods in System Design, vol. 18, no. 2. Springer, pp. 97–116, 2001.

L. De Alfaro and T. A. Henzinger, “Interface automata,” in Proceedings of the 8th European software engineering conference, Vienna, Austria, 2001, pp. 109–120.

L. De Alfaro and T. A. Henzinger, “Interface theories for component-based design,” in Proceedings of the 1st International Workshop on Embedded Software, Tahoe City, CA, USA, 2001, vol. 2211, pp. 148–165.

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

T. A. Henzinger, M. Minea, and V. Prabhu, “Assume-guarantee reasoning for hierarchical hybrid systems,” in Proceedings of the 4th International Workshop on Hybrid Systems, Rome, Italy, 2001, vol. 2034, pp. 275–290.

T. A. Henzinger, B. Horowitz, and C. Kirsch, “Embedded control systems development with Giotto,” in Proceedings of the 2nd ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems, New York, NY, United States, 2001, pp. 64–72.

T. A. Henzinger, B. Horowitz, and C. Kirsch, “Giotto: A time-triggered language for embedded programming,” in Proceedings of the 1st International Workshop on Embedded Software, Tahoe City, CA, USA, 2001, vol. 2211, pp. 166–184.

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

T. A. Henzinger, Ed., EMSOFT: Embedded Software, vol. 2211. ACM, 2001.

L. De Alfaro, T. A. Henzinger, and F. Mang, “The control of synchronous systems,” in Proceedings of the 11th International Conference on Concurrency Theory, University Park, PA, USA, 2000, vol. 1877, pp. 458–473.

L. De Alfaro, T. A. Henzinger, and F. Mang, “Detecting errors before reaching them,” in Proceedings of the 12th International Conference on Computer Aided Verification, Chicago, IL, USA, 2000, vol. 1855, pp. 186–201.

L. De Alfaro and T. A. Henzinger, “Concurrent omega-regular games,” in Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, CA, USA, 2000, pp. 141–154.

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

R. Alur, T. A. Henzinger, G. Lafferriere, and G. Pappas, “Discrete abstractions of hybrid systems,” Proceedings of the IEEE, vol. 88, no. 7. IEEE, pp. 971–984, 2000.

T. A. Henzinger, R. Majumdar, F. Mang, and J. Raskin, “Abstract interpretation of game properties,” in Proceedings of the 7th International Symposium on Static Analysis, Santa Barbara, CA, USA, 2000, vol. 1824, pp. 220–239.

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

T. A. Henzinger, S. Qadeer, and S. Rajamani, “Decomposing refinement proofs using assume-guarantee reasoning,” in Proceedings of the 2000 International Conference on Computer-Aided Design, San Jose, CA, USA, 2000, pp. 245–252.

T. A. Henzinger, “The theory of hybrid automata,” in Verification of Digital and Hybrid Systems, vol. 170, M. Inan and R. Kurshan, Eds. Springer, 2000, pp. 265–292.

T. A. Henzinger and S. Rajamani, “Fair bisimulation,” in Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Berlin, Germany, 2000, vol. 1785, pp. 299–314.

T. A. Henzinger and R. Majumdar, “A classification of symbolic transition systems,” in Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, 2000, vol. 1770, pp. 13–34.

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

T. A. Henzinger and J. Raskin, “Robust undecidability of timed and hybrid systems,” in Proceedings of the 3rd International Workshop on Hybrid Systems, Pittsburgh, PA, USA, 2000, vol. 1790, pp. 145–159.

T. A. Henzinger and P. Kopke, “Discrete-time control for rectangular hybrid automata,” Theoretical Computer Science, vol. 221, no. 1–2. Elsevier, pp. 369–392, 1999.

T. A. Henzinger, S. Qadeer, and S. Rajamani, “Verifying sequential consistency on shared-memory multiprocessor systems,” in Proceedings of the 11th International Conference on Computer Aided Verification, Trento, Italy, 1999, vol. 1633, pp. 301–315.

T. A. Henzinger, B. Horowitz, and R. Majumdar, “Rectangular hybrid games,” in Proceedings of the 10th International Conference on Concurrency Theory, Eindhoven, The Netherlands, 1999, vol. 1664, pp. 320–335.

T. A. Henzinger, X. Liu, S. Qadeer, and S. Rajamani, “Formal specification and verification of a dataflow processor array,” presented at the ICCAD: Computer-Aided Design, San Jose, CA, United States of America, 1999, pp. 494–499.

T. A. Henzinger, S. Qadeer, and S. Rajamani, “Assume-guarantee refinement between different time scales,” in Proceedings of the 11th International Conference on Computer Aided Verification, Trento, Italy, 1999, vol. 1633, pp. 208–221.

R. Alur and T. A. Henzinger, “Reactive modules,” Formal Methods in System Design, vol. 15, no. 1. Springer, pp. 7–48, 1999.

R. Alur, T. A. Henzinger, and O. Kupferman, “Alternating-time temporal logic,” in Proceedings of the International Symposium on Compositionality, Bad Malente, Germany, 1999, vol. 1536, pp. 23–60.

R. Alur, L. De Alfaro, T. A. Henzinger, and F. Mang, “Automating modular verification,” in Proceedings of the 10th International Conference on Concurrency Theory, Eindhoven, The Netherlands, 1999, vol. 1664, pp. 82–97.

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

J. Raskin, P. Schobbens, and T. A. Henzinger, “Axioms for real-time logics,” in Proceedings of the 9th Interantional Conference on Concurrency Theory, Nice, France, 1998, vol. 1466, pp. 219–236.

T. A. Henzinger and V. Rusu, “Reachability verification for hybrid automata,” in Proceedings of the 1st International Workshop on Hybrid Systems: Computation and Control, Berkely, CA, United States of America, 1998, vol. 1386, pp. 190–204.

T. A. Henzinger, Ed., HSCC: Hybrid Systems—Computation and Control, vol. 1386. Springer, 1998.

T. A. Henzinger, S. Qadeer, S. Rajamani, and S. Tasiran, “An assume-guarantee rule for checking simulation,” in Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design, Palo Alto, CA, United States of America, 1998, vol. 1522, pp. 421–432.

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

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

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

T. A. Henzinger, P. Ho, and H. Wong Toi, “Algorithmic analysis of nonlinear hybrid systems,” IEEE Transactions on Automatic Control, vol. 43, no. 4. IEEE, pp. 540–554, 1998.

T. A. Henzinger, P. Kopke, A. Puri, and P. Varaiya, “What’s decidable about hybrid automata?,” Journal of Computer and System Sciences, vol. 57, no. 1. Elsevier, pp. 94–124, 1998.

T. A. Henzinger, “It’s about time: Real-time logics reviewed,” in Proceedings of the 9th Interantional Conference on Concurrency Theory, Nice, France, 1998, vol. 1466, pp. 439–454.

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

R. Alur, T. A. Henzinger, O. Kupferman, and M. Vardi, “Alternating refinement relations,” in Proceedings of the 9th Interantional Conference on Concurrency Theory, Nice, France, 1998, vol. 1466, pp. 163–178.

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

L. De Alfaro, T. A. Henzinger, and O. Kupferman, “Concurrent reachability games,” in  Proceedings 39th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, United States of America, 1998, pp. 564–575.

T. A. Henzinger and O. Kupferman, “From quantity to quality,” in Proceedings of the 5th International Workshop on Hybrid and Real-Time Systems, Grenoble, France, 1997, vol. 1201, pp. 48–62.

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

T. A. Henzinger, O. Kupferman, and S. Rajamani, “Fair simulation,” in Proceedings of the 8th International Conference on Concurrency Theory, Warsaw, Poland, 1997, vol. 1243, pp. 273–287.

T. A. Henzinger, P. Ho, and H. Wong Toi, “HyTech: A model checker for hybrid systems,” presented at the CAV: Computer Aided Verification, Haifa, Israel, 1997, vol. 1254, pp. 460–463.

T. A. Henzinger, P. Ho, and H. Wong Toi, “HyTech: A model checker for hybrid systems,” Software Tools For Technology Transfer, vol. 1, no. 1–2. Springer, pp. 110–122, 1997.

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

R. Alur and T. A. Henzinger, “Modularity for timed and hybrid systems,” in 8th International Conference on Concurrency Theory, Warsaw, Poland, 1997, vol. 1243, pp. 74–88.

R. Alur and T. A. Henzinger, “Real-time system = discrete system + clock variables,” Software Tools For Technology Transfer, vol. 1, no. 1–2. Springer, pp. 86–109, 1997.

R. Alur, R. Brayton, T. A. Henzinger, S. Qadeer, and S. Rajamani, “Partial-order reduction in symbolic state-space exploration,” in 9th International Conference on Computer Aided Verification, Haifa, Israel, 1997, vol. 1254, pp. 340–351.

R. Alur, T. A. Henzinger, and O. Kupferman, “Alternating-time temporal logic,” in Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Washington, DC, United States, 1997, pp. 100–109.

R. Alur, C. Courcoubetis, and T. A. Henzinger, “Computing accumulated delays in real-time systems,” Formal Methods in System Design, vol. 11, no. 2. Springer, pp. 137–156, 1997.

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

T. A. Henzinger and H. Wong Toi, “Linear phase-portrait approximations for nonlinear hybrid systems,” in Hybrid Systems III: Verification and Control, 1996, vol. 1066, pp. 377–388.

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

T. A. Henzinger and P. Kopke, “State equivalences for rectangular hybrid automata,” in 7th International Conference on Concurrency Theory, Pisa, Italy, 1996, vol. 1119, pp. 530–545.

T. A. Henzinger, O. Kupferman, and M. Vardi, “A space-efficient on-the-fly algorithm for real-time model checking,” in 7th International Conference on Concurrency Theory, Pisa, Italy, 1996, vol. 1119, pp. 514–529.

T. A. Henzinger, “The theory of hybrid automata,” in Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, NJ, United States of America, 1996, pp. 278–292.

T. A. Henzinger and R. Alur, Eds.,  8th International Conference on Computer Aided Verification, vol. 1102. Springer, 1996.

R. Alur and T. A. Henzinger, “Reactive modules,” in Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, NJ, USA, 1996, pp. 207–218.

R. Alur, T. A. Henzinger, and P. Ho, “Automatic symbolic verification of embedded systems,” IEEE Transactions on Software Engineering, vol. 22, no. 3. IEEE, pp. 181–201, 1996.

R. Alur, T. Feder, and T. A. Henzinger, “The benefits of relaxing punctuality,” Journal of the ACM, vol. 43, no. 1. ACM, pp. 116–146, 1996.

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

T. A. Henzinger and P. Ho, “Algorithmic analysis of nonlinear hybrid systems,” in 7th International Conference on Computer Aided Verification, Liege, Belgium, 1995, vol. 939, pp. 225–238.

T. A. Henzinger and P. Ho, “A note on abstract-interpretation strategies for hybrid automata,” in 3rd International Hybrid Systems Workshop, Ithaca, NY, United States of America, 1995, vol. 999, pp. 252–264.

T. A. Henzinger and P. Ho, “HyTech: The Cornell Hybrid Technology Tool,” in 4th International Hybrid Systems Workshop,  New Brunswick, NJ, United States of America, 1995, vol. 999, pp. 265–293.

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

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

M. H. Henzinger, T. A. Henzinger, and P. Kopke, “Computing simulations on finite and infinite graphs,” in Proceedings of IEEE 36th Annual Foundations of Computer Science, Milwaukee, WI, United States of America, 1995, pp. 453–462.

T. A. Henzinger, P. Kopke, A. Puri, and P. Varaiya, “What’s decidable about hybrid automata?,” in Proceedings of the 27th annual ACM symposium on Theory of computing, Las Vegas, NV, United States of America, 1995, pp. 373–382.

T. A. Henzinger, P. Kopke, and H. Wong Toi, “The expressive power of clocks,” in 22nd International Colloquium on Automata, Languages and Programming , Szeged, Hungary, 1995, vol. 944, pp. 417–428.

T. A. Henzinger, “Hybrid automata with finite bisimulations,” in 22nd International Colloquium on Automata, Languages and Programming , Szeged, Hungary, 1995, vol. 944, pp. 324–335.

R. Alur and T. A. Henzinger, “Local liveness for compositional modeling of fair reactive systems,” in 7th International Conference on Computer Aided Verification, Liege, Belgium, 1995, vol. 939, pp. 166–179.

R. Alur et al., “The algorithmic analysis of hybrid systems,” Theoretical Computer Science, vol. 138, no. 1. Elsevier, pp. 3–34, 1995.

A. Kapur, T. A. Henzinger, Z. Manna, and A. Pnueli, “Proving safety properties of hybrid systems,” in 3rd International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, Lübeck, Germany, 1994, vol. 863, pp. 431–454.

T. A. Henzinger and P. Kopke, “Verification methods for the divergent runs of clock systems,” in 3rd International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, Lübeck, Gernany, 1994, vol. 863, pp. 351–372.

T. A. Henzinger, Z. Manna, and A. Pnueli, “Temporal proof methodologies for timed transition systems,” Information and Computation, vol. 112, no. 2. Elsevier, pp. 273–337, 1994.

T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, “Symbolic model checking for real-time systems,” Information and Computation, vol. 111, no. 2. Elsevier, pp. 193–244, 1994.

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

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

R. Alur and T. A. Henzinger, “A really temporal logic,” Journal of the ACM, vol. 41, no. 1. ACM, pp. 181–204, 1994.

R. Alur, C. Courcoubetis, and T. A. Henzinger, “The observational power of clocks,” in 5th International Conference on Concurrency Theory, Uppsala, Sweden, 1994, vol. 836, pp. 162–177.

R. Alur, L. Fix, and T. A. Henzinger, “A determinizable class of timed automata,” in International Conference on Computer Aided Verification, Stanford, CA, United States of America, 1994, vol. 818, pp. 1–13.

R. Alur et al., “The algorithmic analysis of hybrid systems,” in 11th International Conference on Analysis and Optimization of Systems Discrete Event Systems, Sophia-Antipolis, France, 1994, vol. 199, pp. 331–351.

T. A. Henzinger, Z. Manna, and A. Pnueli, “Towards refining temporal specifications into hybrid systems,” in International Hybrid Systems Workshop, 1993, vol. 736, pp. 60–76.

R. Alur and T. A. Henzinger, “Real-time logics: Complexity and expressiveness,” Information and Computation, vol. 104, no. 1. Elsevier, pp. 35–77, 1993.

R. Alur, C. Courcoubetis, T. A. Henzinger, and P. Ho, “Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems,” in Hybrid Systems, 1993, vol. 736, pp. 209–229.

R. Alur, T. A. Henzinger, and P. Ho, “Automatic symbolic verification of embedded systems,” in 1993 Proceedings Real-Time Systems Symposium, Raleigh, NC, United States of America, 1993, pp. 2–11.

R. Alur, C. Courcoubetis, and T. A. Henzinger, “Computing accumulated delays in real-time systems,” in 5th International Conference on Computer Aided Verification, Elounda, Greece, 1993, vol. 697, pp. 181–193.

R. Alur, T. A. Henzinger, and M. Vardi, “Parametric real-time reasoning,” in Proceedings of the 25th annual ACM symposium on Theory of Computing, San Diego, CA, United States of America, 1993, pp. 592–601.

T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, “Symbolic model checking for real-time systems,” in Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, CA, United States of America, 1992, pp. 394–406.

T. A. Henzinger, Z. Manna, and A. Pnueli, “What good are digital clocks?,” in 19th International Colloquium on Automata, Languages and Programming, Vienna, Austria, 1992, vol. 623, pp. 545–558.

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

T. A. Henzinger, “Sooner Is Safer Than Later,” Information Processing Letters, vol. 43, no. 3. Elsevier, pp. 135–141, 1992.

R. Alur and T. A. Henzinger, “Logics and models of real time: A survey,” in REX Workshop on Real Time: Theory in Practice, Mook, The Netherlands, 1992, vol. 600, pp. 74–106.

R. Alur and T. A. Henzinger, “Back to the future: Towards a theory of timed regular languages,” in Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, United States of America, 1992, pp. 177–186.

T. A. Henzinger, Z. Manna, and A. Pnueli, “Temporal proof methodologies for real-time systems,” in Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Orlando, FL, United States of America, 1991, pp. 353–366.

T. A. Henzinger, “The temporal specification and verification of real-time systems ,” Stanford University, 1991.

R. Alur and T. A. Henzinger, “Time for logic,” SIGACT News, vol. 22, no. 3. ACM, pp. 6–12, 1991.

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

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

T. A. Henzinger, “Half-order modal logic: How to prove real-time properties,” in Proceedings of the 9th annual ACM symposium on Principles of distributed computing, Quebec City, Canada, 1990, pp. 281–296.

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

R. Alur and T. A. Henzinger, “A really temporal logic,” in 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, USA, 1989, pp. 164–169.