Trinh, G., Benhamou, B., Pastva, S., &; Soliman, S. (2024). Scalable enumeration of trap spaces in boolean networks via answer set programming. In Proceedings of the 38th AAAI Conference on Artificial Intelligence (Vol. 38, pp. 10714–10722). Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v38i9.28943 

Chalupa, M., &; Richter, C. (2024). Bubaak-SpLit: Split what you cannot verify (Competition contribution). In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 14572, pp. 353–358). Cham: Springer Nature.https://doi.org/10.1007/978-3-031-57256-2_20 

Chalupa, M., &; Henzinger, T. A. (2023). Bubaak: Runtime monitoring of program verifiers. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13994, pp. 535–540). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30820-8_32 

Chalupa, M., Mühlböck, F., Muroya Lei, S., &; Henzinger, T. A. (2023). Vamos: Middleware for best-effort third-party monitoring. In Fundamental Approaches to Software Engineering (Vol. 13991, pp. 260–281). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30826-0_15 

Chalupa, M., Mühlböck, F., Muroya Lei, S., &; Henzinger, T. A. (2023). VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:12407 

Chatterjee, K., Henzinger, T. A., Lechner, M., &; Zikelic, D. (2023). A learner-verifier framework for neural network controllers and certificates of stochastic systems. In Tools and Algorithms for the Construction and Analysis of Systems  (Vol. 13993, pp. 3–25). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30823-9_1 

Anand, A., Mallik, K., Nayak, S. P., &; Schmuck, A. K. (2023). Computing adequately permissive assumptions for synthesis. In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13994, pp. 211–228). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30820-8_15 

Henzinger, T. A., Mazzocchi, N. A., &; Sarac, N. E. (2023). Quantitative safety and liveness. In 26th International Conference Foundations of Software Science and Computation Structures (Vol. 13992, pp. 349–370). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30829-1_17 

Henzinger, T. A., Kebis, P., Mazzocchi, N. A., &; Sarac, N. E. (2023). Regular methods for operator precedence languages. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261, p. 129:1--129:20). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2023.129 

Lechner, M., Amini, A., Rus, D., &; Henzinger, T. A. (2023). Revisiting the adversarial robustness-accuracy tradeoff in robot learning. IEEE Robotics and Automation Letters. Institute of Electrical and Electronics Engineers.https://doi.org/10.1109/LRA.2023.3240930 

Benes, N., Brim, L., Huvar, O., Pastva, S., &; Safránek, D. (2023). Boolean network sketches: A unifying framework for logical model inference. Bioinformatics. Oxford Academic.https://doi.org/10.1093/bioinformatics/btad158 

Lechner, M., Zikelic, D., Chatterjee, K., Henzinger, T. A., &; Rus, D. (2023). Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 14964–14973). Washington, DC, United States: Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v37i12.26747 

Avni, G., Jecker, I. R., &; Zikelic, D. (2023). Bidding graph games with partially-observable budgets. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 5464–5471). Washington, DC, United States.https://doi.org/10.1609/aaai.v37i5.25679 

Henzinger, T. A., Karimi, M., Kueffner, K., &; Mallik, K. (2023). Monitoring algorithmic fairness. In Computer Aided Verification (Vol. 13965, pp. 358–382). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-37703-7_17 

Boker, U., Henzinger, T. A., Mazzocchi, N. A., &; Sarac, N. E. (2023). Safety and liveness of quantitative automata. In 34th International Conference on Concurrency Theory (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2023.17 

Bartocci, E., Henzinger, T. A., Nickovic, D., &; Oliveira da Costa, A. (2023). Hypernode automata. In 34th International Conference on Concurrency Theory (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2023.21 

Henzinger, T. A., Kueffner, K., &; Mallik, K. (2023). Monitoring algorithmic fairness under partial observations. In 23rd International Conference on Runtime Verification (Vol. 14245, pp. 291–311). Thessaloniki, Greece: Springer Nature.https://doi.org/10.1007/978-3-031-44267-4_15 

Avni, G., Meggendorfer, T., Sadhukhan, S., Tkadlec, J., &; Zikelic, D. (2023). Reachability poorman discrete-bidding games. In Frontiers in Artificial Intelligence and Applications (Vol. 372, pp. 141–148). Krakow, Poland: IOS Press.https://doi.org/10.3233/FAIA230264 

Ansaripour, M., Chatterjee, K., Henzinger, T. A., Lechner, M., &; Zikelic, D. (2023). Learning provably stabilizing neural controllers for discrete-time stochastic systems. In 21st International Symposium on Automated Technology for Verification and Analysis (Vol. 14215, pp. 357–379). Singapore, Singapore: Springer Nature.https://doi.org/10.1007/978-3-031-45329-8_17 

Trinh, V. G., Benhamou, B., Henzinger, T. A., &; Pastva, S. (2023). Trap spaces of multi-valued networks: Definition, computation, and applications. Bioinformatics. Oxford Academic.https://doi.org/10.1093/bioinformatics/btad262 

Majumdar, R., Mallik, K., Schmuck, A. K., &; Soudjani, S. (2023). Symbolic control for stochastic systems via finite parity games. Nonlinear Analysis: Hybrid Systems. Elsevier.https://doi.org/10.1016/j.nahs.2023.101430 

Pastva, S., &; Henzinger, T. A. (2023). Binary decision diagrams on modern hardware. In Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design (pp. 122–131). Ames, IA, United States: TU Vienna Academic Press.https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20 

Zikelic, D., Lechner, M., Henzinger, T. A., &; Chatterjee, K. (2023). Learning control policies for stochastic systems with reach-avoid guarantees. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 11926–11935). Washington, DC, United States: Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v37i10.26407 

Kueffner, K., Lukina, A., Schilling, C., &; Henzinger, T. A. (2023). Into the unknown: Active monitoring of neural networks (extended version). International Journal on Software Tools for Technology Transfer. Springer Nature.https://doi.org/10.1007/s10009-023-00711-4 

Banerjee, T., Majumdar, R., Mallik, K., Schmuck, A.-K., &; Soudjani, S. (2023). Fast symbolic algorithms for mega-regular games under strong transition fairness. TheoretiCS. EPI Sciences.https://doi.org/10.46298/theoretics.23.4 

Benes, N., Brim, L., Pastva, S., Safránek, D., &; Smijáková, E. (2023). Phenotype control of partially specified boolean networks. In 21st International Conference on Computational Methods in Systems Biology (Vol. 14137, pp. 18–35). Luxembourg City, Luxembourg: Springer Nature.https://doi.org/10.1007/978-3-031-42697-1_2 

Majumdar, R., Mallik, K., Rychlicki, M., Schmuck, A.-K., &; Soudjani, S. (2023). A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties. In 35th International Conference on Computer Aided Verification (Vol. 13966, pp. 3–15). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-37709-9_1 

Majumdar, R., Mallik, K., Rychlicki, M., Schmuck, A.-K., &; Soudjani, S. (2023). A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties. Zenodo.https://doi.org/10.5281/ZENODO.7877790 

Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., &; Henzinger, T. A. (2023). Compositional policy learning in stochastic control systems with formal guarantees. In 37th Conference on Neural Information Processing Systems. New Orleans, LO, United States.

Chalupa, M., &; Henzinger, T. A. (2023). Monitoring hyperproperties with prefix transducers. In 23nd International Conference on Runtime Verification (Vol. 14245, pp. 168–190). Thessaloniki, Greek: Springer Nature.https://doi.org/10.1007/978-3-031-44267-4_9 

Chalupa, M., &; Henzinger, T. A. (2023). Monitoring hyperproperties with prefix transducers. Zenodo.https://doi.org/10.5281/ZENODO.8191723 

Henzinger, T. A., Karimi, M., Kueffner, K., &; Mallik, K. (2023). Runtime monitoring of dynamic fairness properties. In FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency (pp. 604–614). Chicago, IL, United States: Association for Computing Machinery.https://doi.org/10.1145/3593013.3594028 

Bartocci, E., Ferrere, T., Henzinger, T. A., Nickovic, D., &; Da Costa, A. O. (2022). Flavors of sequential information flow. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13182, pp. 1–19). Philadelphia, PA, United States: Springer Nature.https://doi.org/10.1007/978-3-030-94583-1_1 

Brunnbauer, A., Berducci, L., Brandstatter, A., Lechner, M., Hasani, R., Rus, D., &; Grosu, R. (2022). Latent imagination facilitates zero-shot transfer in autonomous racing. In 2022 International Conference on Robotics and Automation (pp. 7513–7520). Philadelphia, PA, United States: IEEE.https://doi.org/10.1109/ICRA46639.2022.9811650 

