Quantitative interprocedural analysis
K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis, IST Austria, 2016.

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

Guided search for hybrid systems based on coarse-grained space abstractions
S. Bogomolov, A. Donzé, G. Frehse, R. Grosu, T. Johnson, H. Ladan, A. Podelski, M. Wehrle, International Journal on Software Tools for Technology Transfer 18 (2016) 449–467.

Synthesizing time triggered schedules for switched networks with faulty links
G. Avni, S. Guha, G. Rodríguez Navas, in:, Proceedings of the 13th International Conference on Embedded Software , ACM, 2016.

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

QLOSE: Program repair with quantitative objectives
L. D’Antoni, R. Samanta, R. Singh, in:, Springer, 2016, pp. 383–401.

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

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

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

Model and objective separation with conditional lower bounds: disjunction is harder than conjunction
K. Chatterjee, W. Dvoák, M. Henzinger, V. Loitzenbauer, in:, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206.

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

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

Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, in:, ACM, 2016, pp. 327–342.

Optimal cost almost-sure reachability in POMDPs
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Artificial Intelligence 234 (2016) 26–48.

On computability and triviality of well groups
P. Franek, M. Krcál, Discrete &; Computational Geometry 56 (2016) 126–164.

Selective barriers to horizontal gene transfer
H. Acar, Selective Barriers to Horizontal Gene Transfer, Institute of Science and Technology Austria, 2016.

Error-robust modes of the retinal population code
J. Prentice, O. Marre, M. Ioffe, A. Loback, G. Tkadik, M. Berry, PLoS Computational Biology 12 (2016).

Computational multicopter design
T. Du, A. Schulz, B. Zhu, B. Bickel, W. Matusik, in:, ACM, 2016.

Computational design of stable planar-rod structures
E. Miguel Villalba, M. Lepoutre, B. Bickel, in:, ACM, 2016.

FlexMolds: Automatic design of flexible shells for molding
L. Malomo, N. Pietroni, B. Bickel, P. Cignoni, in:, ACM, 2016.