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.
292 Publications
2012 | Journal Article | IST-REx-ID: 2848 | 
Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 301, 161–173.
View
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2012 | Conference Paper | IST-REx-ID: 2891 |
Boker U, Henzinger TA. 2012. Approximate determinization of quantitative automata. Leibniz International Proceedings in Informatics. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18. 362–373.
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 2916 |
Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games, Automata, Logic, and Formal Verification vol. 96. 29–42.
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 2936 |
Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. roceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software 43–52.
View
| DOI
| Download Preprint (ext.)
2012 | Journal Article | IST-REx-ID: 2967
Alur R, Cerny P, Weinstein S. 2012. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). 13(3), 27.
View
| Files available
| DOI
2012 | Journal Article | IST-REx-ID: 3128 |
Chatterjee K, Doyen L, Henzinger TA. 2012. A survey of partial-observation stochastic parity games. Formal Methods in System Design. 43(2), 268–284.
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 3155 |
Delahaye B, Fahrenberg U, Henzinger TA, Legay A, Nickovic D. 2012. Synchronous interface theories and time triggered scheduling. FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed Systems , LNCS, vol. 7273. 203–218.
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 1384 |
Beyer D, Henzinger TA, Keremoglu M, Wendler P. 2012. Conditional model checking: A technique to pass information between verifiers. Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering. FSE: Foundations of Software Engineering
View
| DOI
| Download Preprint (ext.)
2012 | Conference Paper | IST-REx-ID: 3162 |
Asarin E, Donzé A, Maler O, Nickovic D. 2012. Parametric identification of temporal properties. RV: Runtime Verification, LNCS, vol. 7186. 147–160.
View
| Files available
| DOI
2012 | Journal Article | IST-REx-ID: 3168
Feret J, Henzinger TA, Koeppl H, Petrov T. 2012. Lumpability abstractions of rule based systems. Theoretical Computer Science. 431, 137–164.
View
| Files available
| DOI
2012 | Journal Article | IST-REx-ID: 3249
Cerny P, Henzinger TA, Radhakrishna A. 2012. Simulation distances. Theoretical Computer Science. 413(1), 21–35.
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 3251 |
Zufferey D, Wies T, Henzinger TA. 2012. Ideal abstractions for well structured transition systems. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148. 445–460.
View
| Files available
| DOI
2012 | Journal Article | IST-REx-ID: 3846 |
Chatterjee K, Henzinger TA. 2012. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 78(2), 394–413.
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.
View
| DOI
| Download Published Version (ext.)
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.
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.
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3299 |
Henzinger TA, Mateescu M. 2011. Propagation models for computing biochemical reaction networks. CMSB: Computational Methods in Systems Biology 1–3.
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3301 |
Henzinger TA, Mateescu M. 2011. Tail approximation for the chemical master equation. WCSB: Workshop on Computational Systems Biology (TICSP)
View
| Files available
2011 | Conference Paper | IST-REx-ID: 3302 |
Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. 2011. Static scheduling in clouds. HotCloud: Workshop on Hot Topics in Cloud Computing 1–6.
View
| Files available
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).
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3316 |
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2011. Specification-centered robustness. 6th IEEE International Symposium on Industrial and Embedded Systems. SIES: International Symposium on Industrial Embedded Systems 176–185.
View
| DOI
| Download Published Version (ext.)
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
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.
View
| DOI
| Download Submitted Version (ext.)
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.
View
| Files available
| DOI
2011 | 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 (TOPLAS). 33(4).
View
| Files available
| DOI
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 |
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 |
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science
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.
View
| DOI
| Download Published 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.
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.
View
| Files available
| DOI
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.
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.
View
| Download Preprint (ext.)
| arXiv
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.
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.
View
| Files available
| DOI
2011 | 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.
View
| Files available
| DOI
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.
View
| Files available
| DOI
2010 | 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.
View
| Files available
| DOI