Garcia Soto, M., Henzinger, T. A., &; Schilling, C. (2022). Synthesis of parametric hybrid automata from time series. In 20th International Symposium on Automated Technology for Verification and Analysis (Vol. 13505, pp. 337–353). Virtual: Springer Nature.https://doi.org/10.1007/978-3-031-19992-9_22 

Henzinger, T. A., Lehtinen, K., &; Totzke, P. (2022). History-deterministic timed automata. In 33rd International Conference on Concurrency Theory (Vol. 243, p. 14:1-14:21). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2022.14 

Avni, G., &; Henzinger, T. A. (2022). An updated survey of bidding games on graphs. In 47th International Symposium on Mathematical Foundations of Computer Science (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2022.3 

Lechner, M., Amini, A., Rus, D., &; Henzinger, T. A. (n.d.). Revisiting the adversarial robustness-accuracy tradeoff in robot learning. arXiv.https://doi.org/10.48550/arXiv.2204.07373 

Henzinger, T. A. (2022). Quantitative monitoring of software. In Software Verification (Vol. 13124, pp. 3–6). New Haven, CT, United States: Springer Nature.https://doi.org/10.1007/978-3-030-95561-8_1 

Bartocci, E., Ferrere, T., Henzinger, T. A., Nickovic, D., &; Da Costa, A. O. (2022). Information-flow interfaces. In Fundamental Approaches to Software Engineering (Vol. 13241, pp. 3–22). Munich, Germany: Springer Nature.https://doi.org/10.1007/978-3-030-99429-7_1 

Henzinger, T. A., Mazzocchi, N. A., &; Sarac, N. E. (2022). Abstract monitors for quantitative specifications. In 22nd International Conference on Runtime Verification (Vol. 13498, pp. 200–220). Tbilisi, Georgia: Springer Nature.https://doi.org/10.1007/978-3-031-17196-3_11 

Hasani, R., Lechner, M., Amini, A., Liebenwein, L., Ray, A., Tschaikowski, M.,https://doi.org/10.1038/s42256-022-00556-7__Rus, D. (2022). Closed-form continuous-time neural networks. Nature Machine Intelligence. Springer Nature.https://doi.org/10.1038/s42256-022-00556-7 

Lechner, M. (2022). Learning verifiable representations. Institute of Science and Technology Austria.https://doi.org/10.15479/at:ista:11362 

Doveri, K., Ganty, P., &; Mazzocchi, N. A. (2022). FORQ-based language inclusion formal testing. In Computer Aided Verification (Vol. 13372, pp. 109–129). Haifa, Israel: Springer Nature.https://doi.org/10.1007/978-3-031-13188-2_6 

Bose, S., Henzinger, T. A., Lehtinen, K., Schewe, S., &; Totzke, P. (2022). History-deterministic timed automata are not determinizable. In 16th International Conference on Reachability Problems (Vol. 13608, pp. 67–76). Kaiserslautern, Germany: Springer Nature.https://doi.org/10.1007/978-3-031-19135-0_5 

Gruenbacher, S. A., Lechner, M., Hasani, R., Rus, D., Henzinger, T. A., Smolka, S. A., &; Grosu, R. (2022). GoTube: Scalable statistical verification of continuous-depth models. Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v36i6.20631 

Lechner, M., Zikelic, D., Chatterjee, K., &; Henzinger, T. A. (2022). Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v36i7.20695 

Zikelic, D., Lechner, M., Chatterjee, K., &; Henzinger, T. A. (n.d.). Learning stabilizing policies in stochastic control systems. arXiv.https://doi.org/10.48550/arXiv.2205.11991 

Zikelic, D., Lechner, M., Henzinger, T. A., &; Chatterjee, K. (n.d.). Learning control policies for stochastic systems with reach-avoid guarantees. arXiv.https://doi.org/10.48550/ARXIV.2210.05308 

Mühlböck, F., &; Tate, R. (2021). Transitioning from structural to nominal code with efficient gradual typing. Proceedings of the ACM on Programming Languages. Chicago, IL, United States: Association for Computing Machinery.https://doi.org/10.1145/3485504 

Grunbacher, S., Hasani, R., Lechner, M., Cyranka, J., Smolka, S. A., &; Grosu, R. (2021). On the verification of neural ODEs with stochastic guarantees. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, pp. 11525–11535). Virtual: AAAI Press.

Hasani, R., Lechner, M., Amini, A., Rus, D., &; Grosu, R. (2021). Liquid time-constant networks. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, pp. 7657–7666). Virtual: AAAI Press.

Babaiee, Z., Hasani, R., Lechner, M., Rus, D., &; Grosu, R. (2021). On-off center-surround receptive fields for accurate and robust image classification. In Proceedings of the 38th International Conference on Machine Learning (Vol. 139, pp. 478–489). Virtual: ML Research Press.

Vorbach, C. J., Hasani, R., Amini, A., Lechner, M., &; Rus, D. (2021). Causal navigation by continuous-time neural networks. In 35th Conference on Neural Information Processing Systems. Virtual.

Kragl, B., &; Qadeer, S. (2021). The Civl verifier. In P. Ruzica &; M. W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press.https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23 

Dubach, G., &; Mühlböck, F. (n.d.). Formal verification of Zagier’s one-sentence proof. arXiv.https://doi.org/10.48550/arXiv.2103.11389 

Henzinger, T. A., Lechner, M., &; Zikelic, D. (2021). Scalable verification of quantized neural networks. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, pp. 3787–3795). Virtual: AAAI Press.

Lechner, M., dikeli, Ð., Chatterjee, K., &; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In 35th Conference on Neural Information Processing Systems. Virtual.https://doi.org/10.48550/arXiv.2111.03165 

Sarac, N. E., Altun, Ö. F., Atam, K. T., Karahoda, S., Kaya, K., &; Yenigün, H. (2021). Boosting expensive synchronizing heuristics. Expert Systems with Applications. Elsevier.https://doi.org/10.1016/j.eswa.2020.114203 

Garcia Soto, M., Henzinger, T. A., &; Schilling, C. (2021). Synthesis of hybrid automata with affine dynamics from time-series data. In HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control (p. 2102.12734). Nashville, TN, United States: Association for Computing Machinery.https://doi.org/10.1145/3447928.3456704 

Avni, G., Henzinger, T. A., &; dikeli, . (2021). Bidding mechanisms in graph games. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2021.02.008 

Henzinger, T. A., &; Sarac, N. E. (2021). Quantitative and approximate monitoring. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Online: Institute of Electrical and Electronics Engineers.https://doi.org/10.1109/LICS52264.2021.9470547 

Petrov, T., Igler, C., Sezgin, A., Henzinger, T. A., &; Guet, C. C. (2021). Long lived transients in gene regulation. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2021.05.023 

Mühlböck, F., &; Henzinger, T. A. (2021). Differential monitoring. In International Conference on Runtime Verification (Vol. 12974, pp. 231–243). Cham: Springer Nature.https://doi.org/10.1007/978-3-030-88494-9_12 

Mühlböck, F., &; Henzinger, T. A. (2021). Differential monitoring. IST Austria.https://doi.org/10.15479/AT:ISTA:9946 

Sietzen, S., Lechner, M., Borowski, J., Hasani, R., &; Waldner, M. (2021). Interactive analysis of CNN robustness. Computer Graphics Forum. Wiley.https://doi.org/10.1111/cgf.14418 

Aghajohari, M., Avni, G., &; Henzinger, T. A. (2021). Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. International Federation for Computational Logic.https://doi.org/10.23638/LMCS-17(1:10)2021 

Lechner, M., Hasani, R., Grosu, R., Rus, D., &; Henzinger, T. A. (2021). Adversarial training is not ready for robot learning. In 2021 IEEE International Conference on Robotics and Automation (pp. 4140–4147). Xi’an, China.https://doi.org/10.1109/ICRA48506.2021.9561036 

Lukina, A., Schilling, C., &; Henzinger, T. A. (2021). Into the unknown: active monitoring of neural networks. In 21st International Conference on Runtime Verification (Vol. 12974, pp. 42–61). Cham: Springer Nature.https://doi.org/10.1007/978-3-030-88494-9_3 

Hasani, R., Lechner, M., Amini, A., Rus, D., &; Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In Proceedings of the 37th International Conference on Machine Learning (pp. 4082–4093). Virtual.

