<h2>DARTS, Volume 10, Issue 2, ECOOP 2024</h2>
<ul>
<li>
<span class="authors">Karine Even-Mendoza and Raphaël Monat</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.0">10.4230/DARTS.10.2.0</a>
</li>
<li>
<span class="authors">Luca Aceto, Duncan Paul Attard, Adrian Francalanza, and Anna Ingólfsdóttir</span>
<span class="title">Runtime Instrumentation for Reactive Components (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.1">10.4230/DARTS.10.2.1</a>
</li>
<li>
<span class="authors">Steven Arzt, Marc Miltenberger, and Julius Näumann</span>
<span class="title">Dynamically Generating Callback Summaries for Enhancing Static Analysis (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.2">10.4230/DARTS.10.2.2</a>
</li>
<li>
<span class="authors">Luís Carvalho and João Costa Seco</span>
<span class="title">A Language-Based Version Control System for Python (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.3">10.4230/DARTS.10.2.3</a>
</li>
<li>
<span class="authors">Farzaneh Derakhshan, Stephanie Balzer, and Yue Yao</span>
<span class="title">Regrading Policies for Flexible Information Flow Control in Session-Typed Concurrency (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.4">10.4230/DARTS.10.2.4</a>
</li>
<li>
<span class="authors">Aleksandar S. Dimovski</span>
<span class="title">Mutation-Based Lifted Repair of Software Product Lines (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.5">10.4230/DARTS.10.2.5</a>
</li>
<li>
<span class="authors">Vlastimil Dort, Yufeng Li, Ondřej Lhoták, and Pavel Parízek</span>
<span class="title">Pure Methods for roDOT (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.6">10.4230/DARTS.10.2.6</a>
</li>
<li>
<span class="authors">Sam Estep, Wode Ni, Raven Rothkopf, and Joshua Sunshine</span>
<span class="title">Rose: Composable Autodiff for the Interactive Web (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.7">10.4230/DARTS.10.2.7</a>
</li>
<li>
<span class="authors">Philipp Haller, Ayman Hussein, Hernán Melgratti, Alceste Scalas, and Emilio Tuosto</span>
<span class="title">Fair Join Pattern Matching for Actors (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.8">10.4230/DARTS.10.2.8</a>
</li>
<li>
<span class="authors">Elad Kinsbruner, Shachar Itzhaky, and Hila Peleg</span>
<span class="title">Constrictor: Immutability as a Design Concept (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.9">10.4230/DARTS.10.2.9</a>
</li>
<li>
<span class="authors">Nicolas Lagaillardie, Ping Hou, and Nobuko Yoshida</span>
<span class="title">Fearless Asynchronous Communications with Timed Session Types in Rust (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.10">10.4230/DARTS.10.2.10</a>
</li>
<li>
<span class="authors">Senxi Li, Tetsuro Yamazaki, and Shigeru Chiba</span>
<span class="title">InferType: A Compiler Toolkit for Implementing Efficient Constraint-Based Type Inference (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.11">10.4230/DARTS.10.2.11</a>
</li>
<li>
<span class="authors">Liyi Li, Mingwei Zhu, Rance Cleaveland, Alexander Nicolellis, Yi Lee, Le Chang, and Xiaodi Wu</span>
<span class="title">Qafny: A Quantum-Program Verifier (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.12">10.4230/DARTS.10.2.12</a>
</li>
<li>
<span class="authors">Andreas Lööw, Daniele Nantes-Sobrinho, Sacha-Élie Ayoun, Caroline Cronjäger, Nat Karmios, Petar Maksimović, and Philippa Gardner</span>
<span class="title">Compositional Symbolic Execution for Correctness and Incorrectness Reasoning (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.13">10.4230/DARTS.10.2.13</a>
</li>
<li>
<span class="authors">Zeina Migeed and Jens Palsberg</span>
<span class="title">Generalizing Shape Analysis with Gradual Types (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.14">10.4230/DARTS.10.2.14</a>
</li>
<li>
<span class="authors">Nisarg Patel, Dennis Shasha, and Thomas Wies</span>
<span class="title">Verifying Lock-Free Search Structure Templates (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.15">10.4230/DARTS.10.2.15</a>
</li>
<li>
<span class="authors">Dan Plyukhin, Marco Peressotti, and Fabrizio Montesi</span>
<span class="title">Ozone: Fully Out-of-Order Choreographies (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.16">10.4230/DARTS.10.2.16</a>
</li>
<li>
<span class="authors">Jie Qiu, Colin Cai, Sahil Bhatia, Niranjan Hasabnis, Sanjit A. Seshia, and Alvin Cheung</span>
<span class="title">Tenspiler: A Verified-Lifting-Based Compiler for Tensor Operations (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.17">10.4230/DARTS.10.2.17</a>
</li>
<li>
<span class="authors">David Richter, Timon Böhler, Pascal Weisenburger, and Mira Mezini</span>
<span class="title">Compiling with Arrays (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.18">10.4230/DARTS.10.2.18</a>
</li>
<li>
<span class="authors">Amos Robinson and Alex Potanin</span>
<span class="title">Pipit on the Post: Proving Pre- and Post-Conditions of Reactive Systems (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.19">10.4230/DARTS.10.2.19</a>
</li>
<li>
<span class="authors">Stefan Schott, Serena Elisa Ponta, Wolfram Fischer, Jonas Klauke, and Eric Bodden</span>
<span class="title">Java Bytecode Normalization for Code Similarity Analysis (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.20">10.4230/DARTS.10.2.20</a>
</li>
<li>
<span class="authors">Vidush Singhal, Chaitanya Koparkar, Joseph Zullo, Artem Pelenitsyn, Michael Vollmer, Mike Rainey, Ryan Newton, and Milind Kulkarni</span>
<span class="title">Optimizing Layout of Recursive Datatypes with Marmoset (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.21">10.4230/DARTS.10.2.21</a>
</li>
<li>
<span class="authors">Ke Sun, Di Wang, Sheng Chen, Meng Wang, and Dan Hao</span>
<span class="title">Formalizing, Mechanizing, and Verifying Class-Based Refinement Types (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.22">10.4230/DARTS.10.2.22</a>
</li>
<li>
<span class="authors">Martin Vassor and Nobuko Yoshida</span>
<span class="title">Refinements for Multiparty Message-Passing Protocols: Specification-Agnostic Theory and Implementation (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.23">10.4230/DARTS.10.2.23</a>
</li>
<li>
<span class="authors">Ashton Wiersdorf, Stephen Chang, Matthias Felleisen, and Ben Greenman</span>
<span class="title">Type Tailoring (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.24">10.4230/DARTS.10.2.24</a>
</li>
<li>
<span class="authors">David Young, Ziyi Yang, Ilya Sergey, and Alex Potanin</span>
<span class="title">Higher-Order Specifications for Deductive Synthesis of Programs with Pointers (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.25">10.4230/DARTS.10.2.25</a>
</li>
<li>
<span class="authors">Quan Zhou, Sixuan Dang, and Danfeng Zhang</span>
<span class="title">CtChecker: A Precise, Sound and Efficient Static Analysis for Constant-Time Programming (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.26">10.4230/DARTS.10.2.26</a>
</li>
<li>
<span class="authors">Aron Zwaan and Casper Bach Poulsen</span>
<span class="title">Defining Name Accessibility Using Scope Graphs (Artifact)</span>
<a class="doi" href="https://doi.org/10.4230/DARTS.10.2.27">10.4230/DARTS.10.2.27</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing