Gupta A, Kovács L, Kragl B, Voronkov A. 2014. Extensional crisis and proving identity. ATVA 2014. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 8837, 185–200.
LibreCat: https://research-explorer.ista.ac.at/record/1872
DOI: 10.1007/978-3-319-11936-6_14

Henzinger TA, Otop J, Samanta R. 2014. Lipschitz robustness of finite-state transducers. Leibniz International Proceedings in Informatics, LIPIcs. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 29, 431–443.
LibreCat: https://research-explorer.ista.ac.at/record/1870
DOI: 10.4230/LIPIcs.FSTTCS.2014.431

Samanta R, Olivo O, Allen E. 2014. Cost-aware automatic program repair. SAS: Static Analysis Symposium, LNCS, vol. 8723, 268–284.
LibreCat: https://research-explorer.ista.ac.at/record/1875
DOI: 10.1007/978-3-319-10936-7_17

Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Parker D, Ujma M. 2014. Verification of markov decision processes using learning algorithms.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ALENEX: Algorithm Engineering and Experiments, LNCS, vol. 8837, 98–114.
LibreCat: https://research-explorer.ista.ac.at/record/2027
DOI: 10.1007/978-3-319-11936-6_8

Komárková Z, Kretinsky J. 2014. Rabinizer 3: Safraless translation of ltl to small deterministic automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 8837, 235–241.
LibreCat: https://research-explorer.ista.ac.at/record/2026
DOI: 10.1007/978-3-319-11936-6_17

Hermanns H, Krdál J, Kretinsky J. 2014. Probabilistic bisimulation: Naturally on distributions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 249–265.
LibreCat: https://research-explorer.ista.ac.at/record/2053
DOI: 10.1007/978-3-662-44584-6_18

Ganguly A, Petrov T, Koeppl H. 2014. Markov chain aggregation and its applications to combinatorial reaction networks. Journal of Mathematical Biology. 69(3), 767–797.
LibreCat: https://research-explorer.ista.ac.at/record/2056
DOI: 10.1007/s00285-013-0738-7

Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4), 193–220.
LibreCat: https://research-explorer.ista.ac.at/record/2187
DOI: 10.1007/s00236-013-0191-5

Esparza J, Kretinsky J. 2014. From LTL to deterministic automata: A safraless compositional approach. CAV: Computer Aided Verification, LNCS, vol. 8559, 192–208.
LibreCat: https://research-explorer.ista.ac.at/record/2190
DOI: 10.1007/978-3-319-08867-9_13

Boker U, Henzinger TA. 2014. Exact and approximate determinization of discounted-sum automata. Logical Methods in Computer Science. 10(1).
LibreCat: https://research-explorer.ista.ac.at/record/2233
DOI: 10.2168/LMCS-10(1:10)2014

Boker U, Henzinger TA, Radhakrishna A. 2014. Battery transition systems. POPL: Principles of Programming Languages vol. 49, 595–606.
LibreCat: https://research-explorer.ista.ac.at/record/2239
DOI: 10.1145/2535838.2535875

Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.
LibreCat: https://research-explorer.ista.ac.at/record/1733
DOI: 10.1016/j.tcs.2014.08.019

Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.
LibreCat: https://research-explorer.ista.ac.at/record/2038
DOI: 10.1145/2629686

Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications for IOCO testing, IST Austria, 20p.
LibreCat: https://research-explorer.ista.ac.at/record/5411
DOI: 10.15479/AT:IST-2014-148-v2-1

Henzinger TA, Otop J. 2014. Model measuring for hybrid systems. Proceedings of the 17th international conference on Hybrid systems: computation and control. HSCC: Hybrid Systems - Computation and Control, 213–222.
LibreCat: https://research-explorer.ista.ac.at/record/2217
DOI: 10.1145/2562059.2562130

Henzinger TA, Otop J. 2014. From model checking to model measuring, IST Austria, 14p.
LibreCat: https://research-explorer.ista.ac.at/record/5417
DOI: 10.15479/AT:IST-2014-172-v1-1