Ferrere, T., Henzinger, T. A., &; Kragl, B. (2020). Monitoring event frequencies. In 28th EACSL Annual Conference on Computer Science Logic (Vol. 152). Barcelona, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CSL.2020.20 

Althoff, M., Bak, S., Bao, Z., Forets, M., Frehse, G., Freire, D.,https://doi.org/10.29007/7dt2__Wetzlinger, M. (2020). ARCH-COM Category Report: Continuous and hybrid systems with linear dynamics. In EPiC Series in Computing (Vol. 74, pp. 16–48). EasyChair.https://doi.org/10.29007/7dt2 

Geretti, L., Alexandre Dit Sandretto, J., Althoff, M., Benet, L., Chapoutot, A., Chen, X.,https://doi.org/10.29007/zkf6__Schilling, C. (2020). ARCH-COM Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 74, pp. 49–75). EasyChair.https://doi.org/10.29007/zkf6 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2020.23 

Avni, G., &; Henzinger, T. A. (2020). A survey of bidding games on graphs. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2020.2 

Alamdari, P. A., Avni, G., Henzinger, T. A., &; Lukina, A. (2020). Formal methods with a touch of magic. In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (pp. 138–147). Online Conference: TU Wien Academic Press.https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21 

Singh, S. P., &; Alistarh, D.-A. (2020). WoodFisher: Efficient second-order approximation for neural network compression. In Advances in Neural Information Processing Systems (Vol. 33, pp. 18098–18109). Vancouver, Canada: Curran Associates.

Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., &; Grosu, R. (2020). Lagrangian reachtubes: The next generation. In Proceedings of the 59th IEEE Conference on Decision and Control (Vol. 2020, pp. 1556–1563). Jeju Islang, Korea (South): IEEE.https://doi.org/10.1109/CDC42340.2020.9304042 

Lechner, M. (2020). Learning representations for binary-classification without backpropagation. In 8th International Conference on Learning Representations. Virtualf; Addis Ababa, Ethiopia: ICLR.

Giacobbe, M., Henzinger, T. A., &; Lechner, M. (2020). How many bits does it take to quantize your neural network? In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12079, pp. 79–97). Dublin, Ireland: Springer Nature.https://doi.org/10.1007/978-3-030-45237-7_5 

Avni, G., Henzinger, T. A., &; Kupferman, O. (2020). Dynamic resource allocation games. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2019.06.031 

Henzinger, T. A., Lukina, A., &; Schilling, C. (2020). Outside the box: Abstraction-based monitoring of neural networks. In 24th European Conference on Artificial Intelligence (Vol. 325, pp. 2433–2440). Santiago de Compostela, Spain: IOS Press.https://doi.org/10.3233/FAIA200375 

Baranowski, M., He, S., Lechner, M., Nguyen, T. S., &; Rakamari, Z. (2020). An SMT theory of fixed-point arithmetic. In Automated Reasoning (Vol. 12166, pp. 13–31). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-030-51074-9_2 

Lechner, M., Hasani, R., Amini, A., Henzinger, T. A., Rus, D., &; Grosu, R. (2020). Neural circuit policies enabling auditable autonomy. Nature Machine Intelligence. Springer Nature.https://doi.org/10.1038/s42256-020-00237-3 

Lechner, M., Hasani, R., Rus, D., &; Grosu, R. (2020). Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end robot learning scheme. In Proceedings - IEEE International Conference on Robotics and Automation (pp. 5446–5452). Paris, France: IEEE.https://doi.org/10.1109/ICRA40945.2020.9196608 

Forets, M., Freire, D., &; Schilling, C. (2020). Efficient reachability analysis of parametric linear hybrid systems with  time-triggered transitions. In 18th ACM-IEEE International Conference on Formal Methods and Models for System Design. Virtual Conference: IEEE.https://doi.org/10.1109/MEMOCODE51338.2020.9314994 

Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., &; Schilling, C. (2020). Reachability analysis of linear hybrid systems via block decomposition. In Proceedings of the International Conference on Embedded Software. Virtual .

Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., &; Schilling, C. (2020). Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE.https://doi.org/10.1109/TCAD.2020.3012859 

Avni, G., Ibsen-Jensen, R., &; Tkadlec, J. (2020). All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v34i02.5546 

Henzinger, T. A., &; Sarac, N. E. (2020). Monitorability under assumptions. In Runtime Verification (Vol. 12399, pp. 3–18). Los Angeles, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-030-60508-7_1 

Kragl, B., Qadeer, S., &; Henzinger, T. A. (2020). Refinement for structured concurrent programs. In Computer Aided Verification (Vol. 12224, pp. 275–298). Springer Nature.https://doi.org/10.1007/978-3-030-53288-8_14 

Kragl, B., Enea, C., Henzinger, T. A., Mutluergil, S. O., &; Qadeer, S. (2020). Inductive sequentialization of asynchronous programs. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 227–242). London, United Kingdom: Association for Computing Machinery.https://doi.org/10.1145/3385412.3385980 

Nickovic, D., Lebeltel, O., Maler, O., Ferrere, T., &; Ulus, D. (2020). AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. International Journal on Software Tools for Technology Transfer. Springer Nature.https://doi.org/10.1007/s10009-020-00582-z 

Kragl, B. (2020). Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:8332 

Garcia Soto, M., &; Prabhakar, P. (2020). Hybridization for stability verification of nonlinear switched systems. In 2020 IEEE Real-Time Systems Symposium (pp. 244–256). Houston, TX, USA : IEEE.https://doi.org/10.1109/RTSS49844.2020.00031 

Garcia Soto, M., &; Prabhakar, P. (2020). Abstraction based verification of stability of polyhedral switched systems. Nonlinear Analysis: Hybrid Systems. Elsevier.https://doi.org/10.1016/j.nahs.2020.100856 

Frehse, G., Abate, A., Adzkiya, D., Becchi, A., Bu, L., Cimatti, A.,https://doi.org/10.29007/rjwn__Zaffanella, E. (2019). ARCH-COM Category Report: Hybrid systems with piecewise constant dynamics. In G. Frehse &; M. Althoff (Eds.), ARC. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems (Vol. 61, pp. 1–13). Montreal, Canada: EasyChair.https://doi.org/10.29007/rjwn 

Kundu, A., Garcia Soto, M., &; Prabhakar, P. (2019). Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In 5th Indian Control Conference Proceedings. Delhi, India: IEEE.https://doi.org/10.1109/INDIANCC.2019.8715598 

Avni, G., Henzinger, T. A., Ibsen-Jensen, R., &; Novotny, P. (2019). Bidding games on Markov decision processes. In https://doi.org/10.1007/978-3-030-30806-3_1__Proceedings of the 13th International Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer.https://doi.org/10.1007/978-3-030-30806-3_1 

Lechner, M., Hasani, R., Zimmer, M., Henzinger, T. A., &; Grosu, R. (2019). Designing worm-inspired neural networks for interpretable robotic control. In Proceedings - IEEE International Conference on Robotics and Automation (Vol. 2019–May). Montreal, QC, Canada: IEEE.https://doi.org/10.1109/icra.2019.8793840 

Aghajohari, M., Avni, G., &; Henzinger, T. A. (2019). Determinacy in discrete-bidding infinite-duration games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.CONCUR.2019.20 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.CONCUR.2019.27 

Hasani, R., Amini, A., Lechner, M., Naser, F., Grosu, R., &; Rus, D. (2019). Response characterization for auditing cell dynamics in long short-term memory networks. In Proceedings of the International Joint Conference on Neural Networks. Budapest, Hungary: IEEE.https://doi.org/10.1109/ijcnn.2019.8851954 

Alur, R., Giacobbe, M., Henzinger, T. A., Larsen, K. G., &; Mikudionis, M. (2019). Continuous-time models for system design and analysis. In B. Steffen &; G. Woeginger (Eds.), Computing and Software Science (Vol. 10000, pp. 452–477). Springer Nature.https://doi.org/10.1007/978-3-319-91908-9_22 

Immler, F., Althoff, M., Benet, L., Chapoutot, A., Chen, X., Forets, M.,https://doi.org/10.29007/m75b__Schilling, C. (2019). ARCH-COM Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 61, pp. 41–61). Montreal, Canada: EasyChair Publications.https://doi.org/10.29007/m75b 

Althoff, M., Bak, S., Forets, M., Frehse, G., Kochdumper, N., Ray, R.,https://doi.org/10.29007/bj1w__Schupp, S. (2019). ARCH-COM Category Report: Continuous and hybrid systems with linear continuous dynamics. In EPiC Series in Computing (Vol. 61, pp. 14–40). Montreal, Canada: EasyChair.https://doi.org/10.29007/bj1w 

