---
title: "Electronic Proceedings in Theoretical Computer Science 2025 —"
description: "All 279 papers of Electronic Proceedings in Theoretical Computer Science 2025 · page 2 of 3, the most cited first; those with our summary link to it."
canonical: "https://research.elamur.ai/free/en/venues/electronic-proceedings-in-theoretical-computer-science/2025/papers/page/2/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/venues/electronic-proceedings-in-theoretical-computer-science/2025/papers/page/2/)

[home](https://md.research.elamur.ai/free/en/) / [venues](https://md.research.elamur.ai/free/en/venues/) / [Electronic Proceedings in Theoretical…](https://md.research.elamur.ai/free/en/venues/electronic-proceedings-in-theoretical-computer-science/) / [2025](https://md.research.elamur.ai/free/en/venues/electronic-proceedings-in-theoretical-computer-science/2025/) / [papers](https://md.research.elamur.ai/free/en/venues/electronic-proceedings-in-theoretical-computer-science/2025/papers/) / page 2

# Electronic Proceedings in Theoretical Computer Science 2025: all accepted papers

279 papers · page 2 of 3 · the most cited first · [← Electronic Proceedings in Theoretical Computer Science 2025](https://md.research.elamur.ai/free/en/venues/electronic-proceedings-in-theoretical-computer-science/2025/)

[← prev](https://md.research.elamur.ai/free/en/venues/electronic-proceedings-in-theoretical-computer-science/2025/papers/) [1](https://md.research.elamur.ai/free/en/venues/electronic-proceedings-in-theoretical-computer-science/2025/papers/) **2** [3](https://md.research.elamur.ai/free/en/venues/electronic-proceedings-in-theoretical-computer-science/2025/papers/page/3/) [next →](https://md.research.elamur.ai/free/en/venues/electronic-proceedings-in-theoretical-computer-science/2025/papers/page/3/)

101. **[Bifurcation Logic: Separation Through Ordering ↗](https://doi.org/10.4204/eptcs.437.29)**Didier Galmiche, Timo Lang, Daniel Méry et al.
102. **[Bisimilarity and Simulatability of Processes Parameterized by Join Interactions ↗](https://doi.org/10.4204/eptcs.425.4)**Clemens Armin Grabmayer, Maurizio Murgia
103. **[Bridging Threat Models and Detections: Formal Verification via CADP ↗](https://doi.org/10.4204/eptcs.427.5)**Dumitru Bogdan Prelipcean, Cătălin Dima
104. **[Building Automated Reasoning Tools using the FreqHorn Framework ↗](https://doi.org/10.4204/eptcs.434.1)**Grigory Fedyukovich
105. **[CHCVerif: A Portfolio-Based Solver for Constrained Horn Clauses ↗](https://doi.org/10.4204/eptcs.434.6)**Mihály Dobos-Kovács, Levente Bajczi, András Vörös
106. **[Causality Without Causal Models ↗](https://doi.org/10.4204/eptcs.437.16)**Joseph Yehuda Halpern, Rafael Pass
107. **[Characterization of Lattice Properties Within Modal Extensions ↗](https://doi.org/10.4204/eptcs.430.3)**Alfredo Roque Freire, Manuel A. Martins
108. **[Characterizing the Exponential-Space Hierarchy Via Partial Fixpoints ↗](https://doi.org/10.4204/eptcs.435.7)**Florian Bruse, David Kronenberger, Martin Lange
109. **[Choosing What Game to Play without Selecting Equilibria: Inferring Safe (Pareto) Improvements in Binary Constraint Structures ↗](https://doi.org/10.4204/eptcs.437.22)**Caspar Oesterheld, Vincent Conitzer
110. **[Choreographies as Macros ↗](https://doi.org/10.4204/eptcs.420.2)**Alexander Bohosian, Andrew K. Hirsch
111. **[Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order ↗](https://doi.org/10.4204/eptcs.426.11)**Alastair A. Abbott, Mehdi Mhalla, Pierre Pocreau
112. **[CoLF Logic Programming as Infinitary Proof Exploration ↗](https://doi.org/10.4204/eptcs.431.3)**Zhibo Chen, Frank Pfenning
113. **[CoMPSeT: A Framework for Comparing Multiparty Session Types ↗](https://doi.org/10.4204/eptcs.433.5)**Telmo Ribeiro, José Proença, Mário Florido
114. **[Combs, Causality and Contractions in Atomic Markov Categories ↗](https://doi.org/10.4204/eptcs.429.4)**Dario Stein, Márk Széles
115. **[Common Knowledge, Sailboats, and Publicity ↗](https://doi.org/10.4204/eptcs.437.18)**Sena Bozdag, Olivier Roy
116. **[Common p-Belief with Plausibility Measures: Extended Abstract ↗](https://doi.org/10.4204/eptcs.437.10)**Eric Pacuit, Leo Yang
117. **[Commonsense Reasoning-Aided Autonomous Vehicle Systems ↗](https://doi.org/10.4204/eptcs.416.36)**Keegan Kimbrell
118. **[Comparing State-Representations for DEL Model Checking ↗](https://doi.org/10.4204/eptcs.437.21)**Gregor Behnke, Malvin Gattinger, Avijeet Ghosh et al.
119. **[Complexity of Łukasiewicz Modal Probabilistic Logics ↗](https://doi.org/10.4204/eptcs.437.28)**Daniil Kozhemiachenko, Igor Sedlár
120. **[Computational methods for Dynamic Answer Set Programming ↗](https://doi.org/10.4204/eptcs.416.32)**Susana Hahn
121. **[Conditionals Based on Selection Functions, Modal Operators and Probabilities ↗](https://doi.org/10.4204/eptcs.437.14)**Tommaso Flaminio, Lluı́s Godo, Gluliano Rosella
122. **[Contributions to the Theory of Clifford-Cyclotomic Circuits ↗](https://doi.org/10.4204/eptcs.426.9)**Linh Dinh, Neil J. Ross
123. **[Copy-composition for Probabilistic Graphical Models ↗](https://doi.org/10.4204/eptcs.429.8)**Toby St Clere Smithe
124. **[Counterfactual Explanations as Plans ↗](https://doi.org/10.4204/eptcs.416.14)**Vaishak Belle
125. **[Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic ↗](https://doi.org/10.4204/eptcs.435.3)**Bahareh Afshari, Johannes Kloibhofer
126. **[Cyclic Proofs for iGL via Corecursion ↗](https://doi.org/10.4204/eptcs.435.2)**Borja Sierra Miranda
127. **[Dagger-Drazin Inverses ↗](https://doi.org/10.4204/eptcs.426.12)**Robin Cockett, Jean-Simon Pacaud Lemay, Priyaa Varshinee Srinivasan
128. **[Decoupling Adaptive Control in TeaStore ↗](https://doi.org/10.4204/eptcs.438.3)**Eddy Truyen
129. **[Dependently Sorted Nominal Signatures ↗](https://doi.org/10.4204/eptcs.431.6)**Maribel Fernández, Miguel Pagano, Nóra Szász et al.
130. **[Early Validation of High-level Requirements on Cyber-Physical Systems ↗](https://doi.org/10.4204/eptcs.416.40)**Ondřej Vašíček
131. **[Extended Abstract: Mutable Objects with Several Implementations ↗](https://doi.org/10.4204/eptcs.423.7)**Matt Kaufmann, Yahya Sohail, Warren A. Hunt
132. **[Extended Abstract: Partial-encapsulate and Its Support for Floating-point Operations in ACL2 ↗](https://doi.org/10.4204/eptcs.423.6)**Matt Kaufmann, J Strother Moore
133. **[Fancy Some Chips for Your TeaStore? Modeling the Control of an Adaptable Discrete System ↗](https://doi.org/10.4204/eptcs.438.4)**Anna Gallone, Simon Bliudze, Sophie Cerf et al.
134. **[Fast Trigonometric Functions using the RLIBM Approach ↗](https://doi.org/10.4204/eptcs.432.9)**Sehyeok Park, Santosh Nagarakatte
135. **[Faster Game Solving by Fixpoint Acceleration ↗](https://doi.org/10.4204/eptcs.435.6)**Daniel Hausmann
136. **[Fault-Tolerant Multiparty Session Types with Global Escape Loops ↗](https://doi.org/10.4204/eptcs.433.3)**Lukas Bartl, Julian Linne, Kirstin Peters
137. **[Fibrational Perspectives on Determinization of Finite-State Automata ↗](https://doi.org/10.4204/eptcs.429.11)**Thea Li
138. **[Finding Regular Herbrand Models for CHCs using Answer Set Programming ↗](https://doi.org/10.4204/eptcs.434.3)**Gregoire Maire, Thomas Genet
139. **[Formal Verification of COO to CSR Sparse Matrix Conversion (Invited Paper) ↗](https://doi.org/10.4204/eptcs.432.3)**Andrew W. Appel
140. **[Formal Verification of Local Robustness of a Classification Algorithm for a Spatial Use Case ↗](https://doi.org/10.4204/eptcs.436.4)**Delphine Longuet, Amira Elouazzani, Alejandro Penacho Riveiros et al.
141. **[Foundational End-to-end Verification of Numerical Programs ↗](https://doi.org/10.4204/eptcs.432.1)**Andrew W. Appel
142. **[Fuzzy Lattice-based Description Logic ↗](https://doi.org/10.4204/eptcs.421.3)**Yiwen Ding, Krishna Manoorkar
143. **[GNU Aris: a web application for students ↗](https://doi.org/10.4204/eptcs.419.3)**Saksham Attri, Zoltán Kovács, Aaron Windischbauer
144. **[GView: A Survey of Binary Forensics via Visual, Semantic, and AI-Enhanced Analysis ↗](https://doi.org/10.4204/eptcs.427.9)**Raul Zaharia, Dragoş Teodor Gavriluţ, Gheorghiţă Mutu
145. **[Generalised Reachability Games Revisited ↗](https://doi.org/10.4204/eptcs.428.7)**Sougata Bose, Daniel Hausmann, Soumyajit Paul et al.
146. **[Generalized Gradient Descent is a Hypergraph Functor ↗](https://doi.org/10.4204/eptcs.429.12)**Tyler Hanks, James Fairbanks, Matthew Klawonn
147. **[Generating Plans for Belief-Desire-Intention (BDI) Agents Using Alternating-Time Temporal Logic (ATL) ↗](https://doi.org/10.4204/eptcs.428.10)**Dylan Léveillé
148. **[Geospatial Trajectory Generation via Efficient Abduction: Deployment for Independent Testing ↗](https://doi.org/10.4204/eptcs.416.24)**Divyagna Bavikadi, Dyuman Aditya, Devendra Parkar et al.
149. **[Graphical Conditions for the Existence, Unicity and Number of Regular Models ↗](https://doi.org/10.4204/eptcs.416.16)**Van-Giang Trinh, Belaïd Benhamou, Sylvain Soliman et al.
150. **[GrappaRE - A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions ↗](https://doi.org/10.4204/eptcs.417.4)**Mattia De Rosa, Mark Minas
151. **[Ground Stratification for a Logic of Definitions with Induction ↗](https://doi.org/10.4204/eptcs.431.1)**Nathan Guermond, Gopalan Nadathur
152. **[How Concise are Chains of co-Büchi Automata? ↗](https://doi.org/10.4204/eptcs.428.9)**Rüdiger Ehlers
153. **[Hybrid Answer Set Programming: Foundations and Applications ↗](https://doi.org/10.4204/eptcs.416.38)**Nicolas Rühling
154. **[Hyperintensional Intention ↗](https://doi.org/10.4204/eptcs.437.8)**Daniil Khaitovich, Aybüke Özgün
155. **[Idefix-Closed Languages and Their Application in Contextual Grammars ↗](https://doi.org/10.4204/eptcs.422.1)**Marvin Ködding, Bianca Truthe
156. **[Impure Simplicial Complex and Term-Modal Logic with Assignment Operators ↗](https://doi.org/10.4204/eptcs.437.31)**Yuanzhe Yang
157. **[Input-Driven Pushdown Automata with Translucent Input Letters ↗](https://doi.org/10.4204/eptcs.422.3)**Martin Kutrib, Andreas Malcher, Matthias Wendlandt
158. **[Inserting Planar-Measured Qubits into MBQC Patterns while Preserving Flow ↗](https://doi.org/10.4204/eptcs.426.4)**Miriam Backens, Thomas Perez
159. **[Integrated Formal Methods for the Verification of Cyber-Physical and Autonomous Systems ↗](https://doi.org/10.4204/eptcs.436.1)**Paula Herber
160. **[LP-LM: No Hallucinations in Question Answering with Logic Programming ↗](https://doi.org/10.4204/eptcs.416.5)**Katherine Wu, Yanhong A. Liu
161. **[Learners are Almost Free Compact Closed ↗](https://doi.org/10.4204/eptcs.429.3)**Mitchell Riley
162. **[Linear-Time Graph Programs without Preconditions ↗](https://doi.org/10.4204/eptcs.417.3)**Ziad Ismaili Alaoui, Detlef Plump
163. **[Logic of (Common or Distributed)* Knowledge ↗](https://doi.org/10.4204/eptcs.437.24)**Chenwei Shi
164. **[Logic of Autonomous Dynamical Systems ↗](https://doi.org/10.4204/eptcs.436.2)**André Platzer
165. **[Logical foundations of Smart Contracts ↗](https://doi.org/10.4204/eptcs.416.35)**Kalonji Kalala
166. **[Mailbox Types: From Processes to Programming (Extended Abstract) ↗](https://doi.org/10.4204/eptcs.428.1)**Simon Fowler
167. **[Maths with Coq in L1, a pedagogical experiment ↗](https://doi.org/10.4204/eptcs.419.7)**Marie Kerjean, Micaela Mayero, Pierre Rousselin
168. **[Maximum Entropy and Bayesian Conditioning Under Extended Space ↗](https://doi.org/10.4204/eptcs.437.12)**Boning Yu
169. **[Mechanism Design under Unawareness - Extended Abstract ↗](https://doi.org/10.4204/eptcs.437.1)**Kym Pram, Burkhard C. Schipper
170. **[Mechanizing Olver's Error Arithmetic ↗](https://doi.org/10.4204/eptcs.432.6)**Max Fan, Ariel Kellison, Samuel D. Pollard
171. **[Modal Logic for Simulation, Refinement, and Mutual Ignorance ↗](https://doi.org/10.4204/eptcs.437.30)**Hans van Ditmarsch, Tim French, Rustam Galimullin et al.
172. **[Model-Driven Rapid Prototyping for Control Algorithms with the GIPS Framework (System Description) ↗](https://doi.org/10.4204/eptcs.417.9)**Maximilian Kratz, Sebastian Ehmes, Philipp Maximilian Menzel et al.
173. **[Modelling Privacy Compliance in Cross-border Data Transfers with Bigraphs ↗](https://doi.org/10.4204/eptcs.417.2)**Ebtihal Althubiti, Michele Sevegnani
174. **[Monoid Structures on Indexed Containers ↗](https://doi.org/10.4204/eptcs.430.4)**Michele De Pascalis, Tarmo Uustalu, Niccolò Veltrì
175. **[Muddy Waters ↗](https://doi.org/10.4204/eptcs.437.33)**Hans van Ditmarsch
176. **[Mutation Testing for Industrial Robotic Systems ↗](https://doi.org/10.4204/eptcs.436.5)**Marcela G. dos Santos, Sylvain Hallé, Fábio dos Santos Petrillo
177. **[My Attempts To Save Politeness ↗](https://doi.org/10.4204/eptcs.430.0.3)**Yoni Zohar
178. **[Navigating the Python Type Jungle ↗](https://doi.org/10.4204/eptcs.427.6)**Andrei Nacu, Dorel Lucanu
179. **[Nominal Algebraic-Coalgebraic Data Types, with Applications to Infinitary Lambda-Calculi ↗](https://doi.org/10.4204/eptcs.435.5)**Rémy Cerda
180. **[Nominal Equational Rewriting and Narrowing ↗](https://doi.org/10.4204/eptcs.421.5)**Maurício Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho et al.
181. **[Nominal Sets in Rocq ↗](https://doi.org/10.4204/eptcs.430.5)**Fabrício Sanches Paranhos, Daniel Ventura
182. **[On Automating Proofs of Multiplier Adder Trees using the RTL Books ↗](https://doi.org/10.4204/eptcs.423.5)**Mayank Manjrekar
183. **[On Repetitive Finite Automata with Translucent Words ↗](https://doi.org/10.4204/eptcs.422.5)**František Mráz, Friedrich Otto
184. **[On Traces in Categories of Contractions ↗](https://doi.org/10.4204/eptcs.426.3)**Aaron David Fairbanks, Peter Selinger
185. **[On a Dependently Typed Encoding of Matching Logic ↗](https://doi.org/10.4204/eptcs.427.1)**Ádám Kurucz, Péter Bereczky, Dániel Horpácsi
186. **[On a Generalization of the Christoffel Tree: Epichristoffel Trees ↗](https://doi.org/10.4204/eptcs.422.2)**Abhishek Krishnamoorthy, Robinson Thamburaj, Durairaj Gnanaraj Thomas
187. **[On graded monads, distributive laws and costrong functors ↗](https://doi.org/10.4204/eptcs.427.10)**Adriana Balan, Silviu-George Pantelimon
188. **[On the Cost of Software Misbehaviours ↗](https://doi.org/10.4204/eptcs.420.0.1)**Giovanni Bernardi
189. **[On the Expressiveness of MPST ↗](https://doi.org/10.4204/eptcs.425.1)**Kirstin Peters
190. **[Optimal Information Design in Sender-Receiver Cheap Talk Interactions ↗](https://doi.org/10.4204/eptcs.437.5)**Itai Arieli, Ivan Geffner, Moshe Tennenholtz
191. **[Orchestration of Music by Grammar Systems ↗](https://doi.org/10.4204/eptcs.422.4)**Jozef Makiš, Alexander Meduna, Zbyněk Křivka
192. **[Order-Sorted Intensional Logic: Expressing Subtyping Polymorphism with Typing Assertions and Quantification over Concepts ↗](https://doi.org/10.4204/eptcs.416.22)**Đorđe Marković, Marc Denecker
193. **[Organizing Physics with Open Energy-Driven Systems ↗](https://doi.org/10.4204/eptcs.429.16)**Matteo Capucci, Owen Lynch, David I. Spivak
194. **[Parallelizable Feynman-Kac Models for Universal Probabilistic Programming ↗](https://doi.org/10.4204/eptcs.428.8)**Michele Boreale, Luisa Collodi
195. **[Pattern Runs on Matter: The Free Monad Monad as a Module over the Cofree Comonad Comonad ↗](https://doi.org/10.4204/eptcs.429.1)**Sophie Libkind, David I. Spivak
196. **[Pearce's Characterisation in an Epistemic Domain ↗](https://doi.org/10.4204/eptcs.416.18)**Ezgi Iraz Su
197. **[Pedagogy of Teaching Pointers in the C Programming Language using Graph Transformations ↗](https://doi.org/10.4204/eptcs.417.7)**Adwoa Donyina, Reiko Heckel
198. **[Pleasant Imperative Program Proofs with GallinaC ↗](https://doi.org/10.4204/eptcs.427.2)**Frédéric Fort, David Nowak, Vlad Rusu
199. **[Polynomial Fingerprinting for Trees and Formulas ↗](https://doi.org/10.4204/eptcs.427.3)**Mihai Prunescu
200. **[Presenting Profunctors ↗](https://doi.org/10.4204/eptcs.429.5)**Gabriel Goren-Roig, Joshua Meyers, Emilio Minichiello

[← prev](https://md.research.elamur.ai/free/en/venues/electronic-proceedings-in-theoretical-computer-science/2025/papers/) [1](https://md.research.elamur.ai/free/en/venues/electronic-proceedings-in-theoretical-computer-science/2025/papers/) **2** [3](https://md.research.elamur.ai/free/en/venues/electronic-proceedings-in-theoretical-computer-science/2025/papers/page/3/) [next →](https://md.research.elamur.ai/free/en/venues/electronic-proceedings-in-theoretical-computer-science/2025/papers/page/3/)

- [← back to](https://md.research.elamur.ai/free/en/venues/electronic-proceedings-in-theoretical-computer-science/2025/) — Electronic Proceedings in Theoretical Computer Science 2025