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.




426 Publications

2012 | Published | Journal Article | IST-REx-ID: 2848 | OA
Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 301, 161–173.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | PubMed | Europe PMC
 
2012 | Published | Journal Article | IST-REx-ID: 494
Boker U, Kupferman O. 2012. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). 13(4), 29.
View | DOI | WoS
 
2011 | Published | Technical Report | IST-REx-ID: 5383 | OA
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 | Published | Conference Paper | IST-REx-ID: 3299 | OA
Henzinger TA, Mateescu M. 2011. Propagation models for computing biochemical reaction networks. CMSB: Computational Methods in Systems Biology, 1–3.
[Submitted Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3301 | OA
Henzinger TA, Mateescu M. 2011. Tail approximation for the chemical master equation. WCSB: Workshop on Computational Systems Biology (TICSP).
[Submitted Version] View | Files available
 
2011 | Published | Conference Paper | IST-REx-ID: 3302 | OA
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.
[Submitted Version] View | Files available
 
2011 | Published | 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 | Published | Conference Paper | IST-REx-ID: 3324 | OA
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 | Published | Conference Paper | IST-REx-ID: 3355 | OA
Halalai R, Henzinger TA, Singh V. 2011. Quantitative evaluation of BFT protocols. QEST: Quantitative Evaluation of Systems, 255–264.
[Submitted Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.
View | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3358 | OA
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 | Published | Conference Paper | IST-REx-ID: 3365 | OA
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: 3326 | OA
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 | Published | Journal Article | IST-REx-ID: 3315 | OA
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: 3362 | OA
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 | Published | Conference Paper | IST-REx-ID: 3359
Cerny P, Henzinger TA. 2011. From boolean to quantitative synthesis. EMSOFT: Embedded Software , 149–154.
View | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3360 | OA
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: 3264
Gupta A, Popeea C, Rybalchenko A. 2011. Solving recursion-free Horn clauses over LI+UIF. APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 7078, 188–203.
View | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3366 | OA
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 | Submitted | Preprint | IST-REx-ID: 3363 | OA
Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words. 1104.0127.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed