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.




386 Publications

2014 | Conference Paper | IST-REx-ID: 2063
Chatterjee, K., Chmelik, M., & Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-08867-9_31
View | Files available | DOI
 
2014 | Technical Report | IST-REx-ID: 5428 | OA
Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2014). Quantitative fair simulation games. IST Austria. https://doi.org/10.15479/AT:IST-2014-315-v1-1
[Published Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 10898
Haas, A., Lippautz, M., Henzinger, T. A., Payer, H., Sokolova, A., Kirsch, C. M., & Sezgin, A. (2013). Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. Ischia, Italy: ACM Press. https://doi.org/10.1145/2482767.2482789
View | DOI
 
2013 | Conference Paper | IST-REx-ID: 1385 | OA
Hofferek, G., Gupta, A., Könighofer, B., Jiang, J., & Bloem, R. (2013). Synthesizing multiple boolean functions using interpolation on a single proof. In 2013 Formal Methods in Computer-Aided Design (pp. 77–84). Portland, OR, United States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679394
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2013 | Conference Paper | IST-REx-ID: 1387 | OA
Boker, U., Kuperberg, D., Kupferman, O., & Skrzypczak, M. (2013). Nondeterminism in the presence of a diverse or unknown future. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_11
[Submitted Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2181 | OA
Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., & Sokolova, A. (2013). Quantitative relaxation of concurrent data structures. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language (pp. 317–328). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429109
[Submitted Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2182
Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2013). Quantitative abstraction refinement. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language (pp. 115–128). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429085
View | DOI
 
2013 | Conference Paper | IST-REx-ID: 2237 | OA
Blanc, R., Gupta, A., Kovács, L., & Kragl, B. (2013). Tree interpolation in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_13
[Submitted Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2243 | OA
Michaliszyn, J., & Otop, J. (2013). Elementary modal logics over transitive structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.563
[Published Version] View | Files available | DOI
 
2013 | Journal Article | IST-REx-ID: 2289 | OA
Henzinger, T. A. (2013). Quantitative reactive modeling and verification. Computer Science Research and Development. Springer. https://doi.org/10.1007/s00450-013-0251-7
[Published Version] View | Files available | DOI
 
2013 | Conference (Editor) | IST-REx-ID: 2288
Gupta, A., & Henzinger, T. A. (Eds.). (2013). Computational Methods in Systems Biology (Vol. 8130). Presented at the CMSB: Computational Methods in Systems Biology, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40708-6
View | DOI
 
2013 | Conference Paper | IST-REx-ID: 2298 | OA
Dragoi, C., Enea, C., & Sighireanu, M. (2013). Local shape analysis for overlaid data structures (Vol. 7935, pp. 150–171). Presented at the SAS: Static Analysis Symposium, Seattle, WA, United States: Springer. https://doi.org/10.1007/978-3-642-38856-9_10
[Submitted Version] View | Files available | DOI
 
2013 | Journal Article | IST-REx-ID: 2299 | OA
Godhal, Y., Chatterjee, K., & Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. Springer. https://doi.org/10.1007/s10009-011-0207-9
[Submitted Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2301
Desai, A., Gupta, V., Jackson, E., Qadeer, S., Rajamani, S., & Zufferey, D. (2013). P: Safe asynchronous event-driven programming. In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 321–331). Seattle, WA, United States: ACM. https://doi.org/10.1145/2491956.2462184
View | DOI | Download None (ext.)
 
2013 | Conference Paper | IST-REx-ID: 2328 | OA
Henzinger, T. A., Sezgin, A., & Vafeiadis, V. (2013). Aspect-oriented linearizability proofs. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-40184-8_18
[Submitted Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2447 | OA
Piskac, R., Wies, T., & Zufferey, D. (2013). Automating separation logic using SMT. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_54
[Submitted Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2517 | OA
Almagor, S., Boker, U., & Kupferman, O. (2013). Formalizing and reasoning about quality. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_3
[Submitted Version] View | Files available | DOI
 
2013 | Journal Article | IST-REx-ID: 2854 | OA
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2013). Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2012.12.001
[Published Version] View | Files available | DOI
 
2013 | Conference (Editor) | IST-REx-ID: 2885
Kucera, A., Henzinger, T. A., Nesetril, J., Vojnar, T., & Antos, D. (Eds.). (2013). Mathematical and Engineering Methods in Computer Science (Vol. 7721, pp. 1–228). Presented at the MEMICS: Mathematical and Engineering methods in computer science, Znojmo, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-36046-6
View | DOI
 
2013 | Technical Report | IST-REx-ID: 5402 | OA
Henzinger, T. A., & Sezgin, A. (2013). How free is your linearizable concurrent data structure? IST Austria. https://doi.org/10.15479/AT:IST-2013-123-v1-1
[Published Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 1376
Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013). Distributed synthesis for LTL fragments. In 13th International Conference on Formal Methods in Computer-Aided Design (pp. 18–25). Portland, OR, United States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679386
View | Files available | DOI
 
2013 | Technical Report | IST-REx-ID: 5406 | OA
Chatterjee, K., Henzinger, T. A., Otop, J., & Pavlogiannis, A. (2013). Distributed synthesis for LTL Fragments. IST Austria. https://doi.org/10.15479/AT:IST-2013-130-v1-1
[Published Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2327 | OA
Henzinger, T. A., & Otop, J. (2013). From model checking to model measuring. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Springer. https://doi.org/10.1007/978-3-642-40184-8_20
[Submitted Version] View | Files available | DOI
 
2013 | Technical Report | IST-REx-ID: 6440 | OA
Henzinger, T. A., Payer, H., & Sezgin, A. (2013). Replacing competition with cooperation to achieve scalable lock-free FIFO queues . IST Austria. https://doi.org/10.15479/AT:IST-2013-124-v1-1
[Published Version] View | Files available | DOI
 
2013 | Book Chapter | IST-REx-ID: 5747 | OA
Dragoi, C., Gupta, A., & Henzinger, T. A. (2013). Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In Computer Aided Verification (Vol. 8044, pp. 174–190). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-39799-8_11
View | Files available | DOI
 
2013 | Thesis | IST-REx-ID: 1405 | OA
Zufferey, D. (2013). Analysis of dynamic message passing programs. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:1405
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
2013 | Conference Paper | IST-REx-ID: 2847 | OA
Bansal, K., Koskinen, E., Wies, T., & Zufferey, D. (2013). Structural Counter Abstraction. (N. Piterman & S. Smolka, Eds.). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Rome, Italy: Springer. https://doi.org/10.1007/978-3-642-36742-7_5
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
2013 | Conference Paper | IST-REx-ID: 2445 | OA
Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., & Tarrach, T. (2013). Efficient synthesis for concurrency by semantics-preserving transformations (Vol. 8044, pp. 951–967). Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_68
[Submitted Version] View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 1384 | OA
Beyer, D., Henzinger, T. A., Keremoglu, M., & Wendler, P. (2012). Conditional model checking: A technique to pass information between verifiers. In Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering. Cary, NC, USA: ACM. https://doi.org/10.1145/2393596.2393664
[Preprint] View | DOI | Download Preprint (ext.)
 
2012 | Journal Article | IST-REx-ID: 2302
Henzinger, T. A., & Mateescu, M. (2012). The propagation approach for computing biochemical reaction networks. IEEE ACM Transactions on Computational Biology and Bioinformatics. IEEE. https://doi.org/10.1109/TCBB.2012.91
View | DOI | PubMed | Europe PMC
 
2012 | 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. Elsevier. https://doi.org/10.1016/j.jtbi.2012.02.021
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
2012 | Conference Paper | IST-REx-ID: 2891 | OA
Boker, U., & Henzinger, T. A. (2012). Approximate determinization of quantitative automata. In Leibniz International Proceedings in Informatics (Vol. 18, pp. 362–373). Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362
[Published Version] View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 2890
Cerny, P., Gopi, S., Henzinger, T. A., Radhakrishna, A., & Totla, N. (2012). Synthesis from incompatible specifications. In Proceedings of the tenth ACM international conference on Embedded software (pp. 53–62). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380371
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 2888
Henzinger, T. A. (2012). Quantitative reactive models. In Conference proceedings MODELS 2012 (Vol. 7590, pp. 1–2). Innsbruck, Austria: Springer. https://doi.org/10.1007/978-3-642-33666-9_1
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 2916 | OA
Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2012). Interface Simulation Distances. In Electronic Proceedings in Theoretical Computer Science (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. https://doi.org/10.4204/EPTCS.96.3
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
2012 | Conference Paper | IST-REx-ID: 2936 | OA
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2012). Finite automata with time delay blocks. In roceedings of the tenth ACM international conference on Embedded software (pp. 43–52). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380370
[Preprint] View | DOI | Download Preprint (ext.)
 
2012 | Conference Paper | IST-REx-ID: 2942
Henzinger, T. A., & Nickovic, D. (2012). Independent implementability of viewpoints. In Conference proceedings Monterey Workshop 2012 (Vol. 7539, pp. 380–395). Oxford, UK: Springer. https://doi.org/10.1007/978-3-642-34059-8_20
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 3136
Guet, C. C., Gupta, A., Henzinger, T. A., Mateescu, M., & Sezgin, A. (2012). Delayed continuous time Markov chains for genetic regulatory circuits (Vol. 7358, pp. 294–309). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer. https://doi.org/10.1007/978-3-642-31424-7_24
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 3162 | OA
Asarin, E., Donzé, A., Maler, O., & Nickovic, D. (2012). Parametric identification of temporal properties (Vol. 7186, pp. 147–160). Presented at the RV: Runtime Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-642-29860-8_12
[Submitted Version] 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 (Vol. 7148, pp. 1–22). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_1
View | DOI
 
2012 | Journal Article | IST-REx-ID: 3168
Feret, J., Henzinger, T. A., Koeppl, H., & Petrov, T. (2012). Lumpability abstractions of rule based systems. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2011.12.059
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3846 | OA
Chatterjee, K., & Henzinger, T. A. (2012). A survey of stochastic ω regular games. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2011.05.002
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
2012 | Journal Article | IST-REx-ID: 3128 | OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2012). A survey of partial-observation stochastic parity games. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-012-0164-2
[Submitted Version] View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3155 | OA
Delahaye, B., Fahrenberg, U., Henzinger, T. A., Legay, A., & Nickovic, D. (2012). Synchronous interface theories and time triggered scheduling (Vol. 7273, pp. 203–218). Presented at the FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed Systems , Stockholm, Sweden: Springer. https://doi.org/10.1007/978-3-642-30793-5_13
[Submitted Version] View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3836
Ghosal, A., Iercan, D., Kirsch, C., Henzinger, T. A., & Sangiovanni Vincentelli, A. (2012). Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. Science of Computer Programming. Elsevier. https://doi.org/10.1016/j.scico.2010.06.004
View | DOI
 
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). ACM. https://doi.org/10.1145/2287718.2287727
View | Files available | DOI
 
2012 | 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). ACM. https://doi.org/10.1145/2362355.2362357
View | DOI
 
2012 | Journal Article | IST-REx-ID: 3249
Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2012). Simulation distances. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2011.08.002
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 10903
Bouajjani, A., Dragoi, C., Enea, C., & Sighireanu, M. (2012). Accurate invariant checking for programs manipulating lists and arrays with infinite data. In Automated Technology for Verification and Analysis (Vol. 7561, pp. 167–182). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-33386-6_14
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 10906 | OA
Grebenshchikov, S., Gupta, A., Lopes, N. P., Popeea, C., & Rybalchenko, A. (2012). HSF(C): A software verifier based on Horn clauses. In C. Flanagan & B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems (Vol. 7214, pp. 549–551). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-28756-5_46
[Published Version] View | DOI | Download Published Version (ext.)
 
