Trinh, Giang, et al. “Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming.”10.1609/aaai.v38i9.28943__Proceedings of the 38th AAAI Conference on Artificial Intelligence, vol. 38, no. 9, Association for the Advancement of Artificial Intelligence, 2024, pp. 10714–22, doi:10.1609/aaai.v38i9.28943.

Chalupa, Marek, and Cedric Richter. “Bubaak-SpLit: Split What You Cannot Verify (Competition Contribution).”10.1007/978-3-031-57256-2_20__30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 14572, Springer Nature, 2024, pp. 353–358, doi:10.1007/978-3-031-57256-2_20.

Chalupa, Marek, and Thomas A. Henzinger. “Bubaak: Runtime Monitoring of Program Verifiers.”10.1007/978-3-031-30820-8_32__Tools and Algorithms for the Construction and Analysis of Systems, vol. 13994, Springer Nature, 2023, pp. 535–40, doi:10.1007/978-3-031-30820-8_32.

Chalupa, Marek, et al. “Vamos: Middleware for Best-Effort Third-Party Monitoring.”10.1007/978-3-031-30826-0_15__Fundamental Approaches to Software Engineering, vol. 13991, Springer Nature, 2023, pp. 260–81, doi:10.1007/978-3-031-30826-0_15.

Chalupa, Marek, et al. VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:12407.

Chatterjee, Krishnendu, et al. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.”10.1007/978-3-031-30823-9_1__Tools and Algorithms for the Construction and Analysis of Systems , vol. 13993, Springer Nature, 2023, pp. 3–25, doi:10.1007/978-3-031-30823-9_1.

Anand, Ashwani, et al. “Computing Adequately Permissive Assumptions for Synthesis.”10.1007/978-3-031-30820-8_15__TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, vol. 13994, Springer Nature, 2023, pp. 211–28, doi:10.1007/978-3-031-30820-8_15.

Henzinger, Thomas A., et al. “Quantitative Safety and Liveness.”10.1007/978-3-031-30829-1_17__26th International Conference Foundations of Software Science and Computation Structures, vol. 13992, Springer Nature, 2023, pp. 349–70, doi:10.1007/978-3-031-30829-1_17.

Henzinger, Thomas A., et al. “Regular Methods for Operator Precedence Languages.”10.4230/LIPIcs.ICALP.2023.129__50th International Colloquium on Automata, Languages, and Programming, vol. 261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20, doi:10.4230/LIPIcs.ICALP.2023.129.

Lechner, Mathias, et al. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.”10.1109/LRA.2023.3240930__IEEE Robotics and Automation Letters, vol. 8, no. 3, Institute of Electrical and Electronics Engineers, 2023, pp. 1595–602, doi:10.1109/LRA.2023.3240930.

Benes, Nikola, et al. “Boolean Network Sketches: A Unifying Framework for Logical Model Inference.”10.1093/bioinformatics/btad158__Bioinformatics, vol. 39, no. 4, btad158, Oxford Academic, 2023, doi:10.1093/bioinformatics/btad158.

Lechner, Mathias, et al. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.”10.1609/aaai.v37i12.26747__Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 12, Association for the Advancement of Artificial Intelligence, 2023, pp. 14964–73, doi:10.1609/aaai.v37i12.26747.

Avni, Guy, et al. “Bidding Graph Games with Partially-Observable Budgets.”10.1609/aaai.v37i5.25679__Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 5, 2023, pp. 5464–71, doi:10.1609/aaai.v37i5.25679.

Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness.”10.1007/978-3-031-37703-7_17__Computer Aided Verification, vol. 13965, Springer Nature, 2023, pp. 358–382, doi:10.1007/978-3-031-37703-7_17.

Boker, Udi, et al. “Safety and Liveness of Quantitative Automata.”10.4230/LIPIcs.CONCUR.2023.17__34th International Conference on Concurrency Theory, vol. 279, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.CONCUR.2023.17.

Bartocci, Ezio, et al. “Hypernode Automata.”10.4230/LIPIcs.CONCUR.2023.21__34th International Conference on Concurrency Theory, vol. 279, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.CONCUR.2023.21.

Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness under Partial Observations.”10.1007/978-3-031-44267-4_15__23rd International Conference on Runtime Verification, vol. 14245, Springer Nature, 2023, pp. 291–311, doi:10.1007/978-3-031-44267-4_15.

Avni, Guy, et al. “Reachability Poorman Discrete-Bidding Games.”10.3233/FAIA230264__Frontiers in Artificial Intelligence and Applications, vol. 372, IOS Press, 2023, pp. 141–48, doi:10.3233/FAIA230264.

Ansaripour, Matin, et al. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.”10.1007/978-3-031-45329-8_17__21st International Symposium on Automated Technology for Verification and Analysis, vol. 14215, Springer Nature, 2023, pp. 357–79, doi:10.1007/978-3-031-45329-8_17.

Trinh, Van Giang, et al. “Trap Spaces of Multi-Valued Networks: Definition, Computation, and Applications.”10.1093/bioinformatics/btad262__Bioinformatics, vol. 39, no. Supplement_1, Oxford Academic, 2023, pp. i513–22, doi:10.1093/bioinformatics/btad262.

Majumdar, Rupak, et al. “Symbolic Control for Stochastic Systems via Finite Parity Games.”10.1016/j.nahs.2023.101430__Nonlinear Analysis: Hybrid Systems, vol. 51, 101430, Elsevier, 2023, doi:10.1016/j.nahs.2023.101430.

Pastva, Samuel, and Thomas A. Henzinger. “Binary Decision Diagrams on Modern Hardware.”10.34727/2023/isbn.978-3-85448-060-0_20__Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design, TU Vienna Academic Press, 2023, pp. 122–31, doi:10.34727/2023/isbn.978-3-85448-060-0_20.

Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.”10.1609/aaai.v37i10.26407__Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 10, Association for the Advancement of Artificial Intelligence, 2023, pp. 11926–35, doi:10.1609/aaai.v37i10.26407.

Kueffner, Konstantin, et al. “Into the Unknown: Active Monitoring of Neural Networks (Extended Version).”10.1007/s10009-023-00711-4__International Journal on Software Tools for Technology Transfer, vol. 25, Springer Nature, 2023, pp. 575–92, doi:10.1007/s10009-023-00711-4.

Banerjee, Tamajit, et al. “Fast Symbolic Algorithms for Mega-Regular Games under Strong Transition Fairness.”10.46298/theoretics.23.4__TheoretiCS, vol. 2, 4, EPI Sciences, 2023, doi:10.46298/theoretics.23.4.

Benes, Nikola, et al. “Phenotype Control of Partially Specified Boolean Networks.”10.1007/978-3-031-42697-1_2__21st International Conference on Computational Methods in Systems Biology, vol. 14137, Springer Nature, 2023, pp. 18–35, doi:10.1007/978-3-031-42697-1_2.

Majumdar, Rupak, et al. “A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties.”10.1007/978-3-031-37709-9_1__35th International Conference on Computer Aided Verification, vol. 13966, Springer Nature, 2023, pp. 3–15, doi:10.1007/978-3-031-37709-9_1.

Majumdar, Rupak, et al. A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties. Zenodo, 2023, doi:10.5281/ZENODO.7877790.

Zikelic, Dorde, et al. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” 37th Conference on Neural Information Processing Systems, 2023.

Chalupa, Marek, and Thomas A. Henzinger. “Monitoring Hyperproperties with Prefix Transducers.”10.1007/978-3-031-44267-4_9__23nd International Conference on Runtime Verification, vol. 14245, Springer Nature, 2023, pp. 168–90, doi:10.1007/978-3-031-44267-4_9.

Chalupa, Marek, and Thomas A. Henzinger. Monitoring Hyperproperties with Prefix Transducers. Zenodo, 2023, doi:10.5281/ZENODO.8191723.

Henzinger, Thomas A., et al. “Runtime Monitoring of Dynamic Fairness Properties.”10.1145/3593013.3594028__FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, Association for Computing Machinery, 2023, pp. 604–14, doi:10.1145/3593013.3594028.

Bartocci, Ezio, et al. “Flavors of Sequential Information Flow.”10.1007/978-3-030-94583-1_1__Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13182, Springer Nature, 2022, pp. 1–19, doi:10.1007/978-3-030-94583-1_1.

Brunnbauer, Axel, et al. “Latent Imagination Facilitates Zero-Shot Transfer in Autonomous Racing.”10.1109/ICRA46639.2022.9811650__2022 International Conference on Robotics and Automation, IEEE, 2022, pp. 7513–20, doi:10.1109/ICRA46639.2022.9811650.

Garcia Soto, Miriam, et al. “Synthesis of Parametric Hybrid Automata from Time Series.”10.1007/978-3-031-19992-9_22__20th International Symposium on Automated Technology for Verification and Analysis, vol. 13505, Springer Nature, 2022, pp. 337–53, doi:10.1007/978-3-031-19992-9_22.

Henzinger, Thomas A., et al. “History-Deterministic Timed Automata.”10.4230/LIPIcs.CONCUR.2022.14__33rd International Conference on Concurrency Theory, vol. 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21, doi:10.4230/LIPIcs.CONCUR.2022.14.

Avni, Guy, and Thomas A. Henzinger. “An Updated Survey of Bidding Games on Graphs.”10.4230/LIPIcs.MFCS.2022.3__47th International Symposium on Mathematical Foundations of Computer Science, vol. 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 3:1-3:6, doi:10.4230/LIPIcs.MFCS.2022.3.

Lechner, Mathias, et al. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.”10.48550/arXiv.2204.07373__ArXiv, 2204.07373, doi:10.48550/arXiv.2204.07373.

Henzinger, Thomas A. “Quantitative Monitoring of Software.”10.1007/978-3-030-95561-8_1__Software Verification, vol. 13124, Springer Nature, 2022, pp. 3–6, doi:10.1007/978-3-030-95561-8_1.

Bartocci, Ezio, et al. “Information-Flow Interfaces.”10.1007/978-3-030-99429-7_1__Fundamental Approaches to Software Engineering, vol. 13241, Springer Nature, 2022, pp. 3–22, doi:10.1007/978-3-030-99429-7_1.

