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.
386 Publications
2011 | Conference Paper | IST-REx-ID: 3362 | 
Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. 2011. Dynamic reactive modules. CONCUR: Concurrency Theory, LNCS, vol. 6901, 404–418.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3365 |
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 6605, 267–271.
[Submitted Version]
View
| Files available
| DOI
2011 | Preprint | IST-REx-ID: 3363 |
Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2011 | Journal Article | IST-REx-ID: 3381 |
Henzinger TA, Jobstmann B, Wolf V. 2011. Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. 22(4), 823–841.
[Submitted Version]
View
| Files available
| DOI
2011 | Journal Article | IST-REx-ID: 3315 |
Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4).
[Published Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3326 |
Almagor S, Boker U, Kupferman O. 2011. What’s decidable about weighted automata . ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6996, 482–491.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3324 |
Piskac R, Wies T. 2011. Decision procedures for automating termination proofs. VMCAI: Verification Model Checking and Abstract Interpretation, LNCS, vol. 6538, 371–386.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Conference Paper | IST-REx-ID: 3360 |
Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.
[Published Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3361 |
Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3358 |
Henzinger TA, Singh V, Wies T, Zufferey D. 2011. Scheduling large jobs by abstraction refinement. EuroSys, 329–342.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Journal Article | IST-REx-ID: 3364 |
Didier F, Henzinger TA, Mateescu M, Wolf V. 2011. Approximation of event probabilities in noisy cellular processes. Theoretical Computer Science. 412(21), 2128–2141.
[Submitted Version]
View
| Files available
| DOI
2011 | Journal Article | IST-REx-ID: 531 |
Guerraoui R, Henzinger TA, Singh V. 2011. Verification of STM on relaxed memory models. Formal Methods in System Design. 39(3), 297–331.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Conference Paper | IST-REx-ID: 3356 |
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.
[Submitted Version]
View
| Files available
| DOI
2011 | Technical Report | IST-REx-ID: 5385 |
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.
[Published Version]
View
| Files available
| DOI
2011 | Technical Report | IST-REx-ID: 5383 |
Wies T, Muñiz M, Kuncak V. 2011. On an efficient decision procedure for imperative tree data structures, IST Austria, 25p.
[Published Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3323
Wies T, Muñiz M, Kuncak V. 2011. An efficient decision procedure for imperative tree data structures. CADE 23: Automated Deduction , LNAI , vol. 6803, 476–491.
View
| Files available
| DOI