2012 | Book Chapter | IST-REx-ID: 5745 | OA
Gupta, A. (2012). Improved Single Pass Algorithms for Resolution Proof Reduction. In Automated Technology for Verification and Analysis (Vol. 7561, pp. 107–121). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-33386-6_10
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3251 | OA
Zufferey, D., Wies, T., & Henzinger, T. A. (2012). Ideal abstractions for well structured transition systems (Vol. 7148, pp. 445–460). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_29
[Submitted Version] 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. In H. Yang (Ed.) (Vol. 7078, pp. 188–203). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan: Springer. https://doi.org/10.1007/978-3-642-25318-8_16
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3302 | OA
Henzinger, T. A., Singh, A., Singh, V., Wies, T., & Zufferey, D. (2011). Static scheduling in clouds (pp. 1–6). Presented at the HotCloud: Workshop on Hot Topics in Cloud Computing, USENIX.
[Submitted Version] View | Files available
 
2011 | Conference Paper | IST-REx-ID: 3301 | OA
Henzinger, T. A., & Mateescu, M. (2011). Tail approximation for the chemical master equation. Presented at the WCSB: Workshop on Computational Systems Biology (TICSP), Tampere International Center for Signal Processing.
[Submitted Version] View | Files available
 
2011 | Conference Paper | IST-REx-ID: 3299 | OA
Henzinger, T. A., & Mateescu, M. (2011). Propagation models for computing biochemical reaction networks (pp. 1–3). Presented at the CMSB: Computational Methods in Systems Biology, Paris, France: Springer. https://doi.org/10.1145/2037509.2037510
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3316 | OA
Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2011). Specification-centered robustness. In 6th IEEE International Symposium on Industrial and Embedded Systems (pp. 176–185). Vasteras, Sweden: IEEE. https://doi.org/10.1109/SIES.2011.5953660
[Published Version] View | DOI | Download Published Version (ext.)
 