Henzinger, Thomas A., et al. “Abstract Monitors for Quantitative Specifications.”10.1007/978-3-031-17196-3_11__22nd International Conference on Runtime Verification, vol. 13498, Springer Nature, 2022, pp. 200–20, doi:10.1007/978-3-031-17196-3_11.

Hasani, Ramin, et al. “Closed-Form Continuous-Time Neural Networks.”10.1038/s42256-022-00556-7__Nature Machine Intelligence, vol. 4, no. 11, Springer Nature, 2022, pp. 992–1003, doi:10.1038/s42256-022-00556-7.

Lechner, Mathias. Learning Verifiable Representations. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:11362.

Doveri, Kyveli, et al. “FORQ-Based Language Inclusion Formal Testing.”10.1007/978-3-031-13188-2_6__Computer Aided Verification, vol. 13372, Springer Nature, 2022, pp. 109–29, doi:10.1007/978-3-031-13188-2_6.

Bose, Sougata, et al. “History-Deterministic Timed Automata Are Not Determinizable.”10.1007/978-3-031-19135-0_5__16th International Conference on Reachability Problems, vol. 13608, Springer Nature, 2022, pp. 67–76, doi:10.1007/978-3-031-19135-0_5.

Gruenbacher, Sophie A., et al. “GoTube: Scalable Statistical Verification of Continuous-Depth Models.”10.1609/aaai.v36i6.20631__Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 6, Association for the Advancement of Artificial Intelligence, 2022, pp. 6755–64, doi:10.1609/aaai.v36i6.20631.

Lechner, Mathias, et al. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.”10.1609/aaai.v36i7.20695__Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7, Association for the Advancement of Artificial Intelligence, 2022, pp. 7326–36, doi:10.1609/aaai.v36i7.20695.

Zikelic, Dorde, et al. “Learning Stabilizing Policies in Stochastic Control Systems.”10.48550/arXiv.2205.11991__ArXiv, doi:10.48550/arXiv.2205.11991.

Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.”10.48550/ARXIV.2210.05308__ArXiv, doi:10.48550/ARXIV.2210.05308.

Mühlböck, Fabian, and Ross Tate. “Transitioning from Structural to Nominal Code with Efficient Gradual Typing.”10.1145/3485504__Proceedings of the ACM on Programming Languages, vol. 5, 127, Association for Computing Machinery, 2021, doi:10.1145/3485504.

Grunbacher, Sophie, et al. “On the Verification of Neural ODEs with Stochastic Guarantees.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 13, AAAI Press, 2021, pp. 11525–35.

Hasani, Ramin, et al. “Liquid Time-Constant Networks.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 9, AAAI Press, 2021, pp. 7657–66.

Babaiee, Zahra, et al. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” Proceedings of the 38th International Conference on Machine Learning, vol. 139, ML Research Press, 2021, pp. 478–89.

Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.” 35th Conference on Neural Information Processing Systems, 2021.

Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.”10.34727/2021/isbn.978-3-85448-046-4_23__Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, edited by Piskac Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152, doi:10.34727/2021/isbn.978-3-85448-046-4_23.

Dubach, Guillaume, and Fabian Mühlböck. “Formal Verification of Zagier’s One-Sentence Proof.”10.48550/arXiv.2103.11389__ArXiv, 2103.11389, doi:10.48550/arXiv.2103.11389.

Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 5A, AAAI Press, 2021, pp. 3787–95.

Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.”10.48550/arXiv.2111.03165__35th Conference on Neural Information Processing Systems, 2021, doi:10.48550/arXiv.2111.03165.

Sarac, Naci E., et al. “Boosting Expensive Synchronizing Heuristics.”10.1016/j.eswa.2020.114203__Expert Systems with Applications, vol. 167, no. 4, 114203, Elsevier, 2021, doi:10.1016/j.eswa.2020.114203.

Garcia Soto, Miriam, et al. “Synthesis of Hybrid Automata with Affine Dynamics from Time-Series Data.”10.1145/3447928.3456704__HSCC ’21: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control, Association for Computing Machinery, 2021, p. 2102.12734, doi:10.1145/3447928.3456704.

Avni, Guy, et al. “Bidding Mechanisms in Graph Games.”10.1016/j.jcss.2021.02.008__Journal of Computer and System Sciences, vol. 119, no. 8, Elsevier, 2021, pp. 133–44, doi:10.1016/j.jcss.2021.02.008.

Henzinger, Thomas A., and Naci E. Sarac. “Quantitative and Approximate Monitoring.”10.1109/LICS52264.2021.9470547__Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 9470547, Institute of Electrical and Electronics Engineers, 2021, doi:10.1109/LICS52264.2021.9470547.

Petrov, Tatjana, et al. “Long Lived Transients in Gene Regulation.”10.1016/j.tcs.2021.05.023__Theoretical Computer Science, vol. 893, Elsevier, 2021, pp. 1–16, doi:10.1016/j.tcs.2021.05.023.

Mühlböck, Fabian, and Thomas A. Henzinger. “Differential Monitoring.”10.1007/978-3-030-88494-9_12__International Conference on Runtime Verification, vol. 12974, Springer Nature, 2021, pp. 231–43, doi:10.1007/978-3-030-88494-9_12.

Mühlböck, Fabian, and Thomas A. Henzinger. Differential Monitoring. IST Austria, 2021, doi:10.15479/AT:ISTA:9946.

Sietzen, Stefan, et al. “Interactive Analysis of CNN Robustness.”10.1111/cgf.14418__Computer Graphics Forum, vol. 40, no. 7, Wiley, 2021, pp. 253–64, doi:10.1111/cgf.14418.

Aghajohari, Milad, et al. “Determinacy in Discrete-Bidding Infinite-Duration Games.”10.23638/LMCS-17(1:10)2021__Logical Methods in Computer Science, vol. 17, no. 1, International Federation for Computational Logic, 2021, p. 10:1-10:23, doi:10.23638/LMCS-17(1:10)2021.

Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.”10.1109/ICRA48506.2021.9561036__2021 IEEE International Conference on Robotics and Automation, 2021, pp. 4140–47, doi:10.1109/ICRA48506.2021.9561036.

Lukina, Anna, et al. “Into the Unknown: Active Monitoring of Neural Networks.”10.1007/978-3-030-88494-9_3__21st International Conference on Runtime Verification, vol. 12974, Springer Nature, 2021, pp. 42–61, doi:10.1007/978-3-030-88494-9_3.

Hasani, Ramin, et al. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–93.

Ferrere, Thomas, et al. “Monitoring Event Frequencies.”10.4230/LIPIcs.CSL.2020.20__28th EACSL Annual Conference on Computer Science Logic, vol. 152, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CSL.2020.20.

Althoff, Matthias, et al. “ARCH-COM Category Report: Continuous and Hybrid Systems with Linear Dynamics.”10.29007/7dt2__EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 16–48, doi:10.29007/7dt2.

Geretti, Luca, et al. “ARCH-COM Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.”10.29007/zkf6__EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 49–75, doi:10.29007/zkf6.

Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.”10.4230/LIPIcs.CONCUR.2020.23__31st International Conference on Concurrency Theory, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.23.

Avni, Guy, and Thomas A. Henzinger. “A Survey of Bidding Games on Graphs.”10.4230/LIPIcs.CONCUR.2020.2__31st International Conference on Concurrency Theory, vol. 171, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.2.

Alamdari, Par Alizadeh, et al. “Formal Methods with a Touch of Magic.”10.34727/2020/isbn.978-3-85448-042-6_21__Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–47, doi:10.34727/2020/isbn.978-3-85448-042-6_21.

Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 18098–109.

Gruenbacher, Sophie, et al. “Lagrangian Reachtubes: The next Generation.”10.1109/CDC42340.2020.9304042__Proceedings of the 59th IEEE Conference on Decision and Control, vol. 2020, IEEE, 2020, pp. 1556–63, doi:10.1109/CDC42340.2020.9304042.

Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” 8th International Conference on Learning Representations, ICLR, 2020.

Giacobbe, Mirco, et al. “How Many Bits Does It Take to Quantize Your Neural Network?”10.1007/978-3-030-45237-7_5__International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 12079, Springer Nature, 2020, pp. 79–97, doi:10.1007/978-3-030-45237-7_5.

Avni, Guy, et al. “Dynamic Resource Allocation Games.”10.1016/j.tcs.2019.06.031__Theoretical Computer Science, vol. 807, Elsevier, 2020, pp. 42–55, doi:10.1016/j.tcs.2019.06.031.

Henzinger, Thomas A., et al. “Outside the Box: Abstraction-Based Monitoring of Neural Networks.”10.3233/FAIA200375__24th European Conference on Artificial Intelligence, vol. 325, IOS Press, 2020, pp. 2433–40, doi:10.3233/FAIA200375.

Baranowski, Marek, et al. “An SMT Theory of Fixed-Point Arithmetic.”10.1007/978-3-030-51074-9_2__Automated Reasoning, vol. 12166, Springer Nature, 2020, pp. 13–31, doi:10.1007/978-3-030-51074-9_2.

Lechner, Mathias, et al. “Neural Circuit Policies Enabling Auditable Autonomy.”10.1038/s42256-020-00237-3__Nature Machine Intelligence, vol. 2, Springer Nature, 2020, pp. 642–52, doi:10.1038/s42256-020-00237-3.

Lechner, Mathias, et al. “Gershgorin Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot Learning Scheme.”10.1109/ICRA40945.2020.9196608__Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2020, pp. 5446–52, doi:10.1109/ICRA40945.2020.9196608.

Forets, Marcelo, et al. “Efficient Reachability Analysis of Parametric Linear Hybrid Systems with  Time-Triggered Transitions.”10.1109/MEMOCODE51338.2020.9314994__18th ACM-IEEE International Conference on Formal Methods and Models for System Design, 9314994, IEEE, 2020, doi:10.1109/MEMOCODE51338.2020.9314994.

Bogomolov, Sergiy, et al. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” Proceedings of the International Conference on Embedded Software, 2020.

Bogomolov, Sergiy, et al. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.”10.1109/TCAD.2020.3012859__IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11, IEEE, 2020, pp. 4018–29, doi:10.1109/TCAD.2020.3012859.

Avni, Guy, et al. “All-Pay Bidding Games on Graphs.”10.1609/aaai.v34i02.5546__Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546.

Henzinger, Thomas A., and Naci E. Sarac. “Monitorability under Assumptions.”10.1007/978-3-030-60508-7_1__Runtime Verification, vol. 12399, Springer Nature, 2020, pp. 3–18, doi:10.1007/978-3-030-60508-7_1.

Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.”10.1007/978-3-030-53288-8_14__Computer Aided Verification, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:10.1007/978-3-030-53288-8_14.

Kragl, Bernhard, et al. “Inductive Sequentialization of Asynchronous Programs.”10.1145/3385412.3385980__Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 227–42, doi:10.1145/3385412.3385980.

Nickovic, Dejan, et al. “AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic.”10.1007/s10009-020-00582-z__International Journal on Software Tools for Technology Transfer, vol. 22, no. 6, Springer Nature, 2020, pp. 741–58, doi:10.1007/s10009-020-00582-z.

Kragl, Bernhard. Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8332.

Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.”10.1109/RTSS49844.2020.00031__2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–56, doi:10.1109/RTSS49844.2020.00031.

Garcia Soto, Miriam, and Pavithra Prabhakar. “Abstraction Based Verification of Stability of Polyhedral Switched Systems.”10.1016/j.nahs.2020.100856__Nonlinear Analysis: Hybrid Systems, vol. 36, no. 5, 100856, Elsevier, 2020, doi:10.1016/j.nahs.2020.100856.

Frehse, Goran, et al. “ARCH-COM Category Report: Hybrid Systems with Piecewise Constant Dynamics.”10.29007/rjwn__ARC. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, edited by Goran Frehse and Matthias Althoff, vol. 61, EasyChair, 2019, pp. 1–13, doi:10.29007/rjwn.

Kundu, Atreyee, et al. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.”10.1109/INDIANCC.2019.8715598__5th Indian Control Conference Proceedings, 8715598, IEEE, 2019, doi:10.1109/INDIANCC.2019.8715598.

Avni, Guy, et al. “Bidding Games on Markov Decision Processes.”10.1007/978-3-030-30806-3_1__10.1007/978-3-030-30806-3_1__Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1.

Lechner, Mathias, et al. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.”10.1109/icra.2019.8793840__Proceedings - IEEE International Conference on Robotics and Automation, vol. 2019–May, 8793840, IEEE, 2019, doi:10.1109/icra.2019.8793840.

Aghajohari, Milad, et al. Determinacy in Discrete-Bidding Infinite-Duration Games. Vol. 140, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.20.

Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.

Hasani, Ramin, et al. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.”10.1109/ijcnn.2019.8851954__Proceedings of the International Joint Conference on Neural Networks, 8851954, IEEE, 2019, doi:10.1109/ijcnn.2019.8851954.

Alur, Rajeev, et al. “Continuous-Time Models for System Design and Analysis.”10.1007/978-3-319-91908-9_22__Computing and Software Science, edited by Bernhard Steffen and Gerhard Woeginger, vol. 10000, Springer Nature, 2019, pp. 452–77, doi:10.1007/978-3-319-91908-9_22.

Immler, Fabian, et al. “ARCH-COM Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.”10.29007/m75b__EPiC Series in Computing, vol. 61, EasyChair Publications, 2019, pp. 41–61, doi:10.29007/m75b.

Althoff, Matthias, et al. “ARCH-COM Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.”10.29007/bj1w__EPiC Series in Computing, vol. 61, EasyChair, 2019, pp. 14–40, doi:10.29007/bj1w.

Avni, Guy, et al. Bidding Mechanisms in Graph Games. Vol. 138, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.MFCS.2019.11.

Christakis, Maria, et al. “Semantic Fault Localization and Suspiciousness Ranking.”10.1007/978-3-030-17462-0_13__25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , vol. 11427, Springer Nature, 2019, pp. 226–43, doi:10.1007/978-3-030-17462-0_13.

Bogomolov, Sergiy, et al. “JuliaReach: A Toolbox for Set-Based Reachability.”10.1145/3302504.3311804__Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control, vol. 22, ACM, 2019, pp. 39–44, doi:10.1145/3302504.3311804.

Ferrere, Thomas, et al. “Interface-Aware Signal Temporal Logic.”10.1145/3302504.3311800__Proceedings of the 2019 22nd ACM International Conference on Hybrid Systems: Computation and Control, ACM, 2019, pp. 57–66, doi:10.1145/3302504.3311800.

Avni, Guy, et al. “Run-Time Optimization for Learned Controllers through Quantitative Games.”10.1007/978-3-030-25540-4_36__31st International Conference on Computer-Aided Verification, vol. 11561, Springer, 2019, pp. 630–49, doi:10.1007/978-3-030-25540-4_36.

Garcia Soto, Miriam, et al. “Membership-Based Synthesis of Linear Hybrid Automata.”10.1007/978-3-030-25540-4_16__31st International Conference on Computer-Aided Verification, vol. 11561, Springer, 2019, pp. 297–314, doi:10.1007/978-3-030-25540-4_16.

Avni, Guy, et al. “Infinite-Duration Bidding Games.”10.1145/3340295__Journal of the ACM, vol. 66, no. 4, 31, ACM, 2019, doi:10.1145/3340295.

Ferrere, Thomas, et al. “From Real-Time Logic to Timed Automata.”10.1145/3286976__Journal of the ACM, vol. 66, no. 3, 19, ACM, 2019, doi:10.1145/3286976.

Guet, Calin C., et al. “Transient Memory in Gene Regulation.”10.1007/978-3-030-31304-3_9__17th International Conference on Computational Methods in Systems Biology, vol. 11773, Springer Nature, 2019, pp. 155–87, doi:10.1007/978-3-030-31304-3_9.

Nidkovi, Dejan, et al. “Shape Expressions for Specifying and Extracting Signal Features.”10.1007/978-3-030-32079-9_17__19th International Conference on Runtime Verification, vol. 11757, Springer Nature, 2019, pp. 292–309, doi:10.1007/978-3-030-32079-9_17.

Kong, Hui, et al. “Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty.”10.1007/978-3-030-29662-9_8__17th International Conference on Formal Modeling and Analysis of Timed Systems, vol. 11750, Springer Nature, 2019, pp. 123–41, doi:10.1007/978-3-030-29662-9_8.

Ferrere, Thomas, et al. “Mixed-Time Signal Temporal Logic.”10.1007/978-3-030-29662-9_4__17th International Conference on Formal Modeling and Analysis of Timed Systems, vol. 11750, Springer Nature, 2019, pp. 59–75, doi:10.1007/978-3-030-29662-9_4.

Giacobbe, Mirco. Automatic Time-Unbounded Reachability Analysis of Hybrid Systems. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6894.

Clarke, Edmund M., et al. Handbook of Model Checking. 1st ed., Springer Nature, 2018, doi:10.1007/978-3-319-10575-8.

Clarke, Edmund, et al. “Introduction to Model Checking.”10.1007/978-3-319-10575-8_1__Handbook of Model Checking, edited by Thomas A Henzinger, Springer, 2018, pp. 1–26, doi:10.1007/978-3-319-10575-8_1.

Chatterjee, Krishnendu, et al. “Computing Average Response Time.”10.1007/978-3-319-95246-8_9__Principles of Modeling, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018, pp. 143–61, doi:10.1007/978-3-319-95246-8_9.

Avni, Guy, et al. Timed Network Games with Clocks. Vol. 117, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.MFCS.2018.23.

Kragl, Bernhard, et al. Synchronizing the Asynchronous. Vol. 118, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.21.

Nickovic, Dejan, et al. AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic. Edited by Dirk Beyer and Marieke Huisman, vol. 10806, Springer, 2018, pp. 303–19, doi:10.1007/978-3-319-89963-3_18.

Ferrere, Thomas, et al. A Theory of Register Monitors. Vol. Part 8033, IEEE, 2018, pp. 394–403, doi:10.1145/3209108.3209194.

Bakhirkin, Alexey, et al. “Efficient Parametric Identification for STL.”10.1145/3178126.3178132__Proceedings of the 21st International Conference on Hybrid Systems, ACM, 2018, pp. 177–86, doi:10.1145/3178126.3178132.

Avni, Guy, et al. Infinite-Duration Poorman-Bidding Games. Vol. 11316, Springer, 2018, pp. 21–36, doi:10.1007/978-3-030-04612-5_2.

Kragl, Bernhard, and Shaz Qadeer. Layered Concurrent Programs. Vol. 10981, Springer, 2018, pp. 79–102, doi:10.1007/978-3-319-96145-3_5.

Bartocci, Ezio, et al. Localizing Faults in Simulink/Stateflow Models with STL. Association for Computing Machinery, Inc, 2018, pp. 197–206, doi:10.1145/3178126.3178131.

Elgyütt, Adrian, et al. Monitoring Temporal Logic with Clock Variables. Vol. 11022, Springer, 2018, pp. 53–70, doi:10.1007/978-3-030-00151-3_4.

Bakhirkin, Alexey, et al. Online Timed Pattern Matching Using Automata. Vol. 11022, Springer, 2018, pp. 215–32, doi:10.1007/978-3-030-00151-3_13.

Arming, Sebastian, et al. Parameter-Independent Strategies for PMDPs via POMDPs. Vol. 11024, Springer, 2018, pp. 53–70, doi:10.1007/978-3-319-99154-2_4.

Kong, Hui, et al. Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes. Vol. 10981, Springer, 2018, pp. 449–67, doi:10.1007/978-3-319-96145-3_24.

Jiang, Yu, et al. “Safety-Assured Model-Driven Design of the Multifunction Vehicle Bus Controller.”10.1109/TITS.2017.2778077__IEEE Transactions on Intelligent Transportation Systems, vol. 19, no. 10, IEEE, 2018, pp. 3320–33, doi:10.1109/TITS.2017.2778077.

Frehse, Goran, et al. Space-Time Interpolants. Vol. 10981, Springer, 2018, pp. 468–86, doi:10.1007/978-3-319-96145-3_25.