Avni, G., Henzinger, T. A., &; Zikelic, D. (2019). Bidding mechanisms in graph games (Vol. 138). Presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.MFCS.2019.11 

Christakis, M., Heizmann, M., Mansur, M. N., Schilling, C., &; Wüstholz, V. (2019). Semantic fault localization and suspiciousness ranking. In 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems  (Vol. 11427, pp. 226–243). Prague, Czech Republic: Springer Nature.https://doi.org/10.1007/978-3-030-17462-0_13 

Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., &; Schilling, C. (2019). JuliaReach: A toolbox for set-based reachability. In Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control (Vol. 22, pp. 39–44). Montreal, QC, Canada: ACM.https://doi.org/10.1145/3302504.3311804 

Ferrere, T., Nickovic, D., Donzé, A., Ito, H., &; Kapinski, J. (2019). Interface-aware signal temporal logic. In Proceedings of the 2019 22nd ACM International Conference on Hybrid Systems: Computation and Control (pp. 57–66). Montreal, Canada: ACM.https://doi.org/10.1145/3302504.3311800 

Avni, G., Bloem, R., Chatterjee, K., Henzinger, T. A., Konighofer, B., &; Pranger, S. (2019). Run-time optimization for learned controllers through quantitative games. In 31st International Conference on Computer-Aided Verification (Vol. 11561, pp. 630–649). New York, NY, United States: Springer.https://doi.org/10.1007/978-3-030-25540-4_36 

Garcia Soto, M., Henzinger, T. A., Schilling, C., &; Zeleznik, L. (2019). Membership-based synthesis of linear hybrid automata. In 31st International Conference on Computer-Aided Verification (Vol. 11561, pp. 297–314). New York City, NY, USA: Springer.https://doi.org/10.1007/978-3-030-25540-4_16 

Avni, G., Henzinger, T. A., &; Chonev, V. K. (2019). Infinite-duration bidding games. Journal of the ACM. ACM.https://doi.org/10.1145/3340295 

Ferrere, T., Maler, O., Nidkovi, D., &; Pnueli, A. (2019). From real-time logic to timed automata. Journal of the ACM. ACM.https://doi.org/10.1145/3286976 

Guet, C. C., Henzinger, T. A., Igler, C., Petrov, T., &; Sezgin, A. (2019). Transient memory in gene regulation. In 17th International Conference on Computational Methods in Systems Biology (Vol. 11773, pp. 155–187). Trieste, Italy: Springer Nature.https://doi.org/10.1007/978-3-030-31304-3_9 

Nidkovi, D., Qin, X., Ferrere, T., Mateis, C., &; Deshmukh, J. (2019). Shape expressions for specifying and extracting signal features. In 19th International Conference on Runtime Verification (Vol. 11757, pp. 292–309). Porto, Portugal: Springer Nature.https://doi.org/10.1007/978-3-030-32079-9_17 

Kong, H., Bartocci, E., Jiang, Y., &; Henzinger, T. A. (2019). Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty. In 17th International Conference on Formal Modeling and Analysis of Timed Systems (Vol. 11750, pp. 123–141). Amsterdam, The Netherlands: Springer Nature.https://doi.org/10.1007/978-3-030-29662-9_8 

Ferrere, T., Maler, O., &; Nickovic, D. (2019). Mixed-time signal temporal logic. In 17th International Conference on Formal Modeling and Analysis of Timed Systems (Vol. 11750, pp. 59–75). Amsterdam, The Netherlands: Springer Nature.https://doi.org/10.1007/978-3-030-29662-9_4 

Giacobbe, M. (2019). Automatic time-unbounded reachability analysis of hybrid systems. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:6894 

Clarke, E. M., Henzinger, T. A., Veith, H., &; Bloem, R. (2018). Handbook of Model Checking (1st ed.). Cham: Springer Nature.https://doi.org/10.1007/978-3-319-10575-8 

Clarke, E., Henzinger, T. A., &; Veith, H. (2018). Introduction to model checking. In T. A. Henzinger (Ed.), Handbook of Model Checking (pp. 1–26). Springer.https://doi.org/10.1007/978-3-319-10575-8_1 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, &; M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer.https://doi.org/10.1007/978-3-319-95246-8_9 