2011 | Journal Article | IST-REx-ID: 3353 | OA
Tripakis, S., Lickly, B., Henzinger, T. A., & Lee, E. (2011). A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). ACM. https://doi.org/10.1145/1985342.1985345
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3355 | OA
Halalai, R., Henzinger, T. A., & Singh, V. (2011). Quantitative evaluation of BFT protocols (pp. 255–264). Presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany: IEEE. https://doi.org/10.1109/QEST.2011.40
[Submitted Version] View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3354
Chatterjee, K., De Alfaro, L., & Henzinger, T. A. (2011). Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/1970398.1970404
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3352
Fisher, J., Harel, D., & Henzinger, T. A. (2011). Biology as reactivity. Communications of the ACM. ACM. https://doi.org/10.1145/2001269.2001289
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3362 | OA
Fisher, J., Henzinger, T. A., Nickovic, D., Piterman, N., Singh, A., & Vardi, M. (2011). Dynamic reactive modules (Vol. 6901, pp. 404–418). Presented at the CONCUR: Concurrency Theory, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-23217-6_27
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3365 | OA
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. https://doi.org/10.1007/978-3-642-19835-9_24
[Submitted Version] View | Files available | DOI
 
2011 | Preprint | IST-REx-ID: 3363 | OA
Chatterjee, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.
[Preprint] View | Download Preprint (ext.) | arXiv
 
