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.
447 Publications
2012 |
Published |
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.
[Published Version]
View
| Files available
| DOI
2012 |
Published |
Conference Paper |
IST-REx-ID: 10906 |
Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C): A software verifier based on Horn clauses. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2012 |
Published |
Conference Paper |
IST-REx-ID: 2936 |
Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. Proceedings of the 10th ACM international conference on Embedded software. EMSOFT: Embedded Software , 43–52.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 |
Published |
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.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
earlier version | 2011 |
Published |
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.
[Published Version]
View
| Files available
| DOI
2011 |
Published |
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.
[Submitted Version]
View
| Files available
| DOI
2011 |
Published |
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).
[Submitted Version]
View
| Files available
2011 |
Published |
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.
[Published Version]
View
| DOI
| Download Published Version (ext.)
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 |
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: 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.
[Submitted Version]
View
| Files available
| DOI
2011 |
Published |
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.
[Submitted Version]
View
| Files available
| DOI
2011 |
Published |
Conference Paper |
IST-REx-ID: 3358 |
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: 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