Avni, G., Guha, S., &; Kupferman, O. (2018). Timed network games with clocks (Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.MFCS.2018.23 

Kragl, B., Qadeer, S., &; Henzinger, T. A. (2018). Synchronizing the asynchronous (Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2018.21 

Nickovic, D., Lebeltel, O., Maler, O., Ferrere, T., &; Ulus, D. (2018). AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal logic. In D. Beyer &; M. Huisman (Eds.) (Vol. 10806, pp. 303–319). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer.https://doi.org/10.1007/978-3-319-89963-3_18 

Ferrere, T., Henzinger, T. A., &; Saraç, E. (2018). A theory of register monitors (Vol. Part 8033, pp. 394–403). Presented at the LICS: Logic in Computer Science, Oxford, UK: IEEE.https://doi.org/10.1145/3209108.3209194 

Bakhirkin, A., Ferrere, T., &; Maler, O. (2018). Efficient parametric identification for STL. In Proceedings of the 21st International Conference on Hybrid Systems (pp. 177–186). Porto, Portugal: ACM.https://doi.org/10.1145/3178126.3178132 

Avni, G., Henzinger, T. A., &; Ibsen-Jensen, R. (2018). Infinite-duration poorman-bidding games (Vol. 11316, pp. 21–36). Presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK: Springer.https://doi.org/10.1007/978-3-030-04612-5_2 

Kragl, B., &; Qadeer, S. (2018). Layered Concurrent Programs (Vol. 10981, pp. 79–102). Presented at the CAV: Computer Aided Verification, Oxford, UK: Springer.https://doi.org/10.1007/978-3-319-96145-3_5 

Bartocci, E., Ferrere, T., Manjunath, N., &; Nickovic, D. (2018). Localizing faults in simulink/stateflow models with STL (pp. 197–206). Presented at the HSCC: Hybrid Systems: Computation and Control, Porto, Portugal: Association for Computing Machinery, Inc.https://doi.org/10.1145/3178126.3178131 

Elgyütt, A., Ferrere, T., &; Henzinger, T. A. (2018). Monitoring temporal logic with clock variables (Vol. 11022, pp. 53–70). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China: Springer.https://doi.org/10.1007/978-3-030-00151-3_4 

Bakhirkin, A., Ferrere, T., Nickovic, D., Maler, O., &; Asarin, E. (2018). Online timed pattern matching using automata (Vol. 11022, pp. 215–232). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China: Springer.https://doi.org/10.1007/978-3-030-00151-3_13 

Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., &; Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer.https://doi.org/10.1007/978-3-319-99154-2_4 

Kong, H., Bartocci, E., &; Henzinger, T. A. (2018). Reachable set over-approximation for nonlinear systems using piecewise barrier tubes (Vol. 10981, pp. 449–467). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer.https://doi.org/10.1007/978-3-319-96145-3_24 

Jiang, Y., Liu, H., Song, H., Kong, H., Wang, R., Guan, Y., &; Sha, L. (2018). Safety-assured model-driven design of the multifunction vehicle bus controller. IEEE Transactions on Intelligent Transportation Systems. IEEE.https://doi.org/10.1109/TITS.2017.2778077 

Frehse, G., Giacobbe, M., &; Henzinger, T. A. (2018). Space-time interpolants (Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer.https://doi.org/10.1007/978-3-319-96145-3_25 

Brázdil, T., Chatterjee, K., Kretinsky, J., &; Toman, V. (2018). Strategy representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407). Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece: Springer.https://doi.org/10.1007/978-3-319-89960-2_21 

Avni, G., &; Kupferman, O. (2018). Synthesis from component libraries with costs. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2017.11.001 

Ferrere, T. (2018). The compound interest in relaxing punctuality (Vol. 10951, pp. 147–164). Presented at the FM: International Symposium on Formal Methods, Oxford, UK: Springer.https://doi.org/10.1007/978-3-319-95582-7_9 

Bakhirkin, A., Ferrere, T., Henzinger, T. A., &; Nickovicl, D. (2018). Keynote: The first-order logic of signals. In 2018 International Conference on Embedded Software (pp. 1–10). Turin, Italy: IEEE.https://doi.org/10.1109/emsoft.2018.8537203 

Chatterjee, K., Elgyütt, A., Novotný, P., &; Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI.https://doi.org/10.24963/ijcai.2018/652 

Avni, G., Guha, S., &; Kupferman, O. (2018). An abstraction-refinement methodology for reasoning about network games. Games. MDPI AG.https://doi.org/10.3390/g9030039 

Benveniste, A., Nickovic, D., Caillaud, B., Passerone, R., Raclet, J. B., Reinkemeier, P.,https://doi.org/10.1561/1000000053__Larsen, K. G. (2018). Contracts for system design. Foundations and Trends in Electronic Design Automation. Now Publishers.https://doi.org/10.1561/1000000053 

Mciver, A., Morgan, C., Kaminski, B. L., &; Katoen, J. P. (2017). A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery.https://doi.org/10.1145/3158121 

Daca, P., Henzinger, T. A., Kretinsky, J., &; Petrov, T. (2017). Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/3060139 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/3152769 

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &; Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.23638/LMCS-13(3:23)2017 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, &; R. Mardare (Eds.), Models, Algorithms, Logics and Tools (Vol. 10460, pp. 367–381). Springer.https://doi.org/10.1007/978-3-319-63121-9_18 

Bak, S., Bogomolov, S., Henzinger, T. A., &; Kumar, A. (2017). Challenges and tool implementation of hybrid rapidly exploring random trees. In A. Abate &; S. Bodo (Eds.) (Vol. 10381, pp. 83–89). Presented at the NSV: Numerical Software Verification, Heidelberg, Germany: Springer.https://doi.org/10.1007/978-3-319-63501-9_6 

Bakhirkin, A., Ferrere, T., Maler, O., &; Ulus, D. (2017). On the quantitative semantics of regular expressions over real-valued signals. In A. Abate &; G. Geeraerts (Eds.) (Vol. 10419, pp. 189–206). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer.https://doi.org/10.1007/978-3-319-65765-3_11 

Bogomolov, S., Martel, M., &; Prabhakar, P. (Eds.). (2017). Numerical Software Verification (Vol. 10152). Presented at the NSV: Numerical Software Verification, Toronto, ON, Canada: Springer.https://doi.org/10.1007/978-3-319-54292-8 

Henzinger, T. A., Kragl, B., &; Qadeer, S. (2017). Synchronizing the asynchronous. IST Austria.https://doi.org/10.15479/AT:IST-2018-853-v2-2 

Kong, H., Bogomolov, S., Schilling, C., Jiang, Y., &; Henzinger, T. A. (2017). Safety verification of nonlinear hybrid systems based on invariant clusters. In Proceedings of the 20th International Conference on Hybrid Systems (pp. 163–172). Pittsburgh, PA, United States: ACM.https://doi.org/10.1145/3049797.3049814 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2017). Bidirectional nested weighted automata (Vol. 85). Presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2017.5 

Avni, G., Guha, S., &; Kupferman, O. (2017). Timed network games with clocks (Vol. 83). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2017.37 

Le, X., Chu, D. H., Lo, D., Le Goues, C., &; Visser, W. (2017). JFIX: Semantics-based repair of Java programs via symbolic  PathFinder. In Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis (pp. 376–379). Santa Barbara, CA, United States: ACM.https://doi.org/10.1145/3092703.3098225 

Avni, G., Henzinger, T. A., &; Chonev, V. K. (2017). Infinite-duration bidding games (Vol. 85). Presented at the CONCUR: Concurrency Theory, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2017.21 

Daca, P. (2017). Statistical and logical methods for property checking. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:TH_730 

Bogomolov, S., Giacobbe, M., Henzinger, T. A., &; Kong, H. (2017). Conic abstractions for hybrid systems (Vol. 10419, pp. 116–132). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer.https://doi.org/10.1007/978-3-319-65765-3_7 

Bogomolov, S., Frehse, G., Giacobbe, M., &; Henzinger, T. A. (2017). Counterexample guided refinement of template polyhedra (Vol. 10205, pp. 589–606). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden: Springer.https://doi.org/10.1007/978-3-662-54577-5_34 

Svoreová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cbrná, I., &; Belta, C. (2017). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier.https://doi.org/10.1016/j.nahs.2016.04.006 

Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., &; Tarrach, T. (2017). From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-016-0256-5 

Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., &; Petrov, T. (2017). Model checking the evolution of gene regulatory networks. Acta Informatica. Springer.https://doi.org/10.1007/s00236-016-0278-x 

Henzinger, T. A., &; Otop, J. (2017). Model measuring for discrete and hybrid systems. Nonlinear Analysis: Hybrid Systems. Elsevier.https://doi.org/10.1016/j.nahs.2016.09.001 

Avni, G., Goel, S., Henzinger, T. A., &; Rodríguez Navas, G. (2017). Computing scores of forwarding schemes in switched networks with probabilistic faults (Vol. 10206, pp. 169–187). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden: Springer.https://doi.org/10.1007/978-3-662-54580-5_10 

Chatterjee, K., Henzinger, T. A., Otop, J., &; Velner, Y. (2017). Quantitative fair simulation games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2016.10.006 

Chatterjee, K., Kragl, B., Mishra, S., &; Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer.https://doi.org/10.1007/978-3-662-54434-1_11 

Avni, G., Guha, S., &; Kupferman, O. (2017). An abstraction-refinement methodology for reasoning about network games (pp. 70–76). Presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia: AAAI Press.https://doi.org/10.24963/ijcai.2017/11 

Trinh, M., Chu, D. H., &; Jaffar, J. (2017). Model counting for recursively-defined strings. In R. Majumdar &; V. Kundak (Eds.) (Vol. 10427, pp. 399–418). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer.https://doi.org/10.1007/978-3-319-63390-9_21 

Le, X., Chu, D. H., Lo, D., Le Goues, C., &; Visser, W. (2017). : Syntax- and semantic-guided repair synthesis via programming by examples (Vol. 0154, pp. 593–604). Presented at the FSE: Foundations of Software Engineering, Paderborn, Germany: ACM.https://doi.org/10.1145/3106237.3106309 

Gottlob, G., Henzinger, T. A., &; Weißenbacher, G. (2017). Preface of the special issue in memoriam Helmut Veith. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-017-0307-6 

Finkbeiner, B., &; Kupriyanov, A. (2017). Causality-based model checking. In Electronic Proceedings in Theoretical Computer Science (Vol. 259, pp. 31–38). Uppsala, Sweden: Open Publishing Association.https://doi.org/10.4204/EPTCS.259.3 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2016.24 

Haas, A., Henzinger, T. A., Holzer, A., Kirsch, C., Lippautz, M., Payer, H.,https://doi.org/10.4230/LIPIcs.CONCUR.2016.6__Veith, H. (2016). Local linearizability for concurrent container-type data structures. In Leibniz International Proceedings in Informatics (Vol. 59). Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2016.6 

Gurung, A., Deka, A., Bartocci, E., Bogomolov, S., Grosu, R., &; Ray, R. (2016). Parallel reachability analysis for hybrid systems. Presented at the MEMOCODE: International Conference on Formal Methods and Models for System Design, Kanpur, India : IEEE.https://doi.org/10.1109/MEMCOD.2016.7797741 

Avni, G., Guha, S., &; Rodríguez Navas, G. (2016). Synthesizing time triggered schedules for switched networks with faulty links. In Proceedings of the 13th International Conference on Embedded Software . Pittsburgh, PA, USA: ACM.https://doi.org/10.1145/2968478.2968499 

Duggirala, P., Fan, C., Potok, M., Qi, B., Mitra, S., Viswanathan, M.,https://doi.org/10.1109/CCA.2016.7587948__Xiang, W. (2016). Tutorial: Software tools for hybrid systems verification transformation and synthesishttps://doi.org/10.1109/CCA.2016.7587948__HyST and TuLiP. In 2016 IEEE Conference on Control Applications. Buenos Aires, Argentina : IEEE.https://doi.org/10.1109/CCA.2016.7587948 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2016). Quantitative automata under probabilistic semantics. In Proceedings of the 31st Annual ACM/IEEE Symposium (pp. 76–85). New York, NY, USA: IEEE.https://doi.org/10.1145/2933575.2933588 

Kong, H., Bartocci, E., Bogomolov, S., Grosu, R., Henzinger, T. A., Jiang, Y., &; Schilling, C. (2016). Discrete abstraction of multiaffine systems (Vol. 9957, pp. 128–144). Presented at the HSB: Hybrid Systems Biology, Grenoble, France: Springer.https://doi.org/10.1007/978-3-319-47151-8_9 

Jiang, Y., Yang, Y., Liu, H., Kong, H., Gu, M., Sun, J., &; Sha, L. (2016). From stateflow simulation to verified implementation: A verification approach and a real-time train controller design. Presented at the RTAS: Real-time and Embedded Technology and Applications Symposium, Vienna, Austria: IEEE.https://doi.org/10.1109/RTAS.2016.7461337 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2016). Quantitative monitor automata (Vol. 9837, pp. 23–38). Presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-53413-7_2 

D’Antoni, L., Samanta, R., &; Singh, R. (2016). QLOSE: Program repair with quantitative objectives (Vol. 9780, pp. 383–401). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer.https://doi.org/10.1007/978-3-319-41540-6_21 

Bak, S., Bogomolov, S., Henzinger, T. A., Johnson, T., &; Prakash, P. (2016). Scalable static hybridization methods for analysis of nonlinear systems (pp. 155–164). Presented at the HSCC 2016: International Conference on Hybrid Systems: Computation and Control, Vienna, Austria: Springer.https://doi.org/10.1145/2883817.2883837 

Dragoi, C., Henzinger, T. A., &; Zufferey, D. (2016). PSYNC: A partially synchronous language for fault-tolerant distributed algorithms (Vol. 20–22, pp. 400–415). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM.https://doi.org/10.1145/2837614.2837650 

Beica, A., Guet, C. C., &; Petrov, T. (2016). Efficient reduction of kappa models by static inspection of the rule-set (Vol. 9271, pp. 173–191). Presented at the HSB: Hybrid Systems Biology, Madrid, Spain: Springer.https://doi.org/10.1007/978-3-319-26916-0_10 

Henzinger, T. A., Otop, J., &; Samanta, R. (2016). Lipschitz robustness of timed I/O systems (Vol. 9583, pp. 250–267). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, St. Petersburg, FL, USA: Springer.https://doi.org/10.1007/978-3-662-49122-5_12 

Schilling, C., Bogomolov, S., Henzinger, T. A., Podelski, A., &; Ruess, J. (2016). Adaptive moment closure for parameter inference of biochemical reaction networks. Biosystems. Elsevier.https://doi.org/10.1016/j.biosystems.2016.07.005 

Bogomolov, S., Donzé, A., Frehse, G., Grosu, R., Johnson, T., Ladan, H.,https://doi.org/10.1007/s10009-015-0393-y__Wehrle, M. (2016). Guided search for hybrid systems based on coarse-grained space abstractions. International Journal on Software Tools for Technology Transfer. Springer.https://doi.org/10.1007/s10009-015-0393-y 

Jiang, Y., Liu, H., Kong, H., Wang, R., Hosseini, M., Sun, J., &; Sha, L. (2016). Use runtime verification to improve the quality of medical care practice. In Proceedings of the 38th International Conference on Software Engineering Companion  (pp. 112–121). Austin, TX, USA: IEEE.https://doi.org/10.1145/2889160.2889233 

Chatterjee, K., Chmelik, M., &; Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp. 3225–3232). Phoenix, AZ, USA: AAAI Press.

Avni, G., Henzinger, T. A., &; Kupferman, O. (2016). Dynamic resource allocation games (Vol. 9928, pp. 153–166). Presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-53354-3_13 

Tarrach, T. (2016). Automatic synthesis of synchronisation primitives for concurrent programs. Institute of Science and Technology Austria.https://doi.org/10.15479/at:ista:1130 

Daca, P., Henzinger, T. A., Kretinsky, J., &; Petrov, T. (2016). Linear distances between Markov chains (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2016.20 

Daca, P., Henzinger, T. A., Kretinsky, J., &; Petrov, T. (2016). Faster statistical model checking for unbounded temporal properties (Vol. 9636, pp. 112–129). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Eindhoven, The Netherlands: Springer.https://doi.org/10.1007/978-3-662-49674-9_7 

Daca, P., Gupta, A., &; Henzinger, T. A. (2016). Abstraction-driven concolic testing (Vol. 9583, pp. 328–347). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, St. Petersburg, FL, USA: Springer.https://doi.org/10.1007/978-3-662-49122-5_16 

Daca, P., Henzinger, T. A., &; Kupriyanov, A. (2016). Array folds logic (Vol. 9780, pp. 230–248). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer.https://doi.org/10.1007/978-3-319-41540-6_13 

Jiang, Y., Liu, H., Song, H., Kong, H., Gu, M., Sun, J., &; Sha, L. (2016). Safety assured formal model driven design of the multifunction vehicle bus controller (Vol. 9995, pp. 757–763). Presented at the FM: International Symposium on Formal Methods, Limassol, Cyprus: Springer.https://doi.org/10.1007/978-3-319-48989-6_47 

Parise, F., Lygeros, J., &; Ruess, J. (2015). Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study. Frontiers in Environmental Science. Frontiers.https://doi.org/10.3389/fenvs.2015.00042 

Dragoi, C., Henzinger, T. A., &; Zufferey, D. (2015). The need for language support for fault-tolerant distributed systems. Presented at the SNAPL: Summit oN Advances in Programming Languages, Asilomar, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SNAPL.2015.90 

Kretinsky, J., Larsen, K., Laursen, S., &; Srba, J. (2015). Polynomial time decidability of weighted synchronization under partial observability (Vol. 42, pp. 142–154). Presented at the CONCUR: Concurrency Theory, Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2015.142 

Ruess, J. (2015). Minimal moment equations for stochastic models of biochemical reaction networks with partially finite state space. Journal of Chemical Physics. American Institute of Physics.https://doi.org/10.1063/1.4937937 

Ruess, J., Parise, F., Milias Argeitis, A., Khammash, M., &; Lygeros, J. (2015). Iterative experiment design guides the characterization of a light-inducible gene expression circuit. PNAS. National Academy of Sciences.https://doi.org/10.1073/pnas.1423947112 

Ray, R., Gurung, A., Das, B., Bartocci, E., Bogomolov, S., &; Grosu, R. (2015). XSpeed: Accelerating reachability analysis on multi-core processors. Presented at the HVC: Haifa Verification Conference, Haifa, Israel: Springer.https://doi.org/10.1007/978-3-319-26287-1_1 

Forejt, V., Krdál, J., &; Kretinsky, J. (2015). Controller synthesis for MDPs and frequency LTL\'47U (Vol. 9450, pp. 162–177). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Suva, Fiji: Springer.https://doi.org/10.1007/978-3-662-48899-7_12 

Babiak, T., Blahoudek, F., Duret Lutz, A., Klein, J., Kretinsky, J., Mueller, D.,https://doi.org/10.1007/978-3-319-21690-4_31__Strejdek, J. (2015). The Hanoi omega-automata format (Vol. 9206, pp. 479–486). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer.https://doi.org/10.1007/978-3-319-21690-4_31 

Bogomolov, S., Schilling, C., Bartocci, E., Batt, G., Kong, H., &; Grosu, R. (2015). Abstraction-based parameter synthesis for multiaffine systems (Vol. 9434, pp. 19–35). Presented at the HVC: Haifa Verification Conference, Haifa, Israel: Springer.https://doi.org/10.1007/978-3-319-26287-1_2 

Nguyen, L., Schilling, C., Bogomolov, S., &; Johnson, T. (2015). Runtime verification for hybrid analysis tools. In 6th International Conference (Vol. 9333, pp. 281–286). Vienna, Austria: Springer Nature.https://doi.org/10.1007/978-3-319-23820-3_19 

Bogomolov, S., Henzinger, T. A., Podelski, A., Ruess, J., &; Schilling, C. (2015). Adaptive moment closure for parameter inference of biochemical reaction networks. Presented at the CMSB: Computational Methods in Systems Biology, Nantes, France: Springer.https://doi.org/10.1007/978-3-319-23401-4_8 

Bogomolov, S., Magazzeni, D., Minopoli, S., &; Wehrle, M. (2015). PDDL+ planning with hybrid automata: Foundations of translating must behavior (pp. 42–46). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Jerusalem, Israel: AAAI Press.

Michaliszyn, J., Otop, J., &; Kieroski, E. (2015). On the decidability of elementary modal logics. ACM Transactions on Computational Logic. ACM.https://doi.org/10.1145/2817825 

Frehse, G., Bogomolov, S., Greitschus, M., Strump, T., &; Podelski, A. (2015). Eliminating spurious transitions in reachability with support functions. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 149–158). Seattle, WA, United States: ACM.https://doi.org/10.1145/2728606.2728622 

Bak, S., Bogomolov, S., &; Johnson, T. (2015). HYST: A source transformation and translation tool for hybrid automaton models (pp. 128–133). Presented at the HSCC: Hybrid Systems - Computation and Control, Seattle, WA, United States: Springer.https://doi.org/10.1145/2728606.2728630 

Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., &; Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.03.001 

Gupta, A., &; Henzinger, T. A. (2015). Guest editors’ introduction to special issue on computational methods in systems biology. ACM Transactions on Modeling and Computer Simulation. ACM.https://doi.org/10.1145/2745799 

Cerny, P., Henzinger, T. A., Kovács, L., Radhakrishna, A., &; Zwirchmayr, J. (2015). Segment abstraction for worst-case execution time analysis. Presented at the ESOP: European Symposium on Programming, London, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-46669-8_5 

Benes, N., Kretinsky, J., Larsen, K., Möller, M., Sickert, S., &; Srba, J. (2015). Refinement checking on parametric modal transition systems. Acta Informatica. Springer.https://doi.org/10.1007/s00236-015-0215-4 

Geiger, B., Petrov, T., Kubin, G., &; Koeppl, H. (2015). Optimal Kullback-Leibler aggregation via information bottleneck. IEEE Transactions on Automatic Control. IEEE.https://doi.org/10.1109/TAC.2014.2364971 

Ruess, J., &; Lygeros, J. (2015). Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. ACM Transactions on Modeling and Computer Simulation. ACM.https://doi.org/10.1145/2688906 

Henzinger, T. A., &; Raskin, J. (2015). The equivalence problem for finite automata: Technical perspective. Communications of the ACM. ACM.https://doi.org/10.1145/2701001 

Fahrenberg, U., Kretinsky, J., Legay, A., &; Traonouez, L. (2015). Compositionality for quantitative specifications (Vol. 8997, pp. 306–324). Presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy: Springer.https://doi.org/10.1007/978-3-319-15317-9_19 

Gupta, A., Henzinger, T. A., Radhakrishna, A., Samanta, R., &; Tarrach, T. (2015). Succinct representation of concurrent trace sets (pp. 433–444). Presented at the POPL: Principles of Programming Languages, Mumbai, India: ACM.https://doi.org/10.1145/2676726.2677008 

Chakraborty, S., Henzinger, T. A., Sezgin, A., &; Vafeiadis, V. (2015). Aspect-oriented linearizability proofs. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-11(1:20)2015 

Chatterjee, K., Doyen, L., Gimbert, H., &; Henzinger, T. A. (2015). Randomness for free. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.06.003 

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. ACM.https://doi.org/10.1145/2699430 

Chatterjee, K., Komárková, Z., &; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.32 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2015). Nested weighted automata. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.72 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2015). Nested weighted automata. IST Austria.https://doi.org/10.15479/AT:IST-2015-170-v2-2 