Henzinger TA, Otop J. 2014. Model measuring for hybrid systems, IST Austria, 22p.
LibreCat: https://research-explorer.ista.ac.at/record/5416
DOI: 10.15479/AT:IST-2014-171-v1-1

Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.
LibreCat: https://research-explorer.ista.ac.at/record/5415
DOI: 10.15479/AT:IST-2014-170-v1-1

Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2014. Regression-free synthesis for concurrency. CAV: Computer Aided Verification, LNCS, vol. 8559, 568–584.
LibreCat: https://research-explorer.ista.ac.at/record/2218
DOI: 10.1007/978-3-319-08867-9_38

Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications for IOCO testing. IEEE 7th International Conference on Software Testing, Verification and Validation. ICST: International Conference on Software Testing, Verification and Validation, 6823899.
LibreCat: https://research-explorer.ista.ac.at/record/2167
DOI: 10.1109/ICST.2014.50
arXiv: 1904.07083

Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559, 473–490.
LibreCat: https://research-explorer.ista.ac.at/record/2063
DOI: 10.1007/978-3-319-08867-9_31

Chatterjee K, Henzinger TA, Otop J, Velner Y. 2014. Quantitative fair simulation games, IST Austria, 26p.
LibreCat: https://research-explorer.ista.ac.at/record/5428
DOI: 10.15479/AT:IST-2014-315-v1-1

Haas A, Lippautz M, Henzinger TA, Payer H, Sokolova A, Kirsch CM, Sezgin A. 2013. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. CF: Conference on Computing Frontiers, 17.
LibreCat: https://research-explorer.ista.ac.at/record/10898
DOI: 10.1145/2482767.2482789

Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. 2013. Synthesizing multiple boolean functions using interpolation on a single proof. 2013 Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 77–84.
LibreCat: https://research-explorer.ista.ac.at/record/1385
DOI: 10.1109/FMCAD.2013.6679394
arXiv: 1308.4767

Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the presence of a diverse or unknown future. 7966(PART 2), 89–100.
LibreCat: https://research-explorer.ista.ac.at/record/1387
DOI: 10.1007/978-3-642-39212-2_11

Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 317–328.
LibreCat: https://research-explorer.ista.ac.at/record/2181
DOI: 10.1145/2429069.2429109

Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 115–128.
LibreCat: https://research-explorer.ista.ac.at/record/2182
DOI: 10.1145/2429069.2429085

Blanc R, Gupta A, Kovács L, Kragl B. 2013. Tree interpolation in Vampire. 8312, 173–181.
LibreCat: https://research-explorer.ista.ac.at/record/2237
DOI: 10.1007/978-3-642-45221-5_13

Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577.
LibreCat: https://research-explorer.ista.ac.at/record/2243
DOI: 10.4230/LIPIcs.CSL.2013.563

Henzinger TA. 2013. Quantitative reactive modeling and verification. Computer Science Research and Development. 28(4), 331–344.
LibreCat: https://research-explorer.ista.ac.at/record/2289
DOI: 10.1007/s00450-013-0251-7

Gupta A, Henzinger TA eds. 2013. Computational Methods in Systems Biology, Springer,p.
LibreCat: https://research-explorer.ista.ac.at/record/2288
DOI: 10.1007/978-3-642-40708-6

Dragoi C, Enea C, Sighireanu M. 2013. Local shape analysis for overlaid data structures. SAS: Static Analysis Symposium, LNCS, vol. 7935, 150–171.
LibreCat: https://research-explorer.ista.ac.at/record/2298
DOI: 10.1007/978-3-642-38856-9_10

Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 15(5–6), 585–601.
LibreCat: https://research-explorer.ista.ac.at/record/2299
DOI: 10.1007/s10009-011-0207-9

Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. 2013. P: Safe asynchronous event-driven programming. Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Languages Design and Implementation, 321–331.
LibreCat: https://research-explorer.ista.ac.at/record/2301
DOI: 10.1145/2491956.2462184

Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability proofs. 8052, 242–256.
LibreCat: https://research-explorer.ista.ac.at/record/2328
DOI: 10.1007/978-3-642-40184-8_18

Piskac R, Wies T, Zufferey D. 2013. Automating separation logic using SMT. 8044, 773–789.
LibreCat: https://research-explorer.ista.ac.at/record/2447
DOI: 10.1007/978-3-642-39799-8_54

Almagor S, Boker U, Kupferman O. 2013. Formalizing and reasoning about quality. 7966(Part 2), 15–27.
LibreCat: https://research-explorer.ista.ac.at/record/2517
DOI: 10.1007/978-3-642-39212-2_3