Brázdil, Tomás, et al. Strategy Representation by Decision Trees in Reactive Synthesis. Vol. 10805, Springer, 2018, pp. 385–407, doi:10.1007/978-3-319-89960-2_21.

Avni, Guy, and Orna Kupferman. “Synthesis from Component Libraries with Costs.”10.1016/j.tcs.2017.11.001__Theoretical Computer Science, vol. 712, Elsevier, 2018, pp. 50–72, doi:10.1016/j.tcs.2017.11.001.

Ferrere, Thomas. The Compound Interest in Relaxing Punctuality. Vol. 10951, Springer, 2018, pp. 147–64, doi:10.1007/978-3-319-95582-7_9.

Bakhirkin, Alexey, et al. “Keynote: The First-Order Logic of Signals.”10.1109/emsoft.2018.8537203__2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10, doi:10.1109/emsoft.2018.8537203.

Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.

Avni, Guy, et al. “An Abstraction-Refinement Methodology for Reasoning about Network Games.”10.3390/g9030039__Games, vol. 9, no. 3, 39, MDPI AG, 2018, doi:10.3390/g9030039.

Benveniste, Albert, et al. “Contracts for System Design.”10.1561/1000000053__Foundations and Trends in Electronic Design Automation, vol. 12, no. 2–3, Now Publishers, 2018, pp. 124–400, doi:10.1561/1000000053.

Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.”10.1145/3158121__Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 33, Association for Computing Machinery, 2017, doi:10.1145/3158121.

Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.”10.1145/3060139__ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2, 12, ACM, 2017, doi:10.1145/3060139.

Chatterjee, Krishnendu, et al. “Nested Weighted Automata.”10.1145/3152769__ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769.

Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.”10.23638/LMCS-13(3:23)2017__Logical Methods in Computer Science, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.

Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.”10.1007/978-3-319-63121-9_18__Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:10.1007/978-3-319-63121-9_18.

Bak, Stanley, et al. Challenges and Tool Implementation of Hybrid Rapidly Exploring Random Trees. Edited by Alessandro Abate and Sylvie Bodo, vol. 10381, Springer, 2017, pp. 83–89, doi:10.1007/978-3-319-63501-9_6.

Bakhirkin, Alexey, et al. On the Quantitative Semantics of Regular Expressions over Real-Valued Signals. Edited by Alessandro Abate and Gilles Geeraerts, vol. 10419, Springer, 2017, pp. 189–206, doi:10.1007/978-3-319-65765-3_11.

Bogomolov, Sergiy, et al., editors. Numerical Software Verification. Vol. 10152, Springer, 2017, doi:10.1007/978-3-319-54292-8.

Henzinger, Thomas A., et al. Synchronizing the Asynchronous. IST Austria, 2017, doi:10.15479/AT:IST-2018-853-v2-2.

Kong, Hui, et al. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.”10.1145/3049797.3049814__Proceedings of the 20th International Conference on Hybrid Systems, ACM, 2017, pp. 163–72, doi:10.1145/3049797.3049814.

Chatterjee, Krishnendu, et al. Bidirectional Nested Weighted Automata. Vol. 85, 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.5.

Avni, Guy, et al. Timed Network Games with Clocks. Vol. 83, 37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.37.

Le, Xuan, et al. “JFIX: Semantics-Based Repair of Java Programs via Symbolic  PathFinder.”10.1145/3092703.3098225__Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, ACM, 2017, pp. 376–79, doi:10.1145/3092703.3098225.

Avni, Guy, et al. Infinite-Duration Bidding Games. Vol. 85, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.21.

Daca, Przemyslaw. Statistical and Logical Methods for Property Checking. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:TH_730.

Bogomolov, Sergiy, et al. Conic Abstractions for Hybrid Systems. Vol. 10419, Springer, 2017, pp. 116–32, doi:10.1007/978-3-319-65765-3_7.

Bogomolov, Sergiy, et al. Counterexample Guided Refinement of Template Polyhedra. Vol. 10205, Springer, 2017, pp. 589–606, doi:10.1007/978-3-662-54577-5_34.

Svoreová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.”10.1016/j.nahs.2016.04.006__Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2, Elsevier, 2017, pp. 230–53, doi:10.1016/j.nahs.2016.04.006.

Cerny, Pavol, et al. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.”10.1007/s10703-016-0256-5__Formal Methods in System Design, vol. 50, no. 2–3, Springer, 2017, pp. 97–139, doi:10.1007/s10703-016-0256-5.

Giacobbe, Mirco, et al. “Model Checking the Evolution of Gene Regulatory Networks.”10.1007/s00236-016-0278-x__Acta Informatica, vol. 54, no. 8, Springer, 2017, pp. 765–87, doi:10.1007/s00236-016-0278-x.

Henzinger, Thomas A., and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.”10.1016/j.nahs.2016.09.001__Nonlinear Analysis: Hybrid Systems, vol. 23, Elsevier, 2017, pp. 166–90, doi:10.1016/j.nahs.2016.09.001.

Avni, Guy, et al. Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults. Vol. 10206, Springer, 2017, pp. 169–87, doi:10.1007/978-3-662-54580-5_10.

Chatterjee, Krishnendu, et al. “Quantitative Fair Simulation Games.”10.1016/j.ic.2016.10.006__Information and Computation, vol. 254, no. 2, Elsevier, 2017, pp. 143–66, doi:10.1016/j.ic.2016.10.006.

Chatterjee, Krishnendu, et al. Faster Algorithms for Weighted Recursive State Machines. Edited by Hongseok Yang, vol. 10201, Springer, 2017, pp. 287–313, doi:10.1007/978-3-662-54434-1_11.

Avni, Guy, et al. An Abstraction-Refinement Methodology for Reasoning about Network Games. AAAI Press, 2017, pp. 70–76, doi:10.24963/ijcai.2017/11.

Trinh, Minh, et al. Model Counting for Recursively-Defined Strings. Edited by Rupak Majumdar and Viktor Kundak, vol. 10427, Springer, 2017, pp. 399–418, doi:10.1007/978-3-319-63390-9_21.

Le, Xuan, et al. : Syntax- and Semantic-Guided Repair Synthesis via Programming by Examples. Vol. 0154, ACM, 2017, pp. 593–604, doi:10.1145/3106237.3106309.

Gottlob, Georg, et al. “Preface of the Special Issue in Memoriam Helmut Veith.”10.1007/s10703-017-0307-6__Formal Methods in System Design, vol. 51, no. 2, Springer, 2017, pp. 267–69, doi:10.1007/s10703-017-0307-6.

Finkbeiner, Bernd, and Andrey Kupriyanov. “Causality-Based Model Checking.”10.4204/EPTCS.259.3__Electronic Proceedings in Theoretical Computer Science, vol. 259, Open Publishing Association, 2017, pp. 31–38, doi:10.4204/EPTCS.259.3.

Chatterjee, Krishnendu, et al. Nested Weighted Limit-Average Automata of Bounded Width. Vol. 58, 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.MFCS.2016.24.

Haas, Andreas, et al. “Local Linearizability for Concurrent Container-Type Data Structures.”10.4230/LIPIcs.CONCUR.2016.6__Leibniz International Proceedings in Informatics, vol. 59, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.6.

Gurung, Amit, et al. Parallel Reachability Analysis for Hybrid Systems. 7797741, IEEE, 2016, doi:10.1109/MEMCOD.2016.7797741.

Avni, Guy, et al. “Synthesizing Time Triggered Schedules for Switched Networks with Faulty Links.”10.1145/2968478.2968499__Proceedings of the 13th International Conference on Embedded Software , 26, ACM, 2016, doi:10.1145/2968478.2968499.

Duggirala, Parasara, et al. “Tutorial: Software Tools for Hybrid Systems Verification Transformation and Synthesis10.1109/CCA.2016.7587948__HyST and TuLiP.”10.1109/CCA.2016.7587948__2016 IEEE Conference on Control Applications, 7587948, IEEE, 2016, doi:10.1109/CCA.2016.7587948.

Chatterjee, Krishnendu, et al. “Quantitative Automata under Probabilistic Semantics.”10.1145/2933575.2933588__Proceedings of the 31st Annual ACM/IEEE Symposium, IEEE, 2016, pp. 76–85, doi:10.1145/2933575.2933588.

Kong, Hui, et al. Discrete Abstraction of Multiaffine Systems. Vol. 9957, Springer, 2016, pp. 128–44, doi:10.1007/978-3-319-47151-8_9.

Jiang, Yu, et al. From Stateflow Simulation to Verified Implementation: A Verification Approach and a Real-Time Train Controller Design. 7461337, IEEE, 2016, doi:10.1109/RTAS.2016.7461337.

Chatterjee, Krishnendu, et al. Quantitative Monitor Automata. Vol. 9837, Springer, 2016, pp. 23–38, doi:10.1007/978-3-662-53413-7_2.

D’Antoni, Loris, et al. QLOSE: Program Repair with Quantitative Objectives. Vol. 9780, Springer, 2016, pp. 383–401, doi:10.1007/978-3-319-41540-6_21.

Bak, Stanley, et al. Scalable Static Hybridization Methods for Analysis of Nonlinear Systems. Springer, 2016, pp. 155–64, doi:10.1145/2883817.2883837.

Dragoi, Cezara, et al. PSYNC: A Partially Synchronous Language for Fault-Tolerant Distributed Algorithms. Vol. 20–22, ACM, 2016, pp. 400–15, doi:10.1145/2837614.2837650.

Beica, Andreea, et al. Efficient Reduction of Kappa Models by Static Inspection of the Rule-Set. Vol. 9271, Springer, 2016, pp. 173–91, doi:10.1007/978-3-319-26916-0_10.

Henzinger, Thomas A., et al. Lipschitz Robustness of Timed I/O Systems. Vol. 9583, Springer, 2016, pp. 250–67, doi:10.1007/978-3-662-49122-5_12.

Schilling, Christian, et al. “Adaptive Moment Closure for Parameter Inference of Biochemical Reaction Networks.”10.1016/j.biosystems.2016.07.005__Biosystems, vol. 149, Elsevier, 2016, pp. 15–25, doi:10.1016/j.biosystems.2016.07.005.

