Publications related to Laboratory for Automated Reasoning and Analysis

Exact Synthesis of Boolean Functions in Majority-of-five Forms

Giovanni De Micheli, Mathias Soeken, Winston Jason Haaswijk, Zhufei Chu

Recent studies show that majority-based logic synthesis is beneficial for both traditional and nanotechnology digital designs. However, most of the existing synthesis algorithms for majority logic generate majority-of-three (M-3) networks. The optimization ...

IEEE2019

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019

Software training for the next generation of physicists: joint experience of LHCb and ALICE

Violaine Bellée

The need for good software training is essential in the HEP community. Unfortunately, current training is non -homogeneous and the definition of a common baseline is unclear, making it difficult for newcomers to proficiently join large collaborations such ...

E D P SCIENCES2019

On the Number of Containments in P-free Families

Abhishek Methuku

A subfamily {F-1, F-2, ..., F-vertical bar P vertical bar} subset of F is a copy of the poset P if there exists a bijection i : P -> {F-1, F-2, ..., F-vertical bar P vertical bar}, such that p

Springer2019

Structural Rewriting in XOR-Majority Graphs

Giovanni De Micheli, Mathias Soeken, Zhufei Chu

In this paper, we present a structural rewriting method for a recently proposed XOR-Majority graph (XMG), which has exclusive-OR (XOR), majority-of-three (MAJ), and inverters as primitives. XMGs are an extension of Majority-Inverter Graphs (MIGs). Previous ...

ASSOC COMPUTING MACHINERY2019

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

On the Hardness of the Strongly Dependent Decision Problem

Martin Biely

We present necessary and sufficient conditions for solving the strongly dependent decision (SDD) problem in various distributed systems. Our main contribution is a novel characterization of the SDD problem based on point-set topology. For partially synchro ...

ASSOC COMPUTING MACHINERY2019

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

A Hybrid Method for Spectral Translation Equivalent Boolean Functions

Giovanni De Micheli, Mathias Soeken, Eleonora Testa

The equivalence of Boolean functions with respect to five invariance (aka translation) operations has been well considered with respect to the Rademacher-Walsh spectral domain. In this paper, we introduce a hybrid approach that uses both the Reed-Muller an ...

IEEE2019

Exact Synthesis of LTL Properties from Traces

Heinz Riener

We present an exact approach to synthesize temporal-logic formulas in linear temporal logic (LTL) from a set of given positive and negative example traces. Our approach uses topology structures, in particular partial DAGs, to partition the search space int ...

IEEE2019

Laboratory for Automated Reasoning and Analysis

Graph Chatbot

Chat with Graph Search

Exact Synthesis of Boolean Functions in Majority-of-five Forms

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Software training for the next generation of physicists: joint experience of LHCb and ALICE

On the Number of Containments in P-free Families

Structural Rewriting in XOR-Majority Graphs

Verifying Software Network Functions with No Verification Expertise

On the Hardness of the Strongly Dependent Decision Problem

Towards Improved GADT Reasoning in Scala

A Hybrid Method for Spectral Translation Equivalent Boolean Functions

Exact Synthesis of LTL Properties from Traces

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Software training for the next generation of physicists: joint experience of LHCb and ALICE

Towards Improved GADT Reasoning in Scala

Verifying Software Network Functions with No Verification Expertise

On the Hardness of the Strongly Dependent Decision Problem

Structural Rewriting in XOR-Majority Graphs

Exact Synthesis of LTL Properties from Traces

A Hybrid Method for Spectral Translation Equivalent Boolean Functions

Exact Synthesis of Boolean Functions in Majority-of-five Forms

On the Number of Containments in P-free Families