Chatterjee K, De Alfaro L, Henzinger TA. 2013. Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. 79(5), 640–657.
LibreCat: https://research-explorer.ista.ac.at/record/2854
DOI: 10.1016/j.jcss.2012.12.001

Kucera A, Henzinger TA, Nesetril J, Vojnar T, Antos D eds. 2013. Mathematical and Engineering Methods in Computer Science, Springer,p.
LibreCat: https://research-explorer.ista.ac.at/record/2885
DOI: 10.1007/978-3-642-36046-6

Henzinger TA, Sezgin A. 2013. How free is your linearizable concurrent data structure?, IST Austria, 16p.
LibreCat: https://research-explorer.ista.ac.at/record/5402
DOI: 10.15479/AT:IST-2013-123-v1-1

Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 18–25.
LibreCat: https://research-explorer.ista.ac.at/record/1376
DOI: 10.1109/FMCAD.2013.6679386

Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL Fragments, IST Austria, 11p.
LibreCat: https://research-explorer.ista.ac.at/record/5406
DOI: 10.15479/AT:IST-2013-130-v1-1

Henzinger TA, Otop J. 2013. From model checking to model measuring. 8052, 273–287.
LibreCat: https://research-explorer.ista.ac.at/record/2327
DOI: 10.1007/978-3-642-40184-8_20

Henzinger TA, Payer H, Sezgin A. 2013. Replacing competition with cooperation to achieve scalable lock-free FIFO queues , IST Austria, 23p.
LibreCat: https://research-explorer.ista.ac.at/record/6440
DOI: 10.15479/AT:IST-2013-124-v1-1

Dragoi C, Gupta A, Henzinger TA. 2013.Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In: Computer Aided Verification. vol. 8044, 174–190.
LibreCat: https://research-explorer.ista.ac.at/record/5747
DOI: 10.1007/978-3-642-39799-8_11

Zufferey D. 2013. Analysis of dynamic message passing programs. Institute of Science and Technology Austria.
LibreCat: https://research-explorer.ista.ac.at/record/1405
DOI: 10.15479/at:ista:1405

Bansal K, Koskinen E, Wies T, Zufferey D. 2013. Structural Counter Abstraction (eds. N. Piterman &; S. Smolka). 7795, 62–77.
LibreCat: https://research-explorer.ista.ac.at/record/2847
DOI: 10.1007/978-3-642-36742-7_5

Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2013. Efficient synthesis for concurrency by semantics-preserving transformations. CAV: Computer Aided Verification, LNCS, vol. 8044, 951–967.
LibreCat: https://research-explorer.ista.ac.at/record/2445
DOI: 10.1007/978-3-642-39799-8_68

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, 57.
LibreCat: https://research-explorer.ista.ac.at/record/1384
DOI: 10.1145/2393596.2393664

Henzinger TA, Mateescu M. 2012. The propagation approach for computing biochemical reaction networks. IEEE ACM Transactions on Computational Biology and Bioinformatics. 10(2), 310–322.
LibreCat: https://research-explorer.ista.ac.at/record/2302
DOI: 10.1109/TCBB.2012.91
PMID: 22778152

Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 301, 161–173.
LibreCat: https://research-explorer.ista.ac.at/record/2848
DOI: 10.1016/j.jtbi.2012.02.021
PMID: 22394652

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.
LibreCat: https://research-explorer.ista.ac.at/record/2891
DOI: 10.4230/LIPIcs.FSTTCS.2012.362

Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. 2012. Synthesis from incompatible specifications. Proceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 53–62.
LibreCat: https://research-explorer.ista.ac.at/record/2890
DOI: 10.1145/2380356.2380371

Henzinger TA. 2012. Quantitative reactive models. Conference proceedings MODELS 2012. MODELS: Model-driven Engineering Languages and Systems, LNCS, vol. 7590, 1–2.
LibreCat: https://research-explorer.ista.ac.at/record/2888
DOI: 10.1007/978-3-642-33666-9_1

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.
LibreCat: https://research-explorer.ista.ac.at/record/2916
DOI: 10.4204/EPTCS.96.3
arXiv: 1210.2450

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.
LibreCat: https://research-explorer.ista.ac.at/record/2936
DOI: 10.1145/2380356.2380370

Henzinger TA, Nickovic D. 2012. Independent implementability of viewpoints.  Conference proceedings Monterey Workshop 2012. Monterey Workshop 2012, LNCS, vol. 7539, 380–395.
LibreCat: https://research-explorer.ista.ac.at/record/2942
DOI: 10.1007/978-3-642-34059-8_20

