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

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

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

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

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

Analysis of dynamic message passing programs
D. Zufferey, Analysis of Dynamic Message Passing Programs, Institute of Science and Technology Austria, 2013.

Structural Counter Abstraction
K. Bansal, E. Koskinen, T. Wies, D. Zufferey, 7795 (2013) 62–77.

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

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

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

Evolutionary game dynamics in populations with different learners
K. Chatterjee, D. Zufferey, M. Nowak, Journal of Theoretical Biology 301 (2012) 161–173.

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

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

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

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

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

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

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

Parametric identification of temporal properties
E. Asarin, A. Donzé, O. Maler, D. Nickovic, in:, Springer, 2012, pp. 147–160.

Abstract domains for automated reasoning about list manipulating programs with infinite data
A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2012, pp. 1–22.

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

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

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

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

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

Algorithmic analysis of array-accessing programs
R. Alur, P. Cerny, S. Weinstein, ACM Transactions on Computational Logic (TOCL) 13 (2012).

Translating to Co-Büchi made tight, unified, and useful
U. Boker, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 13 (2012).

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

Accurate invariant checking for programs manipulating lists and arrays with infinite data
A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Automated Technology for Verification and Analysis, Springer, Berlin, Heidelberg, 2012, pp. 167–182.

HSF(C): A software verifier based on Horn clauses
S. Grebenshchikov, A. Gupta, N.P. Lopes, C. Popeea, A. Rybalchenko, in:, C. Flanagan, B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems, Springer, Berlin, Heidelberg, 2012, pp. 549–551.

Improved Single Pass Algorithms for Resolution Proof Reduction
A. Gupta, in:, Automated Technology for Verification and Analysis, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 107–121.

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

Solving recursion-free Horn clauses over LI+UIF
A. Gupta, C. Popeea, A. Rybalchenko, in:, H. Yang (Ed.), Springer, 2011, pp. 188–203.

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

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

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

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

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

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

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

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

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

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

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

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

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

What’s decidable about weighted automata 
S. Almagor, U. Boker, O. Kupferman, in:, Springer, 2011, pp. 482–491.

Streaming transducers for algorithmic verification of single pass list processing programs
R. Alur, P. Cerny, in:, ACM, 2011, pp. 599–610.

Decision procedures for automating termination proofs
R. Piskac, T. Wies, in:, R. Jhala, D. Schmidt (Eds.), Springer, 2011, pp. 371–386.

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