[Haskell] APLAS 2024 2nd Call for Participation

[Mirai Ikebuchi]

2nd Call for Participation
APLAS 2024 -- The 22nd Asian Symposium on Programming Languages and Systems
October 22-24, 2024, Kyoto, Japan

       https://conf.researchr.org/home/aplas-2024/
       Early Registration deadline: Sep 1

APLAS 2024 aims to bring together programming language researchers,
practitioners and implementors *worldwide*, to present and discuss the
latest results and exchange ideas in all areas of programming
languages and systems. APLAS 2024 is co-located with the
22nd International Symposium on Automated Technology for Verification
and Analysis (ATVA).

Keynotes

 Albert Cohen (Google)
 Naoki Kobayashi (University of Tokyo: Joint with ATVA 2024)
 Sukyoung Ryu (KAIST, South Korea)

Research Paper Sessions (18 papers)

Student Research Competition and Poster Session

APLAS-NIER post-conference workshop (Oct 25, 2024)


Accepted Papers:

A Formal Verification Framework for Tezos Smart Contracts Based on Symbolic
Execution
Thi Thu Ha Doan, Peter Thiemann

Building A Correct-By-Construction Type Checker for a Dependently Typed Core
Language
Bohdan Liesnikov, Jesper Cockx

Comparing semantic frameworks of dependently-sorted algebraic theories
Benedikt Ahrens, Peter Lefanu Lumsdaine, Paige Randall North

Effective Search Space Pruning for Testing Deep Neural Networks
Bala Rangaya, Eugene Sng, Minh-Thai Trinh

Efficiently Adapting Stateless Model Checking for C11/C++11 to Mixed-Size
Accesses
Shigeyuki Sato, Taiyo Mizuhashi, Genki Kimura, Kenjiro Taura

Explaining Explanations in Probabilistic Logic Programming
German Vidal

Extending the Quantitative Pattern-Matching Paradigm
Sandra Alves, Delia Kesner, Miguel Ramos

Generic Reasoning of the Locally Nameless Representation
Yicheng Ni, Yuting Wang

Hybrid Verification of Declarative Programs with Arithmetic Non-Fail
Conditions
Michael Hanus

Mode-based Reduction from Validity Checking of Fixpoint Logic Formulas to
Test-Friendly Reachability Problem
Hiroyuki Katsura, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato

Non-deterministic, probabilistic, and quantum effects through the lens of
event structures
Vitor Fernandes, Marc de Visme, Benoît Valiron

OBRA: Oracle-based, relational, algorithmic type verification
Lisa Vasilenko, Gilles Barthe, Niki Vazou

On Computational Indistinguishability and Logical Relations
Ugo Dal Lago, Zeinab Galal, Giulia Giusti

Quantum Bisimilarity is a Congruence under Physically Admissible Schedulers
Lorenzo Ceragioli, Fabio Gadducci, Giuseppe Lomurno, Gabriele Tedeschi

Quantum Programming Without the Quantum Physics
Jun Inoue

Random-access lists, from EE to FP
Pierre-Evariste Dagand, Titouan Quennet

Relative Completeness of Incorrectness Separation Logic
Yeonseok Lee, Koji Nakazawa

Type-Based Verification of Connectivity Constraints in Lattice Surgery
Ryo Wakizaka, Atsushi Igarashi, Yasunari Suzuki
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell/attachments/20240826/392f42d0/attachment.html>