Bogomolov, Sergiy, et al. “Guided Search for Hybrid Systems Based on Coarse-Grained Space Abstractions.”10.1007/s10009-015-0393-y__International Journal on Software Tools for Technology Transfer, vol. 18, no. 4, Springer, 2016, pp. 449–67, doi:10.1007/s10009-015-0393-y.

Jiang, Yu, et al. “Use Runtime Verification to Improve the Quality of Medical Care Practice.”10.1145/2889160.2889233__Proceedings of the 38th International Conference on Software Engineering Companion , IEEE, 2016, pp. 112–21, doi:10.1145/2889160.2889233.

Chatterjee, Krishnendu, et al. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, vol. 2016, AAAI Press, 2016, pp. 3225–32.

Avni, Guy, et al. Dynamic Resource Allocation Games. Vol. 9928, Springer, 2016, pp. 153–66, doi:10.1007/978-3-662-53354-3_13.

Tarrach, Thorsten. Automatic Synthesis of Synchronisation Primitives for Concurrent Programs. Institute of Science and Technology Austria, 2016, doi:10.15479/at:ista:1130.

Daca, Przemyslaw, et al. Linear Distances between Markov Chains. Vol. 59, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.20.

Daca, Przemyslaw, et al. Faster Statistical Model Checking for Unbounded Temporal Properties. Vol. 9636, Springer, 2016, pp. 112–29, doi:10.1007/978-3-662-49674-9_7.

Daca, Przemyslaw, et al. Abstraction-Driven Concolic Testing. Vol. 9583, Springer, 2016, pp. 328–47, doi:10.1007/978-3-662-49122-5_16.

Daca, Przemyslaw, et al. Array Folds Logic. Vol. 9780, Springer, 2016, pp. 230–48, doi:10.1007/978-3-319-41540-6_13.

Jiang, Yu, et al. Safety Assured Formal Model Driven Design of the Multifunction Vehicle Bus Controller. Vol. 9995, Springer, 2016, pp. 757–63, doi:10.1007/978-3-319-48989-6_47.

Parise, Francesca, et al. “Bayesian Inference for Stochastic Individual-Based Models of Ecological Systems: A Pest Control Simulation Study.”10.3389/fenvs.2015.00042__Frontiers in Environmental Science, vol. 3, 42, Frontiers, 2015, doi:10.3389/fenvs.2015.00042.

Dragoi, Cezara, et al. The Need for Language Support for Fault-Tolerant Distributed Systems. Vol. 32, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 90–102, doi:10.4230/LIPIcs.SNAPL.2015.90.

Kretinsky, Jan, et al. Polynomial Time Decidability of Weighted Synchronization under Partial Observability. Vol. 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–54, doi:10.4230/LIPIcs.CONCUR.2015.142.

Ruess, Jakob. “Minimal Moment Equations for Stochastic Models of Biochemical Reaction Networks with Partially Finite State Space.”10.1063/1.4937937__Journal of Chemical Physics, vol. 143, no. 24, 244103, American Institute of Physics, 2015, doi:10.1063/1.4937937.

Ruess, Jakob, et al. “Iterative Experiment Design Guides the Characterization of a Light-Inducible Gene Expression Circuit.”10.1073/pnas.1423947112__PNAS, vol. 112, no. 26, National Academy of Sciences, 2015, pp. 8148–53, doi:10.1073/pnas.1423947112.

Ray, Rajarshi, et al. XSpeed: Accelerating Reachability Analysis on Multi-Core Processors. Vol. 9434, Springer, 2015, pp. 3–18, doi:10.1007/978-3-319-26287-1_1.

Forejt, Vojtbch, et al. Controller Synthesis for MDPs and Frequency LTL\'47U. Vol. 9450, Springer, 2015, pp. 162–77, doi:10.1007/978-3-662-48899-7_12.

Babiak, Tomás, et al. The Hanoi Omega-Automata Format. Vol. 9206, Springer, 2015, pp. 479–86, doi:10.1007/978-3-319-21690-4_31.

Bogomolov, Sergiy, et al. Abstraction-Based Parameter Synthesis for Multiaffine Systems. Vol. 9434, Springer, 2015, pp. 19–35, doi:10.1007/978-3-319-26287-1_2.

Nguyen, Luan, et al. “Runtime Verification for Hybrid Analysis Tools.”10.1007/978-3-319-23820-3_19__6th International Conference, vol. 9333, Springer Nature, 2015, pp. 281–86, doi:10.1007/978-3-319-23820-3_19.

Bogomolov, Sergiy, et al. Adaptive Moment Closure for Parameter Inference of Biochemical Reaction Networks. Vol. 9308, Springer, 2015, pp. 77–89, doi:10.1007/978-3-319-23401-4_8.

Bogomolov, Sergiy, et al. PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior. AAAI Press, 2015, pp. 42–46.

Michaliszyn, Jakub, et al. “On the Decidability of Elementary Modal Logics.”10.1145/2817825__ACM Transactions on Computational Logic, vol. 17, no. 1, 2, ACM, 2015, doi:10.1145/2817825.

Frehse, Goran, et al. “Eliminating Spurious Transitions in Reachability with Support Functions.”10.1145/2728606.2728622__Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 149–58, doi:10.1145/2728606.2728622.

Bak, Stanley, et al. HYST: A Source Transformation and Translation Tool for Hybrid Automaton Models. Springer, 2015, pp. 128–33, doi:10.1145/2728606.2728630.

Velner, Yaron, et al. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.”10.1016/j.ic.2015.03.001__Information and Computation, vol. 241, no. 4, Elsevier, 2015, pp. 177–96, doi:10.1016/j.ic.2015.03.001.

Gupta, Ashutosh, and Thomas A. Henzinger. “Guest Editors’ Introduction to Special Issue on Computational Methods in Systems Biology.”10.1145/2745799__ACM Transactions on Modeling and Computer Simulation, vol. 25, no. 2, 7, ACM, 2015, doi:10.1145/2745799.

Cerny, Pavol, et al. Segment Abstraction for Worst-Case Execution Time Analysis. Vol. 9032, Springer, 2015, pp. 105–31, doi:10.1007/978-3-662-46669-8_5.

Benes, Nikola, et al. “Refinement Checking on Parametric Modal Transition Systems.”10.1007/s00236-015-0215-4__Acta Informatica, vol. 52, no. 2–3, Springer, 2015, pp. 269–97, doi:10.1007/s00236-015-0215-4.

Geiger, Bernhard, et al. “Optimal Kullback-Leibler Aggregation via Information Bottleneck.”10.1109/TAC.2014.2364971__IEEE Transactions on Automatic Control, vol. 60, no. 4, IEEE, 2015, pp. 1010–22, doi:10.1109/TAC.2014.2364971.

Ruess, Jakob, and John Lygeros. “Moment-Based Methods for Parameter Inference and Experiment Design for Stochastic Biochemical Reaction Networks.”10.1145/2688906__ACM Transactions on Modeling and Computer Simulation, vol. 25, no. 2, 8, ACM, 2015, doi:10.1145/2688906.

Henzinger, Thomas A., and Jean Raskin. “The Equivalence Problem for Finite Automata: Technical Perspective.”10.1145/2701001__Communications of the ACM, vol. 58, no. 2, ACM, 2015, pp. 86–86, doi:10.1145/2701001.

Fahrenberg, Uli, et al. Compositionality for Quantitative Specifications. Vol. 8997, Springer, 2015, pp. 306–24, doi:10.1007/978-3-319-15317-9_19.

Gupta, Ashutosh, et al. Succinct Representation of Concurrent Trace Sets. ACM, 2015, pp. 433–44, doi:10.1145/2676726.2677008.

Chakraborty, Soham, et al. “Aspect-Oriented Linearizability Proofs.”10.2168/LMCS-11(1:20)2015__Logical Methods in Computer Science, vol. 11, no. 1, 20, International Federation of Computational Logic, 2015, doi:10.2168/LMCS-11(1:20)2015.

Chatterjee, Krishnendu, et al. “Randomness for Free.”10.1016/j.ic.2015.06.003__Information and Computation, vol. 245, no. 12, Elsevier, 2015, pp. 3–16, doi:10.1016/j.ic.2015.06.003.

Chatterjee, Krishnendu, et al. “Measuring and Synthesizing Systems in Probabilistic Environments.”10.1145/2699430__Journal of the ACM, vol. 62, no. 1, 9, ACM, 2015, doi:10.1145/2699430.

Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IEEE, 2015, pp. 244–56, doi:10.1109/LICS.2015.32.

Chatterjee, Krishnendu, et al. “Nested Weighted Automata.”10.1109/LICS.2015.72__Proceedings - Symposium on Logic in Computer Science, vol. 2015–July, 7174926, IEEE, 2015, doi:10.1109/LICS.2015.72.

Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria, 2015, doi:10.15479/AT:IST-2015-170-v2-2.

Boker, Udi, et al. “The Target Discounted-Sum Problem.”10.1109/LICS.2015.74__LICS, IEEE, 2015, pp. 750–61, doi:10.1109/LICS.2015.74.

Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.”10.1007/978-3-662-47666-6_10__42nd International Colloquium, vol. 9135, no. Part II, Springer Nature, 2015, pp. 121–33, doi:10.1007/978-3-662-47666-6_10.

Boker, Udi, et al. The Target Discounted-Sum Problem. IST Austria, 2015, doi:10.15479/AT:IST-2015-335-v1-1.

Benes, Nikola, et al. Complete Composition Operators for IOCO-Testing Theory. ACM, 2015, pp. 101–10, doi:10.1145/2737166.2737175.

Chatterjee, Krishnendu, et al. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.”10.1007/s10703-015-0235-2__Formal Methods in System Design, vol. 47, no. 2, Springer, 2015, pp. 230–64, doi:10.1007/s10703-015-0235-2.

Svoreová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.”10.1145/2728606.2728608__Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–68, doi:10.1145/2728606.2728608.

Cerny, Pavol, et al. From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis. Vol. 9207, Springer, 2015, pp. 180–97, doi:10.1007/978-3-319-21668-3_11.

Giacobbe, Mirco, et al. Model Checking Gene Regulatory Networks. Vol. 9035, Springer, 2015, pp. 469–83, doi:10.1007/978-3-662-46681-0_47.

