Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

Thomas Henzinger

Konstantin Kueffner

Stefanie Muroya Lei

Ana Oliveira da Costa

Mahyar Karimi

Marek Chalupa

Emily Yu

Kaushik Mallik

N. Ege Saraç

K. S. Thejaswini

Adrian Elgyütt

Hui Kong

Tatjana Petrov

Luka Zeleznik

Jakob Ruess

Jessica Davies

Jan Otop

Cezara Dragoi

Thomas Ferrère

Fabian Mühlböck

Halalai, Raluca

Thomas Wies

Anmol Tomar

Bernhard Kragl

Christian Schilling

Singh, Anmol

Pavol Cerny

Mirco Giacobbe

Nicolas Mazzocchi

Anna Lukina

Przemyslaw Daca

Duc Hiep Chu

Roopsha Samanta

Ali Sezgin

Dejan Nickovic

Sergiy Bogomolov

Joost Katoen

Vasu Singh

Arjun Radhakrishna

Damien Zufferey

Udi Boker

Mathias Lechner

Thorsten Tarrach

Ashutosh Gupta

Guy Avni

Oliveira da Costa, Ana

Miriam García Soto

Abhinav Verma

Jan Kretinsky

Andrey Kupriyanov

Samuel Pastva



401 Publications

2011 |Published| Journal Article | IST-REx-ID: 3315 | OA
Timed parity games: Complexity and robustness
K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).
[Published Version] View | Files available | DOI
 
2011 |Published| Conference Paper | IST-REx-ID: 3326 | OA
What’s decidable about weighted automata
S. Almagor, U. Boker, O. Kupferman, in:, Springer, 2011, pp. 482–491.
[Submitted Version] View | Files available | DOI
 
2011 |Published| Conference Paper | IST-REx-ID: 3325
Streaming transducers for algorithmic verification of single pass list processing programs
R. Alur, P. Cerny, in:, ACM, 2011, pp. 599–610.
View | DOI
 
2011 |Published| Conference Paper | IST-REx-ID: 3324 | OA
Decision procedures for automating termination proofs
R. Piskac, T. Wies, in:, R. Jhala, D. Schmidt (Eds.), Springer, 2011, pp. 371–386.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2011 |Published| Conference Paper | IST-REx-ID: 3360 | OA
Determinizing discounted-sum automata
U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.
[Published Version] View | Files available | DOI
 
2011 |Published| Conference Paper | IST-REx-ID: 3361 | OA
The complexity of quantitative information flow problems
P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.
[Submitted Version] View | Files available | DOI
 
2011 |Published| Conference Paper | IST-REx-ID: 3358 | OA
Scheduling large jobs by abstraction refinement
T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 329–342.
[Published Version] View | DOI | Download Published Version (ext.)
 
2011 |Published| Conference Paper | IST-REx-ID: 3359
From boolean to quantitative synthesis
P. Cerny, T.A. Henzinger, in:, ACM, 2011, pp. 149–154.
View | DOI
 
2011 |Published| Conference Paper | IST-REx-ID: 3357
The complexity of request-response games
K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.
View | DOI
 
2011 |Published| Journal Article | IST-REx-ID: 3364 | OA
Approximation of event probabilities in noisy cellular processes
F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, Theoretical Computer Science 412 (2011) 2128–2141.
[Submitted Version] View | Files available | DOI
 
2011 |Published| Journal Article | IST-REx-ID: 531 | OA
Verification of STM on relaxed memory models
R. Guerraoui, T.A. Henzinger, V. Singh, Formal Methods in System Design 39 (2011) 297–331.
[Published Version] View | DOI | Download Published Version (ext.)
 
2011 |Published| Conference Paper | IST-REx-ID: 3356 | OA
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.
[Submitted Version] View | Files available | DOI
 
2011 |Published| Technical Report | IST-REx-ID: 5385 | OA
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.
[Published Version] View | Files available | DOI
 
2011 |Published| Technical Report | IST-REx-ID: 5383 | OA
On an efficient decision procedure for imperative tree data structures
T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative Tree Data Structures, IST Austria, 2011.
[Published Version] View | Files available | DOI
 
2011 |Published| Conference Paper | IST-REx-ID: 3323
An efficient decision procedure for imperative tree data structures
T. Wies, M. Muñiz, V. Kuncak, in:, Springer, 2011, pp. 476–491.
View | Files available | DOI
 
2011 |Published| Conference Paper | IST-REx-ID: 3366 | OA
Quantitative synthesis for concurrent programs
P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.
[Submitted Version] View | Files available | DOI
 
2010 |Published| Conference Paper | IST-REx-ID: 10908 | OA
ABC: Algebraic Bound Computation for loops
R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2010 |Published| Conference Paper | IST-REx-ID: 3719 | OA
Lumpability abstractions of rule-based systems
J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, in:, Open Publishing Association, 2010, pp. 142–161.
[Submitted Version] View | Files available | arXiv
 
2010 |Published| Conference Paper | IST-REx-ID: 3847 | OA
SABRE: A tool for the stochastic analysis of biochemical reaction networks
F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2010, pp. 193–194.
[Submitted Version] View | Files available | DOI
 
2010 |Published| Conference Paper | IST-REx-ID: 3845 | OA
Aligators for arrays
T.A. Henzinger, T. Hottelier, L. Kovács, A. Rybalchenko, in:, Springer, 2010, pp. 348–356.
[Submitted Version] View | Files available | DOI
 

Search

Filter Publications