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.




2967 Publications

2011 | Journal Article | IST-REx-ID: 3354
Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4), 28.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3355 | OA
Halalai R, Henzinger TA, Singh V. 2011. Quantitative evaluation of BFT protocols. QEST: Quantitative Evaluation of Systems, 255–264.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3356 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3358 | OA
Henzinger TA, Singh V, Wies T, Zufferey D. 2011. Scheduling large jobs by abstraction refinement. EuroSys, 329–342.
View | DOI | Download Published Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3359
Cerny P, Henzinger TA. 2011. From boolean to quantitative synthesis. EMSOFT: Embedded Software , 149–154.
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3360 | OA
Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3361 | OA
Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3362 | OA
Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. 2011. Dynamic reactive modules. CONCUR: Concurrency Theory, LNCS, vol. 6901, 404–418.
View | Files available | DOI
 
2011 | Preprint | IST-REx-ID: 3363 | OA
Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.
View | Download Preprint (ext.) | arXiv
 

Search

Filter Publications