2011 | Journal Article | IST-REx-ID: 3381 | OA
Henzinger, T. A., Jobstmann, B., & Wolf, V. (2011). Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S0129054111008441
[Submitted Version] View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3315 | OA
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2011). Timed parity games: Complexity and robustness. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-7(4:8)2011
[Published Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3326 | OA
Almagor, S., Boker, U., & Kupferman, O. (2011). What’s decidable about weighted automata (Vol. 6996, pp. 482–491). Presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan: Springer. https://doi.org/10.1007/978-3-642-24372-1_37
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3325
Alur, R., & Cerny, P. (2011). Streaming transducers for algorithmic verification of single pass list processing programs (Vol. 46, pp. 599–610). Presented at the POPL: Principles of Programming Languages, Texas, USA: ACM. https://doi.org/10.1145/1926385.1926454
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3324 | OA
Piskac, R., & Wies, T. (2011). Decision procedures for automating termination proofs. In R. Jhala & D. Schmidt (Eds.) (Vol. 6538, pp. 371–386). Presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA: Springer. https://doi.org/10.1007/978-3-642-18275-4_26
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3360 | OA
Boker, U., & Henzinger, T. A. (2011). Determinizing discounted-sum automata (Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway: Springer. https://doi.org/10.4230/LIPIcs.CSL.2011.82
[Published Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3361 | OA
Cerny, P., Chatterjee, K., & Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE. https://doi.org/10.1109/CSF.2011.21
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3358 | OA
Henzinger, T. A., Singh, V., Wies, T., & Zufferey, D. (2011). Scheduling large jobs by abstraction refinement (pp. 329–342). Presented at the EuroSys, Salzburg, Austria: ACM. https://doi.org/10.1145/1966445.1966476
[Published Version] View | DOI | Download Published Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3359
Cerny, P., & Henzinger, T. A. (2011). From boolean to quantitative synthesis (pp. 149–154). Presented at the EMSOFT: Embedded Software , Taipei; Taiwan: ACM. https://doi.org/10.1145/2038642.2038666
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee, K., Henzinger, T. A., & Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, & C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_17
View | DOI
 
2011 | Journal Article | IST-REx-ID: 3364 | OA
Didier, F., Henzinger, T. A., Mateescu, M., & Wolf, V. (2011). Approximation of event probabilities in noisy cellular processes. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2010.10.022
[Submitted Version] View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 531 | OA
Guerraoui, R., Henzinger, T. A., & Singh, V. (2011). Verification of STM on relaxed memory models. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-011-0131-3
[Published Version] View | DOI | Download Published Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3356 | OA
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33
[Submitted Version] View | Files available | DOI
 
2011 | Technical Report | IST-REx-ID: 5385 | OA
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria. https://doi.org/10.15479/AT:IST-2011-0003
[Published Version] View | Files available | DOI
 
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. https://doi.org/10.15479/AT:IST-2011-0005
[Published Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3323
Wies, T., Muñiz, M., & Kuncak, V. (2011). An efficient decision procedure for imperative tree data structures (Vol. 6803, pp. 476–491). Presented at the CADE 23: Automated Deduction , Wrocław, Poland: Springer. https://doi.org/10.1007/978-3-642-22438-6_36
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3366 | OA
Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_20
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 10908 | OA
Blanc, R., Henzinger, T. A., Hottelier, T., & Kovács, L. (2010). ABC: Algebraic Bound Computation for loops. In E. M. Clarke & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (Vol. 6355, pp. 103–118). Berlin, Heidelberg: Springer Nature. https://doi.org/10.1007/978-3-642-17511-4_7
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2010 | Conference Paper | IST-REx-ID: 3719 | OA
Feret, J., Henzinger, T. A., Koeppl, H., & Petrov, T. (2010). Lumpability abstractions of rule-based systems (Vol. 40, pp. 142–161). Presented at the MECBIC: Membrane Computing and Biologically Inspired Process Calculi, Jena, Germany: Open Publishing Association.
[Submitted Version] View | Files available | arXiv
 
2010 | Conference Paper | IST-REx-ID: 3847 | OA
Didier, F., Henzinger, T. A., Mateescu, M., & Wolf, V. (2010). SABRE: A tool for the stochastic analysis of biochemical reaction networks (pp. 193–194). Presented at the QEST: Quantitative Evaluation of Systems, Williamsburg, USA: IEEE. https://doi.org/10.1109/QEST.2010.33
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3845 | OA
Henzinger, T. A., Hottelier, T., Kovács, L., & Rybalchenko, A. (2010). Aligators for arrays (Vol. 6397, pp. 348–356). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. https://doi.org/10.1007/978-3-642-16242-8_25
[Submitted Version] View | Files available | DOI
 
2010 | Journal Article | IST-REx-ID: 3842 | OA
Didier, F., Henzinger, T. A., Mateescu, M., & Wolf, V. (2010). Fast adaptive uniformization of the chemical master equation. IET Systems Biology. Institution of Engineering and Technology. https://doi.org/10.1049/iet-syb.2010.0005
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3856 | OA
Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_23
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2010 | Conference (Editor) | IST-REx-ID: 3859
Chatterjee, K., & Henzinger, T. A. (Eds.). (2010). Formal modeling and analysis of timed systems (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-15297-9
View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3866 | OA
Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, & P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_36
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 4369 | OA
Nickovic, D., & Piterman, N. (2010). From MTL to deterministic timed automata. In T. A. Henzinger & K. Chatterjee (Eds.) (Vol. 6246, pp. 152–167). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-15297-9_13
[Submitted Version] View | Files available | DOI
 
2010 | Journal Article | IST-REx-ID: 3834 | OA
Wolf, V., Goel, R., Mateescu, M., & Henzinger, T. A. (2010). Solving the chemical master equation using sliding windows. BMC Systems Biology. BioMed Central. https://doi.org/10.1186/1752-0509-4-42
[Published Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3840
Henzinger, T. A. (2010). From boolean to quantitative notions of correctness (Vol. 45, pp. 157–158). Presented at the POPL: Principles of Programming Languages, Madrid, Spain: ACM. https://doi.org/10.1145/1706299.1706319
View | DOI
 
2010 | Conference Paper | IST-REx-ID: 3839 | OA
Henzinger, T. A., Hottelier, T., Kovács, L., & Voronkov, A. (2010). Invariant and type inference for matrices (Vol. 5944, pp. 163–179). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain: Springer. https://doi.org/10.1007/978-3-642-11319-2_14
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3838 | OA
Henzinger, T. A., Mateescu, M., Mikeev, L., & Wolf, V. (2010). Hybrid numerical solution of the chemical master equation (pp. 55–65). Presented at the CMSB: Computational Methods in Systems Biology, Trento, Italy: Springer. https://doi.org/10.1145/1839764.1839772
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3853 | OA
Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., & Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_19
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3860 | OA
Chatterjee, K., Doyen, L., Henzinger, T. A., & Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3864 | OA
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer. https://doi.org/10.1007/978-3-642-14295-6_34
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2010 | Journal Article | IST-REx-ID: 3863 | OA
Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., & Henzinger, T. A. (2010). Strategy construction for parity games with imperfect information. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2009.09.006
[Submitted Version] View | Files available | DOI
 
2010 | Journal Article | IST-REx-ID: 3861 | OA
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2010). Strategy logic. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2009.07.004
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 4362
Singh, V. (2010). Runtime verification for software transactional memories. In O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner, … G. Pace (Eds.) (Vol. 6418, pp. 421–435). Presented at the RV: International Conference on Runtime Verification, St. Julians, Malta: Springer. https://doi.org/10.1007/978-3-642-16612-9_32
View | DOI
 

Search

Filter Publications