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.