Brázdil, Tomás, et al. Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Vol. 9206, Springer, 2015, pp. 158–77, doi:10.1007/978-3-319-21690-4_10.

Fellner, Andreas. Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria, 2015, doi:10.15479/AT:ISTA:28.

Dragoi, Cezara, et al. A Logic-Based Framework for Verifying Consensus Algorithms. Vol. 8318, Springer, 2014, pp. 161–81, doi:10.1007/978-3-642-54013-4_10.

Gordon, Andrew, et al. “Probabilistic Programming.”10.1145/2593882.2593900__Proceedings of the on Future of Software Engineering, ACM, 2014, pp. 167–81, doi:10.1145/2593882.2593900.

Gupta, Ashutosh, et al. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.”10.4204/EPTCS.169.5__Electronic Proceedings in Theoretical Computer Science, EPTCS, vol. 169, Open Publishing, 2014, pp. 31–38, doi:10.4204/EPTCS.169.5.

Hofferek, Georg, and Ashutosh Gupta. “Suraq - a Controller Synthesis Tool Using Uninterpreted Functions.”10.1007/978-3-319-13338-6_6__HVC 2014, edited by Eran Yahav, vol. 8855, Springer, 2014, pp. 68–74, doi:10.1007/978-3-319-13338-6_6.

Gupta, Ashutosh, et al. “Extensional Crisis and Proving Identity.”10.1007/978-3-319-11936-6_14__ATVA 2014, edited by Franck Cassez and Jean-François Raskin, vol. 8837, Springer, 2014, pp. 185–200, doi:10.1007/978-3-319-11936-6_14.

Henzinger, Thomas A., et al. “Lipschitz Robustness of Finite-State Transducers.”10.4230/LIPIcs.FSTTCS.2014.431__Leibniz International Proceedings in Informatics, LIPIcs, vol. 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 431–43, doi:10.4230/LIPIcs.FSTTCS.2014.431.

Samanta, Roopsha, et al. Cost-Aware Automatic Program Repair. Edited by Markus Müller-Olm and Helmut Seidl, vol. 8723, Springer, 2014, pp. 268–84, doi:10.1007/978-3-319-10936-7_17.

Brázdil, Tomás, et al. “Verification of Markov Decision Processes Using Learning Algorithms.”10.1007/978-3-319-11936-6_8__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), edited by Franck Cassez and Jean-François Raskin, vol. 8837, Society of Industrial and Applied Mathematics, 2014, pp. 98–114, doi:10.1007/978-3-319-11936-6_8.

Komárková, Zuzana, and Jan Kretinsky. “Rabinizer 3: Safraless Translation of Ltl to Small Deterministic Automata.”10.1007/978-3-319-11936-6_17__Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, vol. 8837, Springer, 2014, pp. 235–41, doi:10.1007/978-3-319-11936-6_17.

Hermanns, Holger, et al. “Probabilistic Bisimulation: Naturally on Distributions.”10.1007/978-3-662-44584-6_18__Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–65, doi:10.1007/978-3-662-44584-6_18.

Ganguly, Arnab, et al. “Markov Chain Aggregation and Its Applications to Combinatorial Reaction Networks.”10.1007/s00285-013-0738-7__Journal of Mathematical Biology, vol. 69, no. 3, Springer, 2014, pp. 767–97, doi:10.1007/s00285-013-0738-7.

Bloem, Roderick, et al. “Synthesizing Robust Systems.”10.1007/s00236-013-0191-5__Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 193–220, doi:10.1007/s00236-013-0191-5.

Esparza, Javier, and Jan Kretinsky. From LTL to Deterministic Automata: A Safraless Compositional Approach. Vol. 8559, Springer, 2014, pp. 192–208, doi:10.1007/978-3-319-08867-9_13.

Boker, Udi, and Thomas A. Henzinger. “Exact and Approximate Determinization of Discounted-Sum Automata.”10.2168/LMCS-10(1:10)2014__Logical Methods in Computer Science, vol. 10, no. 1, International Federation of Computational Logic, 2014, doi:10.2168/LMCS-10(1:10)2014.

Boker, Udi, et al. Battery Transition Systems. Vol. 49, no. 1, ACM, 2014, pp. 595–606, doi:10.1145/2535838.2535875.

Cerny, Pavol, et al. “Interface Simulation Distances.”10.1016/j.tcs.2014.08.019__Theoretical Computer Science, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:10.1016/j.tcs.2014.08.019.

Boker, Udi, et al. “Temporal Specifications with Accumulative Values.”10.1145/2629686__ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4, 27, ACM, 2014, doi:10.1145/2629686.

Daca, Przemyslaw, et al. Compositional Specifications for IOCO Testing. IST Austria, 2014, doi:10.15479/AT:IST-2014-148-v2-1.

Henzinger, Thomas A., and Jan Otop. “Model Measuring for Hybrid Systems.”10.1145/2562059.2562130__Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, Springer, 2014, pp. 213–22, doi:10.1145/2562059.2562130.

Henzinger, Thomas A., and Jan Otop. From Model Checking to Model Measuring. IST Austria, 2014, doi:10.15479/AT:IST-2014-172-v1-1.

Henzinger, Thomas A., and Jan Otop. Model Measuring for Hybrid Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-171-v1-1.

Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria, 2014, doi:10.15479/AT:IST-2014-170-v1-1.

Cerny, Pavol, et al. Regression-Free Synthesis for Concurrency. Vol. 8559, Springer, 2014, pp. 568–84, doi:10.1007/978-3-319-08867-9_38.

Daca, Przemyslaw, et al. “Compositional Specifications for IOCO Testing.”10.1109/ICST.2014.50__IEEE 7th International Conference on Software Testing, Verification and Validation, 6823899, IEEE, 2014, doi:10.1109/ICST.2014.50.

Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. Vol. 8559, Springer, 2014, pp. 473–90, doi:10.1007/978-3-319-08867-9_31.

Chatterjee, Krishnendu, et al. Quantitative Fair Simulation Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-315-v1-1.

Haas, Andreas, et al. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.”10.1145/2482767.2482789__Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, no. 5, 17, ACM Press, 2013, doi:10.1145/2482767.2482789.

Hofferek, Georg, et al. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.”10.1109/FMCAD.2013.6679394__2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84, doi:10.1109/FMCAD.2013.6679394.

Boker, Udi, et al. Nondeterminism in the Presence of a Diverse or Unknown Future. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:10.1007/978-3-642-39212-2_11.

Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.”10.1145/2429069.2429109__Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–28, doi:10.1145/2429069.2429109.

Cerny, Pavol, et al. “Quantitative Abstraction Refinement.”10.1145/2429069.2429085__Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–28, doi:10.1145/2429069.2429085.

Blanc, Régis, et al. Tree Interpolation in Vampire. Vol. 8312, Springer, 2013, pp. 173–81, doi:10.1007/978-3-642-45221-5_13.

Michaliszyn, Jakub, and Jan Otop. Elementary Modal Logics over Transitive Structures. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:10.4230/LIPIcs.CSL.2013.563.

Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.”10.1007/s00450-013-0251-7__Computer Science Research and Development, vol. 28, no. 4, Springer, 2013, pp. 331–44, doi:10.1007/s00450-013-0251-7.

Gupta, Ashutosh, and Thomas A. Henzinger, editors. Computational Methods in Systems Biology. Vol. 8130, Springer, 2013, doi:10.1007/978-3-642-40708-6.

Dragoi, Cezara, et al. Local Shape Analysis for Overlaid Data Structures. Vol. 7935, Springer, 2013, pp. 150–71, doi:10.1007/978-3-642-38856-9_10.

Godhal, Yashdeep, et al. “Synthesis of AMBA AHB from Formal Specification: A Case Study.”10.1007/s10009-011-0207-9__International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6, Springer, 2013, pp. 585–601, doi:10.1007/s10009-011-0207-9.

Desai, Ankush, et al. “P: Safe Asynchronous Event-Driven Programming.”10.1145/2491956.2462184__Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–31, doi:10.1145/2491956.2462184.

Henzinger, Thomas A., et al. Aspect-Oriented Linearizability Proofs. Vol. 8052, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 242–56, doi:10.1007/978-3-642-40184-8_18.

Piskac, Ruzica, et al. Automating Separation Logic Using SMT. Vol. 8044, Springer, 2013, pp. 773–89, doi:10.1007/978-3-642-39799-8_54.

Almagor, Shaull, et al. Formalizing and Reasoning about Quality. Vol. 7966, no. Part 2, Springer, 2013, pp. 15–27, doi:10.1007/978-3-642-39212-2_3.

Chatterjee, Krishnendu, et al. “Strategy Improvement for Concurrent Reachability and Turn Based Stochastic Safety Games.”10.1016/j.jcss.2012.12.001__Journal of Computer and System Sciences, vol. 79, no. 5, Elsevier, 2013, pp. 640–57, doi:10.1016/j.jcss.2012.12.001.

Kucera, Antonin, et al., editors. Mathematical and Engineering Methods in Computer Science. Vol. 7721, Springer, 2013, pp. 1–228, doi:10.1007/978-3-642-36046-6.

Henzinger, Thomas A., and Ali Sezgin. How Free Is Your Linearizable Concurrent Data Structure? IST Austria, 2013, doi:10.15479/AT:IST-2013-123-v1-1.

Chatterjee, Krishnendu, et al. “Distributed Synthesis for LTL Fragments.”10.1109/FMCAD.2013.6679386__13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25, doi:10.1109/FMCAD.2013.6679386.

Chatterjee, Krishnendu, et al. Distributed Synthesis for LTL Fragments. IST Austria, 2013, doi:10.15479/AT:IST-2013-130-v1-1.

Henzinger, Thomas A., and Jan Otop. From Model Checking to Model Measuring. Vol. 8052, Springer, 2013, pp. 273–87, doi:10.1007/978-3-642-40184-8_20.

Henzinger, Thomas A., et al. Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues . IST Austria, 2013, doi:10.15479/AT:IST-2013-124-v1-1.

Dragoi, Cezara, et al. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.”10.1007/978-3-642-39799-8_11__Computer Aided Verification, vol. 8044, Springer Berlin Heidelberg, 2013, pp. 174–90, doi:10.1007/978-3-642-39799-8_11.

