From the 1 of 4 linked papers with an AI index.
4 papers
Regularity as seen by Alice and Bob
Omid Yaghoubi, MikoÅaj BojaÅczyk, Aliaume Lopez +1
The paper proposes a unified model that extends Nerode-style characterizations of regularity to functions with arbitrary output domains, using a constant‑communication protocol bet…
Polyregular equivalence is undecidable in higher-order types
MikoÅaj BojaÅczyk, Grzegorz FabiaÅski, RafaÅ StefaÅski
It is open whether equivalence ( f = g ) is decidable for string-to-string polyregular functions. We consider their higher-order extension based on the λ-calculus definition of po…
Polyregular Model Checking
Aliaume Lopez, RafaÅ StefaÅski
We introduce a high-level language with Python-like syntax for string-to-string, polyregular, first-order definable transductions. This language features function calls, boolean va…
A Formally Verified Lightning Network
Grzegorz FabiaÅski, RafaÅ StefaÅski, Orfeas Stefanos Thyfronitis Litos
In this work we use formal verification to prove that the Lightning Network (LN), the most prominent scaling technique for Bitcoin, always safeguards the funds of honest users. We…