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.




311 Publications

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: 3253
Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Abstract domains for automated reasoning about list manipulating programs with infinite data. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 1–22.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 3251 | OA
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
 
2011 | Journal Article | IST-REx-ID: 531 | OA
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 | OA
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 | OA
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: 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 | 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.
View | Files available | DOI
 
2011 | 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).
View | Files available
 
2011 | 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.
View | Files available
 
2011 | 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).
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3316 | OA
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 | OA
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: 3325
Alur R, Cerny P. 2011. Streaming transducers for algorithmic verification of single pass list processing programs. POPL: Principles of Programming Languages vol. 46, 599–610.
View | DOI
 
2011 | 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.
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3352
Fisher J, Harel D, Henzinger TA. 2011. Biology as reactivity. Communications of the ACM. 54(10), 72–82.
View | DOI
 
2011 | Journal Article | IST-REx-ID: 3353 | OA
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), 14.
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 | OA
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 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.
View | Files available | DOI
 
2011 | 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 | 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.
View | DOI | Download Published Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3359
Cerny P, Henzinger TA. 2011. From boolean to quantitative synthesis. EMSOFT: Embedded Software , 149–154.
View | DOI
 
2011 | 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.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3361 | OA
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 | 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.
View | Files available | DOI
 
2011 | Preprint | IST-REx-ID: 3363 | OA
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 | OA
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 | 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.
View | Files available | DOI
 
2011 | 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.
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3381 | OA
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: 488 | OA
Alur R, Cerny P. 2010. Expressiveness of streaming string transducers. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 1–12.
View | Files available | DOI
 
2010 | Journal Article | IST-REx-ID: 533
Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. 2010. Doomed program points. Formal Methods in System Design. 37(2–3), 171–199.
View | DOI
 
2010 | Technical Report | IST-REx-ID: 5388 | OA
Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.
View | Files available | DOI
 
2010 | Technical Report | IST-REx-ID: 5389 | OA
Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances, IST Austria, 24p.
View | Files available | DOI
 
2010 | Technical Report | IST-REx-ID: 5391 | OA
Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. 2010. Model checking of linearizability of concurrent list implementations, IST Austria, 27p.
View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3719 | OA
Feret J, Henzinger TA, Koeppl H, Petrov T. 2010. Lumpability abstractions of rule-based systems. MECBIC: Membrane Computing and Biologically Inspired Process Calculi, EPTCS, vol. 40, 142–161.
View | Files available | arXiv
 
2010 | Journal Article | IST-REx-ID: 3834 | OA
Wolf V, Goel R, Mateescu M, Henzinger TA. 2010. Solving the chemical master equation using sliding windows. BMC Systems Biology. 4(42), 1–19.
View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3838 | OA
Henzinger TA, Mateescu M, Mikeev L, Wolf V. 2010. Hybrid numerical solution of the chemical master equation. CMSB: Computational Methods in Systems Biology, 55–65.
View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3839 | OA
Henzinger TA, Hottelier T, Kovács L, Voronkov A. 2010. Invariant and type inference for matrices. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 5944, 163–179.
View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3840
Henzinger TA. 2010. From boolean to quantitative notions of correctness. POPL: Principles of Programming Languages vol. 45, 157–158.
View | DOI
 
2010 | Journal Article | IST-REx-ID: 3842 | OA
Didier F, Henzinger TA, Mateescu M, Wolf V. 2010. Fast adaptive uniformization of the chemical master equation. IET Systems Biology. 4(6), 441–452.
View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3845 | OA
Henzinger TA, Hottelier T, Kovács L, Rybalchenko A. 2010. Aligators for arrays. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397, 348–356.
View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3847 | OA
Didier F, Henzinger TA, Mateescu M, Wolf V. 2010. SABRE: A tool for the stochastic analysis of biochemical reaction networks. QEST: Quantitative Evaluation of Systems, 193–194.
View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3853 | OA
Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.
View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3855 | OA
Chatterjee K, Doyen L, Henzinger TA. 2010. Qualitative analysis of partially-observable Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 258–269.
View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3856 | OA
Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.
View | Files available | DOI | Download Preprint (ext.)
 
2010 | Conference Paper | IST-REx-ID: 3857
Chatterjee K, Henzinger TA. 2010. Probabilistic Automata on infinite words: decidability and undecidability results. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6252, 1–16.
View | Files available | DOI
 
2010 | Conference (Editor) | IST-REx-ID: 3859
Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed systems, Springer,p.
View | Files available | DOI
 

Search

Filter Publications