Zufferey, Damien. Analysis of Dynamic Message Passing Programs. Institute of Science and Technology Austria, 2013, doi:10.15479/at:ista:1405.

Bansal, Kshitij, et al. Structural Counter Abstraction. Edited by Nir Piterman and Scott Smolka, vol. 7795, Springer, 2013, pp. 62–77, doi:10.1007/978-3-642-36742-7_5.

Cerny, Pavol, et al. Efficient Synthesis for Concurrency by Semantics-Preserving Transformations. Vol. 8044, Springer, 2013, pp. 951–67, doi:10.1007/978-3-642-39799-8_68.

Beyer, Dirk, et al. “Conditional Model Checking: A Technique to Pass Information between Verifiers.”10.1145/2393596.2393664__Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, 57, ACM, 2012, doi:10.1145/2393596.2393664.

Henzinger, Thomas A., and Maria Mateescu. “The Propagation Approach for Computing Biochemical Reaction Networks.”10.1109/TCBB.2012.91__IEEE ACM Transactions on Computational Biology and Bioinformatics, vol. 10, no. 2, IEEE, 2012, pp. 310–22, doi:10.1109/TCBB.2012.91.

Chatterjee, Krishnendu, et al. “Evolutionary Game Dynamics in Populations with Different Learners.”10.1016/j.jtbi.2012.02.021__Journal of Theoretical Biology, vol. 301, Elsevier, 2012, pp. 161–73, doi:10.1016/j.jtbi.2012.02.021.

Boker, Udi, and Thomas A. Henzinger. “Approximate Determinization of Quantitative Automata.”10.4230/LIPIcs.FSTTCS.2012.362__Leibniz International Proceedings in Informatics, vol. 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–73, doi:10.4230/LIPIcs.FSTTCS.2012.362.

Cerny, Pavol, et al. “Synthesis from Incompatible Specifications.”10.1145/2380356.2380371__Proceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 53–62, doi:10.1145/2380356.2380371.

Henzinger, Thomas A. “Quantitative Reactive Models.”10.1007/978-3-642-33666-9_1__Conference Proceedings MODELS 2012, vol. 7590, Springer, 2012, pp. 1–2, doi:10.1007/978-3-642-33666-9_1.

Cerny, Pavol, et al. “Interface Simulation Distances.”10.4204/EPTCS.96.3__Electronic Proceedings in Theoretical Computer Science, vol. 96, EPTCS, 2012, pp. 29–42, doi:10.4204/EPTCS.96.3.

Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.”10.1145/2380356.2380370__Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52, doi:10.1145/2380356.2380370.

Henzinger, Thomas A., and Dejan Nickovic. “Independent Implementability of Viewpoints.”10.1007/978-3-642-34059-8_20__10.1007/978-3-642-34059-8_20__Conference Proceedings Monterey Workshop 2012, vol. 7539, Springer, 2012, pp. 380–95, doi:10.1007/978-3-642-34059-8_20.

Guet, Calin C., et al. Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits. Vol. 7358, Springer, 2012, pp. 294–309, doi:10.1007/978-3-642-31424-7_24.

Asarin, Eugene, et al. Parametric Identification of Temporal Properties. Vol. 7186, Springer, 2012, pp. 147–60, doi:10.1007/978-3-642-29860-8_12.

Bouajjani, Ahmed, et al. Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data. Vol. 7148, Springer, 2012, pp. 1–22, doi:10.1007/978-3-642-27940-9_1.

Feret, Jérôme, et al. “Lumpability Abstractions of Rule Based Systems.”10.1016/j.tcs.2011.12.059__Theoretical Computer Science, vol. 431, Elsevier, 2012, pp. 137–64, doi:10.1016/j.tcs.2011.12.059.

Chatterjee, Krishnendu, and Thomas A. Henzinger. “A Survey of Stochastic <9 Regular Games.”10.1016/j.jcss.2011.05.002__Journal of Computer and System Sciences, vol. 78, no. 2, Elsevier, 2012, pp. 394–413, doi:10.1016/j.jcss.2011.05.002.

Chatterjee, Krishnendu, et al. “A Survey of Partial-Observation Stochastic Parity Games.”10.1007/s10703-012-0164-2__Formal Methods in System Design, vol. 43, no. 2, Springer, 2012, pp. 268–84, doi:10.1007/s10703-012-0164-2.

Delahaye, Benoît, et al. Synchronous Interface Theories and Time Triggered Scheduling. Vol. 7273, Springer, 2012, pp. 203–18, doi:10.1007/978-3-642-30793-5_13.

Ghosal, Arkadeb, et al. “Separate Compilation of Hierarchical Real-Time Programs into Linear-Bounded Embedded Machine Code.”10.1016/j.scico.2010.06.004__Science of Computer Programming, vol. 77, no. 2, Elsevier, 2012, pp. 96–112, doi:10.1016/j.scico.2010.06.004.

Alur, Rajeev, et al. “Algorithmic Analysis of Array-Accessing Programs.”10.1145/2287718.2287727__ACM Transactions on Computational Logic (TOCL), vol. 13, no. 3, 27, ACM, 2012, doi:10.1145/2287718.2287727.

Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.”10.1145/2362355.2362357__ACM Transactions on Computational Logic (TOCL), vol. 13, no. 4, 29, ACM, 2012, doi:10.1145/2362355.2362357.

Cerny, Pavol, et al. “Simulation Distances.”10.1016/j.tcs.2011.08.002__Theoretical Computer Science, vol. 413, no. 1, Elsevier, 2012, pp. 21–35, doi:10.1016/j.tcs.2011.08.002.

Bouajjani, Ahmed, et al. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.”10.1007/978-3-642-33386-6_14__Automated Technology for Verification and Analysis, vol. 7561, Springer, 2012, pp. 167–82, doi:10.1007/978-3-642-33386-6_14.

Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.”10.1007/978-3-642-28756-5_46__Tools and Algorithms for the Construction and Analysis of Systems, edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51, doi:10.1007/978-3-642-28756-5_46.

Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.”10.1007/978-3-642-33386-6_10__Automated Technology for Verification and Analysis, vol. 7561, Springer Berlin Heidelberg, 2012, pp. 107–21, doi:10.1007/978-3-642-33386-6_10.

Zufferey, Damien, et al. Ideal Abstractions for Well Structured Transition Systems. Vol. 7148, Springer, 2012, pp. 445–60, doi:10.1007/978-3-642-27940-9_29.

Gupta, Ashutosh, et al. Solving Recursion-Free Horn Clauses over LI+UIF. Edited by Hongseok Yang, vol. 7078, Springer, 2011, pp. 188–203, doi:10.1007/978-3-642-25318-8_16.

Henzinger, Thomas A., et al. Static Scheduling in Clouds. USENIX, 2011, pp. 1–6.

Henzinger, Thomas A., and Maria Mateescu. Tail Approximation for the Chemical Master Equation. Tampere International Center for Signal Processing, 2011.

Henzinger, Thomas A., and Maria Mateescu. Propagation Models for Computing Biochemical Reaction Networks. Springer, 2011, pp. 1–3, doi:10.1145/2037509.2037510.

Bloem, Roderick, et al. “Specification-Centered Robustness.”10.1109/SIES.2011.5953660__6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–85, doi:10.1109/SIES.2011.5953660.

Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.”10.1145/1985342.1985345__ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33, no. 4, 14, ACM, 2011, doi:10.1145/1985342.1985345.

Halalai, Raluca, et al. Quantitative Evaluation of BFT Protocols. IEEE, 2011, pp. 255–64, doi:10.1109/QEST.2011.40.

Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.”10.1145/1970398.1970404__ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4, 28, ACM, 2011, doi:10.1145/1970398.1970404.

Fisher, Jasmin, et al. “Biology as Reactivity.”10.1145/2001269.2001289__Communications of the ACM, vol. 54, no. 10, ACM, 2011, pp. 72–82, doi:10.1145/2001269.2001289.

Fisher, Jasmin, et al. Dynamic Reactive Modules. Vol. 6901, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–18, doi:10.1007/978-3-642-23217-6_27.

Chatterjee, Krishnendu, et al. QUASY: Quantitative Synthesis Tool. Vol. 6605, Springer, 2011, pp. 267–71, doi:10.1007/978-3-642-19835-9_24.

Chatterjee, Krishnendu, et al. The Decidability Frontier for Probabilistic Automata on Infinite Words. ArXiv.

Henzinger, Thomas A., et al. “Formalisms for Specifying Markovian Population Models.”10.1142/S0129054111008441__IJFCS: International Journal of Foundations of Computer Science, vol. 22, no. 4, World Scientific Publishing, 2011, pp. 823–41, doi:10.1142/S0129054111008441.

Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.”10.2168/LMCS-7(4:8)2011__Logical Methods in Computer Science, vol. 7, no. 4, International Federation of Computational Logic, 2011, doi:10.2168/LMCS-7(4:8)2011.

Almagor, Shaull, et al. What’s Decidable about Weighted Automata . Vol. 6996, Springer, 2011, pp. 482–91, doi:10.1007/978-3-642-24372-1_37.

Alur, Rajeev, and Pavol Cerny. Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs. Vol. 46, no. 1, ACM, 2011, pp. 599–610, doi:10.1145/1926385.1926454.

Piskac, Ruzica, and Thomas Wies. Decision Procedures for Automating Termination Proofs. Edited by Ranjit Jhala and David Schmidt, vol. 6538, Springer, 2011, pp. 371–86, doi:10.1007/978-3-642-18275-4_26.

Boker, Udi, and Thomas A. Henzinger. Determinizing Discounted-Sum Automata. Vol. 12, Springer, 2011, pp. 82–96, doi:10.4230/LIPIcs.CSL.2011.82.

Cerny, Pavol, et al. The Complexity of Quantitative Information Flow Problems. IEEE, 2011, pp. 205–17, doi:10.1109/CSF.2011.21.

Henzinger, Thomas A., et al. Scheduling Large Jobs by Abstraction Refinement. ACM, 2011, pp. 329–42, doi:10.1145/1966445.1966476.

Cerny, Pavol, and Thomas A. Henzinger. From Boolean to Quantitative Synthesis. ACM, 2011, pp. 149–54, doi:10.1145/2038642.2038666.

