Abstract is missing.
- Concurrency and Objects Matter! Disentangling the Fabric of Real Operational Processes to Create Digital TwinsWil M. P. van der Aalst. 3-17 [doi]
- Qualitative-Quantitative Reasoning: Thinking Informally About Formal ThingsAlan J. Dix. 18-35 [doi]
- Some Aspects of the Database ResilienceLuis Henrique Bustamante, Ana Teresa C. Martins. 39-46 [doi]
- On the Correctness Problem for SerializabilityJürgen König, Heike Wehrheim. 47-64 [doi]
- A Set Automaton to Locate All Pattern Matches in a TermRick Erkens, Jan Friso Groote. 67-85 [doi]
- Accelerating SpMV Multiplication in Probabilistic Model Checkers Using GPUsMuhammad Hannan Khan, Osman Hassan, Shahid Khan. 86-104 [doi]
- A Divide & Conquer Approach to Conditional Stable Model CheckingYati Phyo, Canh Minh Do, Kazuhiro Ogata 0001. 105-111 [doi]
- Certifying Choreography CompilationLuís Cruz-Filipe, Fabrizio Montesi, Marco Peressotti. 115-133 [doi]
- A Mechanically Verified Theory of ContractsStéphane Kastenbaum, Benoît Boyer, Jean-Pierre Talpin. 134-151 [doi]
- A Complete Semantics of $\mathbb {K}$ and Its Translation to IsabelleLiyi Li, Elsa L. Gunter. 152-171 [doi]
- A New Connective in Natural Deduction, and Its Application to Quantum ComputingAlejandro Díaz-Caro, Gilles Dowek. 175-193 [doi]
- An Incentive Mechanism for Trading Personal Data in Data MarketsSayan Biswas, Kangsoo Jung, Catuscia Palamidessi. 197-213 [doi]
- Assessing Security of Cryptocurrencies with Attack-Defense Trees: Proof of Concept and Future DirectionsJulia Eisentraut, Stephan Holzer, Katharina Klioba, Jan Kretínský, Lukas Pin, Alexander Wagner. 214-234 [doi]
- Compositional Analysis of Protocol Equivalence in the Applied π-Calculus Using Quasi-open BisimilarityRoss Horne, Sjouke Mauw, Semen Yurkov. 235-255 [doi]
- Card-Based Cryptographic Protocols with a Standard Deck of Cards Using Private OperationsYoshifumi Manabe, Hibiki Ono. 256-274 [doi]
- Normalising Lustre Preserves SecuritySanjiva Prasad, R. Madhukar Yerraguntla. 275-292 [doi]
- Learning Probabilistic Automata Using ResidualsWenjing Chu, Shuo Chen, Marcello M. Bonsangue. 295-313 [doi]
- AlCons : Deductive Synthesis of Sorting Algorithms in TheoremaIsabela Dramnesc, Tudor Jebelean. 314-333 [doi]
- Reactive Synthesis from Visibly Register Pushdown AutomataRyoma Senda, Yoshiaki Takata, Hiroyuki Seki. 334-353 [doi]
- ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java ProgramsEmmanuel Hainry, Emmanuel Jeandel, Romain Péchoux, Olivier Zeyen. 357-365 [doi]
- A Calculus for Attribute-Based Memory UpdatesMarino Miculan, Michele Pasqua. 366-385 [doi]
- A Proof Method for Local Sufficient Completeness of Term Rewriting SystemsTomoki Shiraishi, Kentaro Kikuchi, Takahito Aoto 0001. 386-404 [doi]