Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

444 Publications


2011 | Published | Journal Article | IST-REx-ID: 3352
Fisher J, Harel D, Henzinger TA. Biology as reactivity. Communications of the ACM. 2011;54(10):72-82. doi:10.1145/2001269.2001289
View | DOI | WoS
 

2011 | Published | Conference Paper | IST-REx-ID: 3355 | OA
Halalai R, Henzinger TA, Singh V. Quantitative evaluation of BFT protocols. In: IEEE; 2011:255-264. doi:10.1109/QEST.2011.40
[Submitted Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. The complexity of request-response games. In: Dediu A-H, Inenaga S, Martín-Vide C, eds. Vol 6638. Springer; 2011:227-237. doi:10.1007/978-3-642-21254-3_17
View | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3358 | OA
Henzinger TA, Singh V, Wies T, Zufferey D. Scheduling large jobs by abstraction refinement. In: ACM; 2011:329-342. doi:10.1145/1966445.1966476
[Published Version] View | DOI | Download Published Version (ext.)
 

2011 | Published | Conference Paper | IST-REx-ID: 3359
Cerny P, Henzinger TA. From boolean to quantitative synthesis. In: ACM; 2011:149-154. doi:10.1145/2038642.2038666
View | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3360 | OA
Boker U, Henzinger TA. Determinizing discounted-sum automata. In: Vol 12. Springer; 2011:82-96. doi:10.4230/LIPIcs.CSL.2011.82
[Published Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3361 | OA
Cerny P, Chatterjee K, Henzinger TA. The complexity of quantitative information flow problems. In: IEEE; 2011:205-217. doi:10.1109/CSF.2011.21
[Submitted Version] View | Files available | DOI | WoS
 

2011 | Published | Conference Paper | IST-REx-ID: 3362 | OA
Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. Dynamic reactive modules. In: Vol 6901. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2011:404-418. doi:10.1007/978-3-642-23217-6_27
[Submitted Version] View | Files available | DOI
 

2011 | Submitted | Preprint | IST-REx-ID: 3363 | OA
Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words. doi:10.48550/arXiv.1104.0127
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2011 | Published | Journal Article | IST-REx-ID: 3364 | OA
Didier F, Henzinger TA, Mateescu M, Wolf V. Approximation of event probabilities in noisy cellular processes. Theoretical Computer Science. 2011;412(21):2128-2141. doi:10.1016/j.tcs.2010.10.022
[Submitted Version] View | Files available | DOI | WoS
 

2011 | Published | Conference Paper | IST-REx-ID: 3365 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. QUASY: quantitative synthesis tool. In: Vol 6605. Springer; 2011:267-271. doi:10.1007/978-3-642-19835-9_24
[Submitted Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3366 | OA
Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. Quantitative synthesis for concurrent programs. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:243-259. doi:10.1007/978-3-642-22110-1_20
[Submitted Version] View | Files available | DOI
 

2011 | Published | Journal Article | IST-REx-ID: 3381 | OA
Henzinger TA, Jobstmann B, Wolf V. Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. 2011;22(4):823-841. doi:10.1142/S0129054111008441
[Submitted Version] View | Files available | DOI | WoS
 

2011 | Published | Journal Article | IST-REx-ID: 3315 | OA
Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 2011;7(4). doi:10.2168/LMCS-7(4:8)2011
[Published Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3302 | OA
Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. Static scheduling in clouds. In: 3rd USENIX Workshop on Hot Topics in Cloud Computing. Usenix Association; 2011:1-6.
[Submitted Version] View | Files available
 

earlier version | 2011 | Published | Conference Paper | IST-REx-ID: 3356 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. In: IEEE; 2011. doi:10.1109/LICS.2011.33
[Submitted Version] View | Files available | DOI | WoS
 

earlier version | 2011 | Published | Technical Report | IST-REx-ID: 5385 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal Specifications with Accumulative Values. IST Austria; 2011. doi:10.15479/AT:IST-2011-0003
[Published Version] View | Files available | DOI
 

2011 | Published | Journal Article | IST-REx-ID: 3353 | OA
Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems. 2011;33(4). doi:10.1145/1985342.1985345
[Submitted Version] View | Files available | DOI | WoS
 

earlier version | 2011 | Published | Journal Article | IST-REx-ID: 3354
Chatterjee K, De Alfaro L, Henzinger TA. Qualitative concurrent parity games. ACM Transactions on Computational Logic. 2011;12(4). doi:10.1145/1970398.1970404
View | Files available | DOI | WoS
 

2010 | Published | Conference Paper | IST-REx-ID: 10908 | OA
Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation for loops. In: Clarke EM, Voronkov A, eds. Logic for Programming, Artificial Intelligence, and Reasoning. Vol 6355. LNCS. Berlin, Heidelberg: Springer Nature; 2010:103-118. doi:10.1007/978-3-642-17511-4_7
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

Filters and Search Terms

department=ToHe

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed