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.

N. Ege Saraç

Marek Chalupa

Emily Yu

Kaushik Mallik

Konstantin Kueffner

K. S. Thejaswini

Stefanie Muroya Lei

Nicolas Mazzocchi

Thomas Henzinger

Samuel Pastva

Thomas Wies

Arjun Radhakrishna

Guy Avni

Joost Katoen

Vasu Singh

Jan Otop

Cezara Dragoi

Halalai, Raluca

Luka Zeleznik

Jessica Davies

Anmol Tomar

Andrey Kupriyanov

Dejan Nickovic

Damien Zufferey

Hui Kong

Przemyslaw Daca

Sergiy Bogomolov

Ashutosh Gupta

Oliveira da Costa, Ana

Mathias Lechner

Tatjana Petrov

Fabian Mühlböck

Christian Schilling

Duc Hiep Chu

Abhinav Verma

Adrian Elgyütt

Bernhard Kragl

Pavol Cerny

Roopsha Samanta

Anna Lukina

Singh, Anmol

Miriam García Soto

Thorsten Tarrach

Ali Sezgin

Jan Kretinsky

Mirco Giacobbe

Thomas Ferrère

Udi Boker

Jakob Ruess



386 Publications

2011 | Conference Paper | IST-REx-ID: 3361 | OA
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.
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3358 | OA
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.
[Published Version] View | DOI | Download Published Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3359
P. Cerny and T. A. Henzinger, “From boolean to quantitative synthesis,” presented at the EMSOFT: Embedded Software , Taipei; Taiwan, 2011, pp. 149–154.
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3357
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.
View | DOI
 
2011 | Journal Article | IST-REx-ID: 3364 | OA
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.
[Submitted Version] View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 531 | OA
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.
[Published Version] View | DOI | Download Published Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3356 | OA
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.
[Submitted Version] View | Files available | DOI
 
2011 | Technical Report | IST-REx-ID: 5385 | OA
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications with accumulative values. IST Austria, 2011.
[Published Version] View | Files available | DOI
 
2011 | Technical Report | IST-REx-ID: 5383 | OA
T. Wies, M. Muñiz, and V. Kuncak, On an efficient decision procedure for imperative tree data structures. IST Austria, 2011.
[Published Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3323
T. Wies, M. Muñiz, and V. Kuncak, “An efficient decision procedure for imperative tree data structures,” presented at the CADE 23: Automated Deduction , Wrocław, Poland, 2011, vol. 6803, pp. 476–491.
View | Files available | DOI
 

Search

Filter Publications