Chatterjee, Krishnendu, et al. The Complexity of Request-Response Games. Edited by Adrian-Horia Dediu et al., vol. 6638, Springer, 2011, pp. 227–37, doi:10.1007/978-3-642-21254-3_17.

Didier, Frédéric, et al. “Approximation of Event Probabilities in Noisy Cellular Processes.”10.1016/j.tcs.2010.10.022__Theoretical Computer Science, vol. 412, no. 21, Elsevier, 2011, pp. 2128–41, doi:10.1016/j.tcs.2010.10.022.

Guerraoui, Rachid, et al. “Verification of STM on Relaxed Memory Models.”10.1007/s10703-011-0131-3__Formal Methods in System Design, vol. 39, no. 3, Springer, 2011, pp. 297–331, doi:10.1007/s10703-011-0131-3.

Boker, Udi, et al. Temporal Specifications with Accumulative Values. 5970226, IEEE, 2011, doi:10.1109/LICS.2011.33.

Boker, Udi, et al. Temporal Specifications with Accumulative Values. IST Austria, 2011, doi:10.15479/AT:IST-2011-0003.

Wies, Thomas, et al. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria, 2011, doi:10.15479/AT:IST-2011-0005.

Wies, Thomas, et al. An Efficient Decision Procedure for Imperative Tree Data Structures. Vol. 6803, Springer, 2011, pp. 476–91, doi:10.1007/978-3-642-22438-6_36.

Cerny, Pavol, et al. Quantitative Synthesis for Concurrent Programs. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 243–59, doi:10.1007/978-3-642-22110-1_20.

Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.”10.1007/978-3-642-17511-4_7__Logic for Programming, Artificial Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:10.1007/978-3-642-17511-4_7.

Feret, Jérôme, et al. Lumpability Abstractions of Rule-Based Systems. Vol. 40, Open Publishing Association, 2010, pp. 142–61.

Didier, Frédéric, et al. SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks. IEEE, 2010, pp. 193–94, doi:10.1109/QEST.2010.33.

Henzinger, Thomas A., et al. Aligators for Arrays. Vol. 6397, Springer, 2010, pp. 348–56, doi:10.1007/978-3-642-16242-8_25.

Didier, Frédéric, et al. “Fast Adaptive Uniformization of the Chemical Master Equation.”10.1049/iet-syb.2010.0005__IET Systems Biology, vol. 4, no. 6, Institution of Engineering and Technology, 2010, pp. 441–52, doi:10.1049/iet-syb.2010.0005.

Chatterjee, Krishnendu, et al. Randomness for Free. Vol. 6281, Springer, 2010, pp. 246–57, doi:10.1007/978-3-642-15155-2_23.

Chatterjee, Krishnendu, and Thomas A. Henzinger, editors. Formal Modeling and Analysis of Timed Systems. Vol. 6246, Springer, 2010, doi:10.1007/978-3-642-15297-9.

Bloem, Roderick, et al. Robustness in the Presence of Liveness. Edited by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:10.1007/978-3-642-14295-6_36.

Nickovic, Dejan, and Nir Piterman. From MTL to Deterministic Timed Automata. Edited by Thomas A. Henzinger and Krishnendu Chatterjee, vol. 6246, Springer, 2010, pp. 152–67, doi:10.1007/978-3-642-15297-9_13.

Wolf, Verena, et al. “Solving the Chemical Master Equation Using Sliding Windows.”10.1186/1752-0509-4-42__BMC Systems Biology, vol. 4, no. 42, BioMed Central, 2010, pp. 1–19, doi:10.1186/1752-0509-4-42.

Henzinger, Thomas A. From Boolean to Quantitative Notions of Correctness. Vol. 45, no. 1, ACM, 2010, pp. 157–58, doi:10.1145/1706299.1706319.

Henzinger, Thomas A., et al. Invariant and Type Inference for Matrices. Vol. 5944, Springer, 2010, pp. 163–79, doi:10.1007/978-3-642-11319-2_14.

Henzinger, Thomas A., et al. Hybrid Numerical Solution of the Chemical Master Equation. Springer, 2010, pp. 55–65, doi:10.1145/1839764.1839772.

Chatterjee, Krishnendu, et al. Mean-Payoff Automaton Expressions. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:10.1007/978-3-642-15375-4_19.

Chatterjee, Krishnendu, et al. Generalized Mean-Payoff and Energy Games. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–16, doi:10.4230/LIPIcs.FSTTCS.2010.505.

Chatterjee, Krishnendu, et al. Measuring and Synthesizing Systems in Probabilistic Environments. Vol. 6174, Springer, 2010, pp. 380–95, doi:10.1007/978-3-642-14295-6_34.

Berwanger, Dietmar, et al. “Strategy Construction for Parity Games with Imperfect Information.”10.1016/j.ic.2009.09.006__Information and Computation, vol. 208, no. 10, Elsevier, 2010, pp. 1206–20, doi:10.1016/j.ic.2009.09.006.

Chatterjee, Krishnendu, et al. “Strategy Logic.”10.1016/j.ic.2009.07.004__Information and Computation, vol. 208, no. 6, Elsevier, 2010, pp. 677–93, doi:10.1016/j.ic.2009.07.004.

Singh, Vasu. Runtime Verification for Software Transactional Memories. Edited by Oleg Sokolsky et al., vol. 6418, Springer, 2010, pp. 421–35, doi:10.1007/978-3-642-16612-9_32.

Kuncak, Viktor, et al. Building a Calculus of Data Structures. Edited by Gilles Barthe and Manuel Hermenegildo, vol. 5944, Springer, 2010, pp. 26–44, doi:10.1007/978-3-642-11319-2_6.

Henzinger, Thomas A., et al. FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment. IEEE, 2010, pp. 83–90, doi:10.1109/CLOUD.2010.71.

Guerraoui, Rachid, et al. Transactions in the Jungle. ACM, 2010, pp. 263–72, doi:10.1145/1810479.1810529.

Henzinger, Thomas A., et al. A Marketplace for Cloud Resources. ACM, 2010, pp. 1–8, doi:10.1145/1879021.1879022.

Doyen, Laurent, et al. Robustness of Sequential Circuits. IEEE, 2010, pp. 77–84, doi:10.1109/ACSD.2010.26.

Cerny, Pavol, et al. “Quantitative Simulation Games.”10.1007/978-3-642-13754-9_3__Time For Verification: Essays in Memory of Amir Pnueli, edited by Zohar Manna and Doron Peled, vol. 6200, Springer, 2010, pp. 42–60, doi:10.1007/978-3-642-13754-9_3.

Beyer, Dirk, et al. Shape Refinement through Explicit Heap Analysis. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer, 2010, pp. 263–77, doi:10.1007/978-3-642-12029-9_19.

Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative Languages.”10.2168/LMCS-6(3:10)2010__Logical Methods in Computer Science, vol. 6, no. 3, International Federation of Computational Logic, 2010, pp. 1–23, doi:10.2168/LMCS-6(3:10)2010.

Alur, Rajeev, and Pavol Cerny. Expressiveness of Streaming String Transducers. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12, doi:10.4230/LIPIcs.FSTTCS.2010.1.

Hoenicke, Jochen, et al. “Doomed Program Points.”10.1007/s10703-010-0102-0__Formal Methods in System Design, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:10.1007/s10703-010-0102-0.

Cerny, Pavol, et al. Simulation Distances. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–68, doi:10.1007/978-3-642-15375-4_18.

Chatterjee, Krishnendu, et al. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010, doi:10.15479/AT:IST-2010-0004.

Cerny, Pavol, et al. Simulation Distances. IST Austria, 2010, doi:10.15479/AT:IST-2010-0003.

Cerny, Pavol, et al. Model Checking of Linearizability of Concurrent List Implementations. Vol. 6174, Springer, 2010, pp. 465–79, doi:10.1007/978-3-642-14295-6_41.

Chatterjee, Krishnendu, et al. GIST: A Solver for Probabilistic Games. Vol. 6174, Springer, 2010, pp. 665–69, doi:10.1007/978-3-642-14295-6_57.

Cerny, Pavol, et al. Model Checking of Linearizability of Concurrent List Implementations. IST Austria, 2010, doi:10.15479/AT:IST-2010-0001.

Chatterjee, Krishnendu, and Thomas A. Henzinger. Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. Vol. 6252, Springer, 2010, pp. 1–16, doi:10.1007/978-3-642-15643-4_1.

Chatterjee, Krishnendu, et al. Qualitative Analysis of Partially-Observable Markov Decision Processes. Vol. 6281, Springer, 2010, pp. 258–69, doi:10.1007/978-3-642-15155-2_24.

Wies, Thomas, et al. Forward Analysis of Depth-Bounded Processes. Edited by Luke Ong, vol. 6014, Springer, 2010, pp. 94–108, doi:10.1007/978-3-642-12032-9_8.

Didier, Frédéric, et al. Fast Adaptive Uniformization of the Chemical Master Equation. Vol. 4, no. 6, IEEE, 2009, pp. 118–27, doi:10.1109/HiBi.2009.23.

Henzinger, Thomas A., et al. Formalisms for Specifying Markovian Population Models. Vol. 5797, Springer, 2009, pp. 3–23, doi:10.1007/978-3-642-04420-5_2.

Henzinger, Thomas A., et al. Distributed, Modular HTL. IEEE, 2009, pp. 171–80, doi:10.1109/RTSS.2009.9.

Tripakis, Stavros, et al. “On Relational Interfaces.”10.1145/1629335.1629346__EMSOFT ’09 Proceedings of the Seventh ACM International Conference on Embedded Software, ACM, 2009, pp. 67–76, doi:10.1145/1629335.1629346.

Chatterjee, Krishnendu, et al. Gist: A Solver for Probabilistic Games. IST Austria, 2009, doi:10.15479/AT:IST-2009-0003.

Chatterjee, Krishnendu, et al. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009, doi:10.15479/AT:IST-2009-0002.

Chatterjee, Krishnendu, et al. Qualitative Analysis of Partially-Observable Markov Decision Processes. IST Austria, 2009, doi:10.15479/AT:IST-2009-0001.