Guet CC, Gupta A, Henzinger TA, Mateescu M, Sezgin A. 2012. Delayed continuous time Markov chains for genetic regulatory circuits. CAV: Computer Aided Verification, LNCS, vol. 7358, 294–309.
LibreCat: https://research-explorer.ista.ac.at/record/3136
DOI: 10.1007/978-3-642-31424-7_24

Asarin E, Donzé A, Maler O, Nickovic D. 2012. Parametric identification of temporal properties. RV: Runtime Verification, LNCS, vol. 7186, 147–160.
LibreCat: https://research-explorer.ista.ac.at/record/3162
DOI: 10.1007/978-3-642-29860-8_12

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.
LibreCat: https://research-explorer.ista.ac.at/record/3253
DOI: 10.1007/978-3-642-27940-9_1

Feret J, Henzinger TA, Koeppl H, Petrov T. 2012. Lumpability abstractions of rule based systems. Theoretical Computer Science. 431, 137–164.
LibreCat: https://research-explorer.ista.ac.at/record/3168
DOI: 10.1016/j.tcs.2011.12.059

Chatterjee K, Henzinger TA. 2012. A survey of stochastic <9 regular games. Journal of Computer and System Sciences. 78(2), 394–413.
LibreCat: https://research-explorer.ista.ac.at/record/3846
DOI: 10.1016/j.jcss.2011.05.002

Chatterjee K, Doyen L, Henzinger TA. 2012. A survey of partial-observation stochastic parity games. Formal Methods in System Design. 43(2), 268–284.
LibreCat: https://research-explorer.ista.ac.at/record/3128
DOI: 10.1007/s10703-012-0164-2

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.
LibreCat: https://research-explorer.ista.ac.at/record/3155
DOI: 10.1007/978-3-642-30793-5_13

Ghosal A, Iercan D, Kirsch C, Henzinger TA, Sangiovanni Vincentelli A. 2012. Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. Science of Computer Programming. 77(2), 96–112.
LibreCat: https://research-explorer.ista.ac.at/record/3836
DOI: 10.1016/j.scico.2010.06.004

Alur R, Cerny P, Weinstein S. 2012. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). 13(3), 27.
LibreCat: https://research-explorer.ista.ac.at/record/2967
DOI: 10.1145/2287718.2287727

Boker U, Kupferman O. 2012. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). 13(4), 29.
LibreCat: https://research-explorer.ista.ac.at/record/494
DOI: 10.1145/2362355.2362357

Cerny P, Henzinger TA, Radhakrishna A. 2012. Simulation distances. Theoretical Computer Science. 413(1), 21–35.
LibreCat: https://research-explorer.ista.ac.at/record/3249
DOI: 10.1016/j.tcs.2011.08.002

Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Accurate invariant checking for programs manipulating lists and arrays with infinite data. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and AnalysisLNCS, LNCS, vol. 7561, 167–182.
LibreCat: https://research-explorer.ista.ac.at/record/10903
DOI: 10.1007/978-3-642-33386-6_14

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.
LibreCat: https://research-explorer.ista.ac.at/record/10906
DOI: 10.1007/978-3-642-28756-5_46

Gupta A. 2012.Improved Single Pass Algorithms for Resolution Proof Reduction. In: Automated Technology for Verification and Analysis. vol. 7561, 107–121.
LibreCat: https://research-explorer.ista.ac.at/record/5745
DOI: 10.1007/978-3-642-33386-6_10

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.
LibreCat: https://research-explorer.ista.ac.at/record/3251
DOI: 10.1007/978-3-642-27940-9_29

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.
LibreCat: https://research-explorer.ista.ac.at/record/3264
DOI: 10.1007/978-3-642-25318-8_16

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.
LibreCat: https://research-explorer.ista.ac.at/record/3302

Henzinger TA, Mateescu M. 2011. Tail approximation for the chemical master equation. WCSB: Workshop on Computational Systems Biology (TICSP).
LibreCat: https://research-explorer.ista.ac.at/record/3301

Henzinger TA, Mateescu M. 2011. Propagation models for computing biochemical reaction networks. CMSB: Computational Methods in Systems Biology, 1–3.
LibreCat: https://research-explorer.ista.ac.at/record/3299
DOI: 10.1145/2037509.2037510

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.
LibreCat: https://research-explorer.ista.ac.at/record/3316
DOI: 10.1109/SIES.2011.5953660

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.
LibreCat: https://research-explorer.ista.ac.at/record/3353
DOI: 10.1145/1985342.1985345