Boker, U., Henzinger, T. A., &; Otop, J. (2015). The target discounted-sum problem. In LICS (pp. 750–761). Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.74 

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &; Otop, J. (2015). Edit distance for pushdown automata. In 42nd International Colloquium (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature.https://doi.org/10.1007/978-3-662-47666-6_10 

Boker, U., Henzinger, T. A., &; Otop, J. (2015). The target discounted-sum problem. IST Austria.https://doi.org/10.15479/AT:IST-2015-335-v1-1 

Benes, N., Daca, P., Henzinger, T. A., Kretinsky, J., &; Nickovic, D. (2015). Complete composition operators for IOCO-testing theory (pp. 101–110). Presented at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada: ACM.https://doi.org/10.1145/2737166.2737175 

Chatterjee, K., Chmelik, M., &; Daca, P. (2015). CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-015-0235-2 

Svoreová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cbrná, I., &; Belta, C. (2015). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 259–268). Seattle, WA, United States: ACM.https://doi.org/10.1145/2728606.2728608 

Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., &; Tarrach, T. (2015). From non-preemptive to preemptive scheduling using synchronization synthesis. Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer.https://doi.org/10.1007/978-3-319-21668-3_11 

Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., &; Petrov, T. (2015). Model checking gene regulatory networks. Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, London, United Kingdom: Springer.https://doi.org/10.1007/978-3-662-46681-0_47 

Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., &; Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer.https://doi.org/10.1007/978-3-319-21690-4_10 

Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:28 

