Publications related to On Integrating Deductive Synthesis and Verification Systems

MultiModN- Multimodal, Multi-Task, Interpretable Modular Networks

Martin Jaggi, Mary-Anne Hartley, Vinitra Swamy, Jibril Albachir Frej, Thierry Bossy, Thijs Vogels, Malika Satayeva

Predicting multiple real-world tasks in a single model often requires a particularly diverse feature space. Multimodal (MM) models aim to extract the synergistic predictive potential of multiple data types to create a shared feature space with aligned sema ...

2023

Automated Verification of Network Function Binaries

George Candea, Solal Vincenzo Pirelli

Formally verifying the correctness of software network functions (NFs) is necessary for network reliability, yet existing techniques require full source code and mandate the use of specific data structures. We describe an automated technique to verify NF b ...

USENIX Association2022

Virtual ADTs for Portable Metaprogramming

Martin Odersky, Nicolas Alexander Stucki

Scala 3 provides a metaprogramming interface that represents the abstract syntax tree definitions using algebraic data types. To allow the compiler to freely evolve without breaking the metaprogramming interface, we present virtual algebraic data types (or ...

ASSOC COMPUTING MACHINERY2021

Verifying Software Network Functions with No Verification Expertise

George Candea, Solal Vincenzo Pirelli, Rishabh Ramesh Iyer, Luis David Figueiredo Mascarenhas Moreira Pedrosa, Matteo Rizzo

We present the design and implementation of Vigor, a software stack and toolchain for building and running software network middleboxes that are guaranteed to be correct, while preserving competitive performance and developer productivity. Developers write ...

ACM2019

Towards Improved GADT Reasoning in Scala

Lionel Emile Vincent Parreaux, Aleksander Slawomir Boruch-Gruszecki, Paolo Giosuè Giarrusso

Generalized algebraic data types (GADT) have been notoriously difficult to implement correctly in Scala. Both major Scala compilers, Scalac and Dotty, are currently known to have type soundness holes related to them. In particular, covariant GADTs have exp ...

ASSOC COMPUTING MACHINERY2019

Refutation-based synthesis in SMT

Viktor Kuncak, Andrew Joseph Reynolds

We introduce the first program synthesis engine implemented inside an SMT solver. We present an approach that extracts solution functions from unsatisfiability proofs of the negated form of synthesis conjectures. We also discuss novel counterexample-guided ...

SPRINGER2019

Truly abstract interfaces for algebraic data types: the extractor typing problem

Martin Odersky, Nicolas Alexander Stucki, Paolo Giosuè Giarrusso

Pattern matching enables inspecting algebraic data types, but typically prevents hiding the implementation of the matched algebraic data type. In Scala, instead, extractors also allow pattern matching on non-algebraic data types and invoking methods on the ...

2018

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Viktor Kuncak, Mikaël Mayer, Jad Hamza

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...

2017

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On Integrating Deductive Synthesis and Verification Systems

Automated Formal Verification of Software Network Functions

MultiModN- Multimodal, Multi-Task, Interpretable Modular Networks

Automated Verification of Network Function Binaries

Virtual ADTs for Portable Metaprogramming

Scaling Functional Synthesis and Repair

Verifying Software Network Functions with No Verification Expertise

Towards Improved GADT Reasoning in Scala

Refutation-based synthesis in SMT

Truly abstract interfaces for algebraic data types: the extractor typing problem

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Graph Chatbot

Chat with Graph Search

Virtual ADTs for Portable Metaprogramming

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Towards Improved GADT Reasoning in Scala

Automated Formal Verification of Software Network Functions

Verifying Software Network Functions with No Verification Expertise

Refutation-based synthesis in SMT

Automated Verification of Network Function Binaries

Scaling Functional Synthesis and Repair

Truly abstract interfaces for algebraic data types: the extractor typing problem

MultiModN- Multimodal, Multi-Task, Interpretable Modular Networks