Halalai R, Henzinger TA, Singh V. 2011. Quantitative evaluation of BFT protocols. QEST: Quantitative Evaluation of Systems, 255–264.
LibreCat: https://research-explorer.ista.ac.at/record/3355
DOI: 10.1109/QEST.2011.40

Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4), 28.
LibreCat: https://research-explorer.ista.ac.at/record/3354
DOI: 10.1145/1970398.1970404

Fisher J, Harel D, Henzinger TA. 2011. Biology as reactivity. Communications of the ACM. 54(10), 72–82.
LibreCat: https://research-explorer.ista.ac.at/record/3352
DOI: 10.1145/2001269.2001289

Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. 2011. Dynamic reactive modules. CONCUR: Concurrency Theory, LNCS, vol. 6901, 404–418.
LibreCat: https://research-explorer.ista.ac.at/record/3362
DOI: 10.1007/978-3-642-23217-6_27

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.
LibreCat: https://research-explorer.ista.ac.at/record/3365
DOI: 10.1007/978-3-642-19835-9_24

Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.
LibreCat: https://research-explorer.ista.ac.at/record/3363
arXiv: 1104.0127

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.
LibreCat: https://research-explorer.ista.ac.at/record/3381
DOI: 10.1142/S0129054111008441

Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4).
LibreCat: https://research-explorer.ista.ac.at/record/3315
DOI: 10.2168/LMCS-7(4:8)2011

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.
LibreCat: https://research-explorer.ista.ac.at/record/3326
DOI: 10.1007/978-3-642-24372-1_37

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.
LibreCat: https://research-explorer.ista.ac.at/record/3325
DOI: 10.1145/1926385.1926454

Piskac R, Wies T. 2011. Decision procedures for automating termination proofs. VMCAI: Verification Model Checking and Abstract Interpretation, LNCS, vol. 6538, 371–386.
LibreCat: https://research-explorer.ista.ac.at/record/3324
DOI: 10.1007/978-3-642-18275-4_26

Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.
LibreCat: https://research-explorer.ista.ac.at/record/3360
DOI: 10.4230/LIPIcs.CSL.2011.82

Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.
LibreCat: https://research-explorer.ista.ac.at/record/3361
DOI: 10.1109/CSF.2011.21

Henzinger TA, Singh V, Wies T, Zufferey D. 2011. Scheduling large jobs by abstraction refinement. EuroSys, 329–342.
LibreCat: https://research-explorer.ista.ac.at/record/3358
DOI: 10.1145/1966445.1966476

Cerny P, Henzinger TA. 2011. From boolean to quantitative synthesis. EMSOFT: Embedded Software , 149–154.
LibreCat: https://research-explorer.ista.ac.at/record/3359
DOI: 10.1145/2038642.2038666

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.
LibreCat: https://research-explorer.ista.ac.at/record/3357
DOI: 10.1007/978-3-642-21254-3_17

Didier F, Henzinger TA, Mateescu M, Wolf V. 2011. Approximation of event probabilities in noisy cellular processes. Theoretical Computer Science. 412(21), 2128–2141.
LibreCat: https://research-explorer.ista.ac.at/record/3364
DOI: 10.1016/j.tcs.2010.10.022

Guerraoui R, Henzinger TA, Singh V. 2011. Verification of STM on relaxed memory models. Formal Methods in System Design. 39(3), 297–331.
LibreCat: https://research-explorer.ista.ac.at/record/531
DOI: 10.1007/s10703-011-0131-3

Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.
LibreCat: https://research-explorer.ista.ac.at/record/3356
DOI: 10.1109/LICS.2011.33

Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.
LibreCat: https://research-explorer.ista.ac.at/record/5385
DOI: 10.15479/AT:IST-2011-0003

Wies T, Muñiz M, Kuncak V. 2011. On an efficient decision procedure for imperative tree data structures, IST Austria, 25p.
LibreCat: https://research-explorer.ista.ac.at/record/5383
DOI: 10.15479/AT:IST-2011-0005

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.
LibreCat: https://research-explorer.ista.ac.at/record/3323
DOI: 10.1007/978-3-642-22438-6_36