Dragoi, C., Henzinger, T. A., Veith, H., Widder, J., &; Zufferey, D. (2014). A logic-based framework for verifying consensus algorithms (Vol. 8318, pp. 161–181). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, San Diego, USA: Springer.https://doi.org/10.1007/978-3-642-54013-4_10 

Gordon, A., Henzinger, T. A., Nori, A., &; Rajamani, S. (2014). Probabilistic programming. In Proceedings of the on Future of Software Engineering (pp. 167–181). Hyderabad, India: ACM.https://doi.org/10.1145/2593882.2593900 

Gupta, A., Popeea, C., &; Rybalchenko, A. (2014). Generalised interpolation by solving recursion free-horn clauses. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 169, pp. 31–38). Vienna, Austria: Open Publishing.https://doi.org/10.4204/EPTCS.169.5 

Hofferek, G., &; Gupta, A. (2014). Suraq - a controller synthesis tool using uninterpreted functions. In E. Yahav (Ed.), HVC 2014 (Vol. 8855, pp. 68–74). Haifa, Israel: Springer.https://doi.org/10.1007/978-3-319-13338-6_6 

Gupta, A., Kovács, L., Kragl, B., &; Voronkov, A. (2014). Extensional crisis and proving identity. In F. Cassez &; J.-F. Raskin (Eds.), ATVA 2014 (Vol. 8837, pp. 185–200). Sydney, Australia: Springer.https://doi.org/10.1007/978-3-319-11936-6_14 

Henzinger, T. A., Otop, J., &; Samanta, R. (2014). Lipschitz robustness of finite-state transducers. In Leibniz International Proceedings in Informatics, LIPIcs (Vol. 29, pp. 431–443). Delhi, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2014.431 

Samanta, R., Olivo, O., &; Allen, E. (2014). Cost-aware automatic program repair. In M. Müller-Olm &; H. Seidl (Eds.) (Vol. 8723, pp. 268–284). Presented at the SAS: Static Analysis Symposium, Munich, Germany: Springer.https://doi.org/10.1007/978-3-319-10936-7_17 

Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M.,https://doi.org/10.1007/978-3-319-11936-6_8__Ujma, M. (2014). Verification of markov decision processes using learning algorithms. In F. Cassez &; J.-F. Raskin (Eds.), https://doi.org/10.1007/978-3-319-11936-6_8__Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8837, pp. 98–114). Sydney, Australia: Society of Industrial and Applied Mathematics.https://doi.org/10.1007/978-3-319-11936-6_8 

Komárková, Z., &; Kretinsky, J. (2014). Rabinizer 3: Safraless translation of ltl to small deterministic automata. In F. Cassez &; J.-F. Raskin (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8837, pp. 235–241). Sydney, Australia: Springer.https://doi.org/10.1007/978-3-319-11936-6_17 

Hermanns, H., Krdál, J., &; Kretinsky, J. (2014). Probabilistic bisimulation: Naturally on distributions. In P. Baldan &; D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 249–265). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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. Springer.https://doi.org/10.1007/s00285-013-0738-7 

Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B.,https://doi.org/10.1007/s00236-013-0191-5__Könighofer, R. (2014). Synthesizing robust systems. Acta Informatica. Springer.https://doi.org/10.1007/s00236-013-0191-5 

Esparza, J., &; Kretinsky, J. (2014). From LTL to deterministic automata: A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the CAV: Computer Aided Verification, Springer.https://doi.org/10.1007/978-3-319-08867-9_13 

Boker, U., &; Henzinger, T. A. (2014). Exact and approximate determinization of discounted-sum automata. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-10(1:10)2014 

Boker, U., Henzinger, T. A., &; Radhakrishna, A. (2014). Battery transition systems (Vol. 49, pp. 595–606). Presented at the POPL: Principles of Programming Languages, San Diego, USA: ACM.https://doi.org/10.1145/2535838.2535875 

Cerny, P., Chmelik, M., Henzinger, T. A., &; Radhakrishna, A. (2014). Interface simulation distances. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2014.08.019 

Boker, U., Chatterjee, K., Henzinger, T. A., &; Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/2629686 

Daca, P., Henzinger, T. A., Krenn, W., &; Nickovic, D. (2014). Compositional specifications for IOCO testing. IST Austria.https://doi.org/10.15479/AT:IST-2014-148-v2-1 

