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

Kaushik Mallik

N. Ege Saraç

Samuel Pastva

Marek Chalupa

Konstantin Kueffner

Stefanie Muroya Lei

Emily Yu

K. S. Thejaswini

Nicolas Mazzocchi

Thorsten Tarrach

Anmol Tomar

Damien Zufferey

Hui Kong

Pavol Cerny

Thomas Wies

Przemyslaw Daca

Guy Avni

Udi Boker

Ali Sezgin

Duc Hiep Chu

Jan Otop

Mirco Giacobbe

Roopsha Samanta

Sergiy Bogomolov

Jessica Davies

Joost Katoen

Halalai, Raluca

Dejan Nickovic

Luka Zeleznik

Miriam García Soto

Singh, Anmol

Thomas Ferrère

Jakob Ruess

Andrey Kupriyanov

Mathias Lechner

Abhinav Verma

Jan Kretinsky

Anna Lukina

Vasu Singh

Tatjana Petrov

Christian Schilling

Oliveira da Costa, Ana

Fabian Mühlböck

Arjun Radhakrishna

Bernhard Kragl

Cezara Dragoi

Ashutosh Gupta

Adrian Elgyütt



386 Publications

2011 | Journal Article | IST-REx-ID: 3315 | OA
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” Logical Methods in Computer Science, vol. 7, no. 4. International Federation of Computational Logic, 2011.
[Published Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3326 | OA
S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted automata ,” presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan, 2011, vol. 6996, pp. 482–491.
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3325
R. Alur and P. Cerny, “Streaming transducers for algorithmic verification of single pass list processing programs,” presented at the POPL: Principles of Programming Languages, Texas, USA, 2011, vol. 46, no. 1, pp. 599–610.
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3324 | OA
R. Piskac and T. Wies, “Decision procedures for automating termination proofs,” presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA, 2011, vol. 6538, pp. 371–386.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3360 | OA
U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.
[Published Version] View | Files available | DOI
 
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
 

Search

Filter Publications