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.
440 Publications
2011 |
Published |
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 |
Published |
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
| WoS
2011 |
Published |
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 |
Submitted |
Preprint |
IST-REx-ID: 3363 |
Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words. 1104.0127.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 |
Published |
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
| WoS
2011 |
Published |
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 |
Published |
Conference Paper |
IST-REx-ID: 3366 |
Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.
[Submitted Version]
View
| Files available
| DOI
2011 |
Published |
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
| WoS
2011 |
Published |
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 |
Published |
Conference Paper |
IST-REx-ID: 3302 |
Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. 2011. Static scheduling in clouds. 3rd USENIX Workshop on Hot Topics in Cloud Computing. HotCloud: Workshop on Hot Topics in Cloud Computing, 1–6.
[Submitted Version]
View
| Files available
earlier version | 2011 |
Published |
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
| WoS
earlier version | 2011 |
Published |
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 |
Published |
Journal Article |
IST-REx-ID: 3353 |
Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems. 33(4), 14.
[Submitted Version]
View
| Files available
| DOI
| WoS
earlier version | 2011 |
Published |
Journal Article |
IST-REx-ID: 3354
Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic. 12(4), 28.
View
| Files available
| DOI
| WoS
2010 |
Published |
Conference Paper |
IST-REx-ID: 10908 |
Blanc R, Henzinger TA, Hottelier T, Kovács L. 2010. ABC: Algebraic Bound Computation for loops. Logic for Programming, Artificial Intelligence, and Reasoning. LPAR: Logic for Programming, Artificial Intelligence and ReasoningLNCS vol. 6355, 103–118.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2010 |
Published |
Conference Paper |
IST-REx-ID: 4361 |
Wies T, Zufferey D, Henzinger TA. 2010. Forward analysis of depth-bounded processes. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 6014, 94–108.
[Submitted Version]
View
| Files available
| DOI
2010 |
Published |
Conference Paper |
IST-REx-ID: 4369 |
Nickovic D, Piterman N. 2010. From MTL to deterministic timed automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6246, 152–167.
[Submitted Version]
View
| Files available
| DOI
2010 |
Published |
Conference Paper |
IST-REx-ID: 4378 |
Kuncak V, Piskac R, Suter P, Wies T. 2010. Building a calculus of data structures. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 5944, 26–44.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)