activity
20182024
most citedRusty Variation: Deadlock-free Sessions with Failure in Rust

16 citations · 28 across the 7 of their papers we have counts for

collaborators

7 papers

cs.AI2024★ 6 cited

Marabou 2.0: A Versatile Formal Analyzer of Neural Networks

Haoze Wu, Omri Isac, Aleksandar Zeljić +14

This paper serves as a comprehensive system description of version 2.0 of the Marabou framework for formal analysis of neural networks. We discuss the tool's architectural design a…

cs.CL2022

Why Robust Natural Language Understanding is a Challenge

Marco Casadio, Ekaterina Komendantskaya, Verena Rieser +4

With the proliferation of Deep Machine Learning into real-life applications, a particular property of this technology has been brought to attention: robustness Neural Networks noto…

cs.LG2022★ 3 cited

Vehicle: Interfacing Neural Network Verifiers with Interactive Theorem Provers

Matthew L. Daggitt, Wen Kokke, Robert Atkey +2

Verification of neural networks is currently a hot topic in automated theorem proving. Progress has been rapid and there are now a wide range of tools available that can verify pro…

cs.PL2019★ 16 cited

Rusty Variation: Deadlock-free Sessions with Failure in Rust

Wen Kokke

Rusty Variation (RV) is a library for session-typed communication in Rust which offers strong compile-time correctness guarantees. Programs written using RV are guaranteed to respe…

cs.LO2019

Towards Races in Linear Logic

Wen Kokke, J. Garrett Morris, Philip Wadler

Process calculi based in logic, such as DILL and CP, provide a foundation for deadlock-free concurrent programming, but exclude non-determinism and races. HCP is a reformulation…

cs.LO2019★ 2 cited

Taking Linear Logic Apart

Wen Kokke, Fabrizio Montesi, Marco Peressotti

Process calculi based on logic, such as DILL and CP, provide a foundation for deadlock-free concurrent programming. However, in previous work, there is a mismatch between the ru…

cs.LO2018★ 1 cited

Better Late Than Never: A Fully Abstract Semantics for Classical Processes

Wen Kokke, Fabrizio Montesi, Marco Peressotti

We present Hypersequent Classical Processes (HCP), a revised interpretation of the "Proofs as Processes" correspondence between linear logic and the π-calculus initially proposed b…