Henzinger, T. A., &; Otop, J. (2014). Model measuring for hybrid systems. In Proceedings of the 17th international conference on Hybrid systems: computation and control (pp. 213–222). Berlin, Germany: Springer.https://doi.org/10.1145/2562059.2562130 

Henzinger, T. A., &; Otop, J. (2014). From model checking to model measuring. IST Austria.https://doi.org/10.15479/AT:IST-2014-172-v1-1 

Henzinger, T. A., &; Otop, J. (2014). Model measuring for hybrid systems. IST Austria.https://doi.org/10.15479/AT:IST-2014-171-v1-1 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2014). Nested weighted automata. IST Austria.https://doi.org/10.15479/AT:IST-2014-170-v1-1 

Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., &; Tarrach, T. (2014). Regression-free synthesis for concurrency (Vol. 8559, pp. 568–584). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer.https://doi.org/10.1007/978-3-319-08867-9_38 

Daca, P., Henzinger, T. A., Krenn, W., &; Nickovic, D. (2014). Compositional specifications for IOCO testing. In IEEE 7th International Conference on Software Testing, Verification and Validation. Cleveland, USA: IEEE.https://doi.org/10.1109/ICST.2014.50 

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 

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 

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 

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 

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 

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 

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 

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 

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 

Henzinger, T. A. (2013). Quantitative reactive modeling and verification. Computer Science Research and Development. Springer.https://doi.org/10.1007/s00450-013-0251-7 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

Zufferey, D. (2013). Analysis of dynamic message passing programs. Institute of Science and Technology Austria.https://doi.org/10.15479/at:ista:1405 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

Henzinger, T. A., &; Nickovic, D. (2012). Independent implementability of viewpoints. In https://doi.org/10.1007/978-3-642-34059-8_20__Conference proceedings Monterey Workshop 2012 (Vol. 7539, pp. 380–395). Oxford, UK: Springer.https://doi.org/10.1007/978-3-642-34059-8_20 

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 

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 

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 

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 

Chatterjee, K., &; Henzinger, T. A. (2012). A survey of stochastic <9 regular games. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2011.05.002 

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 

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 

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 

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 

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 

Cerny, P., Henzinger, T. A., &; Radhakrishna, A. (2012). Simulation distances. Theoretical Computer Science. Elsevier.https://doi.org/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. 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 

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 

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 

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 

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 

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.

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.

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 

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 

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 

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 

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 

Fisher, J., Harel, D., &; Henzinger, T. A. (2011). Biology as reactivity. Communications of the ACM. ACM.https://doi.org/10.1145/2001269.2001289 

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 

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 

Chatterjee, K., Henzinger, T. A., &; Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.

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 

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 

Almagor, S., Boker, U., &; Kupferman, O. (2011). What’s decidable about weighted automatahttps://doi.org/10.1007/978-3-642-24372-1_37__(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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 , Wrocaw, Poland: Springer.https://doi.org/10.1007/978-3-642-22438-6_36 

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 

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 

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.

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

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 

Chatterjee, K., Henzinger, T. A., &; Piterman, N. (2010). Strategy logic. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2009.07.004 

Singh, V. (2010). Runtime verification for software transactional memories. In O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner,https://doi.org/10.1007/978-3-642-16612-9_32__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 

Kuncak, V., Piskac, R., Suter, P., &; Wies, T. (2010). Building a calculus of data structures. In G. Barthe &; M. Hermenegildo (Eds.) (Vol. 5944, pp. 26–44). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain: Springer.https://doi.org/10.1007/978-3-642-11319-2_6 

Henzinger, T. A., Tomar, A., Singh, V., Wies, T., &; Zufferey, D. (2010). FlexPRICE: Flexible provisioning of resources in a cloud environment (pp. 83–90). Presented at the CLOUD: Cloud Computing, Miami, USA: IEEE.https://doi.org/10.1109/CLOUD.2010.71 

Guerraoui, R., Henzinger, T. A., Kapalka, M., &; Singh, V. (2010). Transactions in the jungle (pp. 263–272). Presented at the SPAA: ACM Symposium on Parallel Algorithms and Architectures, Santorini, Greece: ACM.https://doi.org/10.1145/1810479.1810529 

Henzinger, T. A., Tomar, A., Singh, V., Wies, T., &; Zufferey, D. (2010). A marketplace for cloud resources (pp. 1–8). Presented at the EMSOFT: Embedded Software , Arizona, USA: ACM.https://doi.org/10.1145/1879021.1879022 

Doyen, L., Henzinger, T. A., Legay, A., &; Nickovic, D. (2010). Robustness of sequential circuits (pp. 77–84). Presented at the ACSD: Application of Concurrency to System Design, IEEE.https://doi.org/10.1109/ACSD.2010.26 

Cerny, P., Henzinger, T. A., &; Radhakrishna, A. (2010). Quantitative Simulation Games. In Z. Manna &; D. Peled (Eds.), Time For Verification: Essays in Memory of Amir Pnueli (Vol. 6200, pp. 42–60). Springer.https://doi.org/10.1007/978-3-642-13754-9_3 

Beyer, D., Henzinger, T. A., Théoduloz, G., &; Zufferey, D. (2010). Shape refinement through explicit heap analysis. In D. Rosenblum &; G. Taenzer (Eds.) (Vol. 6013, pp. 263–277). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer.https://doi.org/10.1007/978-3-642-12029-9_19 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-6(3:10)2010 

Alur, R., &; Cerny, P. (2010). Expressiveness of streaming string transducers (Vol. 8, pp. 1–12). 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.1 

Hoenicke, J., Leino, K., Podelski, A., Schäf, M., &; Wies, T. (2010). Doomed program points. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-010-0102-0 

Cerny, P., Henzinger, T. A., &; Radhakrishna, A. (2010). Simulation distances (Vol. 6269, pp. 235–268). 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_18 

Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., &; Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria.https://doi.org/10.15479/AT:IST-2010-0004 

Cerny, P., Henzinger, T. A., &; Radhakrishna, A. (2010). Simulation distances. IST Austria.https://doi.org/10.15479/AT:IST-2010-0003 

Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., &; Alur, R. (2010). Model checking of linearizability of concurrent list implementations (Vol. 6174, pp. 465–479). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer.https://doi.org/10.1007/978-3-642-14295-6_41 

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Radhakrishna, A. (2010). GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer.https://doi.org/10.1007/978-3-642-14295-6_57 

Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., &; Alur, R. (2010). Model checking of linearizability of concurrent list implementations. IST Austria.https://doi.org/10.15479/AT:IST-2010-0001 

Chatterjee, K., &; Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer.https://doi.org/10.1007/978-3-642-15643-4_1 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-15155-2_24 

Wies, T., Zufferey, D., &; Henzinger, T. A. (2010). Forward analysis of depth-bounded processes. In L. Ong (Ed.) (Vol. 6014, pp. 94–108). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus: Springer.https://doi.org/10.1007/978-3-642-12032-9_8 

Didier, F., Henzinger, T. A., Mateescu, M., &; Wolf, V. (2009). Fast adaptive uniformization of the chemical master equation (Vol. 4, pp. 118–127). Presented at the HIBI: High-Performance Computational Systems Biology, Trento, Italy: IEEE.https://doi.org/10.1109/HiBi.2009.23 

Henzinger, T. A., Jobstmann, B., &; Wolf, V. (2009). Formalisms for specifying Markovian population models (Vol. 5797, pp. 3–23). Presented at the RP: Reachability Problems, Palaiseau, France: Springer.https://doi.org/10.1007/978-3-642-04420-5_2 

Henzinger, T. A., Kirsch, C., Marques, E., &; Sokolova, A. (2009). Distributed, modular HTL (pp. 171–180). Presented at the RTSS: Real-Time Systems Symposium, Washington, DC, United States: IEEE.https://doi.org/10.1109/RTSS.2009.9 

Tripakis, S., Lickly, B., Henzinger, T. A., &; Lee, E. (2009). On relational interfaces. In EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded software (pp. 67–76). Grenoble, France: ACM.https://doi.org/10.1145/1629335.1629346 

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Radhakrishna, A. (2009). Gist: A solver for probabilistic games. IST Austria.https://doi.org/10.15479/AT:IST-2009-0003 

Chatterjee, K., Henzinger, T. A., &; Horn, F. (2009). Improved lower bounds for request-response and finitary Streett games. IST Austria.https://doi.org/10.15479/AT:IST-2009-0002 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2009). Qualitative analysis of partially-observable Markov decision processes. IST Austria.https://doi.org/10.15479/AT:IST-2009-0001