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 | 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