


default search action
APLAS 2024, Kyoto, Japan
- Oleg Kiselyov
:
Programming Languages and Systems - 22nd Asian Symposium, APLAS 2024, Kyoto, Japan, October 22-24, 2024, Proceedings. Lecture Notes in Computer Science 15194, Springer 2025, ISBN 978-981-97-8942-9
Type Theory and Semantic Frameworks
- Benedikt Ahrens
, Peter LeFanu Lumsdaine
, Paige Randall North
:
Comparing Semantic Frameworks for Dependently-Sorted Algebraic Theories. 3-22 - Titouan Quennet, Pierre-Évariste Dagand:
Random-Access Lists, from EE to FP. 23-41 - Yicheng Ni
, Yuting Wang
:
Generic Reasoning of the Locally Nameless Representation. 42-62 - Bohdan Liesnikov
, Jesper Cockx
:
Building a Correct-by-Construction Type Checker for a Dependently Typed Core Language. 63-83 - Sandra Alves, Delia Kesner, Miguel Ramos
:
Extending the Quantitative Pattern-Matching Paradigm. 84-105
Probabilistic and Declarative Programming
- Michael Hanus
:
Hybrid Verification of Declarative Programs with Arithmetic Non-fail Conditions. 109-129 - Germán Vidal:
Explaining Explanations in Probabilistic Logic Programming. 130-152
Quantum Computation
- Jun Inoue
:
Quantum Programming Without the Quantum Physics. 155-175 - Lorenzo Ceragioli
, Fabio Gadducci
, Giuseppe Lomurno
, Gabriele Tedeschi
:
Quantum Bisimilarity Is a Congruence Under Physically Admissible Schedulers. 176-195 - Vítor Fernandes, Marc de Visme, Benoît Valiron:
Non-deterministic, Probabilistic, and Quantum Effects Through the Lens of Event Structures. 196-215 - Ryo Wakizaka
, Yasunari Suzuki, Atsushi Igarashi
:
Type-Based Verification of Connectivity Constraints in Lattice Surgery. 216-237
Logical Relations
- Ugo Dal Lago
, Zeinab Galal, Giulia Giusti
:
On Computational Indistinguishability and Logical Relations. 241-263 - Yeonseok Lee
, Koji Nakazawa
:
Relative Completeness of Incorrectness Separation Logic. 264-282 - Elizaveta Vasilenko
, Niki Vazou
, Gilles Barthe
:
OBRA: Oracle-Based, Relational, Algorithmic Type Verification. 283-302
Verification
- Thi Thu Ha Doan
, Peter Thiemann
:
A Formal Verification Framework for Tezos Smart Contracts Based on Symbolic Execution. 305-324 - Hiroyuki Katsura
, Naoki Kobayashi
, Ken Sakayori
, Ryosuke Sato
:
Mode-based Reduction from Validity Checking of Fixpoint Logic Formulas to Test-Friendly Reachability Problem. 325-345 - Shigeyuki Sato
, Taiyo Mizuhashi
, Genki Kimura, Kenjiro Taura
:
Efficiently Adapting Stateless Model Checking for C11/C++11 to Mixed-Size Accesses. 346-364 - Bala Rangayah, Eugene Sng, Minh-Thai Trinh
:
Effective Search Space Pruning for Testing Deep Neural Networks. 365-387

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.