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.

Filip Cano Cordoba

Mahyar Karimi

Thomas Henzinger

K. S. Thejaswini

Konstantin Kueffner

Pavol Kebis

N. Ege Saraç

Stefanie Muroya Lei

Ana Oliveira da Costa

Emily Yu

Marek Chalupa

Roopsha Samanta

Sergiy Bogomolov

Thomas Wies

Fabian Mühlböck

Andrey Kupriyanov

Mathias Lechner

Halalai, Raluca

Bernhard Kragl

Thomas Ferrère

Adrian Elgyütt

Mirco Giacobbe

Vasu Singh

Guy Avni

Oliveira da Costa, Ana

Joost Katoen

Anna Lukina

Thorsten Tarrach

Nicolas Mazzocchi

Duc Hiep Chu

Cezara Dragoi

Anmol Tomar

Hui Kong

Ali Sezgin

Jan Kretinsky

Udi Boker

Damien Zufferey

Christian Schilling

Jakob Ruess

Przemyslaw Daca

Tatjana Petrov

Ashutosh Gupta

Arjun Radhakrishna

Jessica Davies

Jan Otop

Samuel Pastva

Singh, Anmol

Luka Zeleznik

Kaushik Mallik

Miriam García Soto

Dejan Nickovic

Pavol Cerny

Abhinav Verma



414 Publications

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 | 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: 3299 | OA
Propagation models for computing biochemical reaction networks
T.A. Henzinger, M. Mateescu, in:, Springer, 2011, pp. 1–3.
[Submitted Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3301 | OA
Tail approximation for the chemical master equation
T.A. Henzinger, M. Mateescu, in:, Tampere International Center for Signal Processing, 2011.
[Submitted Version] View | Files available
 
2011 | Published | Conference Paper | IST-REx-ID: 3302 | OA
Static scheduling in clouds
T.A. Henzinger, A. Singh, V. Singh, T. Wies, D. Zufferey, in:, USENIX, 2011, pp. 1–6.
[Submitted Version] View | Files available
 
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: 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: 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: 3355 | OA
Quantitative evaluation of BFT protocols
R. Halalai, T.A. Henzinger, V. Singh, in:, IEEE, 2011, pp. 255–264.
[Submitted Version] View | Files available | 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 | 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 | 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 | Conference Paper | IST-REx-ID: 3365 | OA
QUASY: quantitative synthesis tool
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271.
[Submitted Version] View | Files available | DOI
 
2011 | Published | Journal Article | IST-REx-ID: 3381 | OA
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.
[Submitted 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 | 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 | Journal Article | IST-REx-ID: 3352
Biology as reactivity
J. Fisher, D. Harel, T.A. Henzinger, Communications of the ACM 54 (2011) 72–82.
View | DOI
 
2011 | Published | Journal Article | IST-REx-ID: 3353 | OA
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).
[Submitted Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3362 | OA
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.
[Submitted Version] View | Files available | DOI
 
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
 

Search

Filter Publications

Display / Sort

Export / Embed