output
20032024
most citedDemystifying Reachability in Vector Addition Systems

88 citations

researchers with a paper here
collaborating institutions
Showing 2020Show all

6 papers · 1 filter

cs.LO2020★ 2 cited

Type safety of rewrite rules in dependent types

Frédéric Blanqui

The expressiveness of dependent type theory can be extended by identifying types modulo some additional computation rules. But, for preserving the decidability of type-checking or…

cs.LO2020

Synthesizing safe coalition strategies

Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar

Concurrent games with a fixed number of agents have been thoroughly studied, with various solution concepts and objectives for the agents. In this paper, we consider concurrent gam…

cs.LG2020★ 5 cited

Property-Directed Verification of Recurrent Neural Networks

Igor Khmelnitsky, Daniel Neider, Rajarshi Roy +6

This paper presents a property-directed approach to verifying recurrent neural networks (RNNs). To this end, we learn a deterministic finite automaton as a surrogate model from a g…

cs.LO2020

Decisiveness for countable MDPs and insights for NPLCSs and POMDPs

Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye +2

Markov chains and Markov decision processes (MDPs) are well-established probabilistic models. While finite Markov models are well-understood, analysing their infinite counterparts…

cs.LO2020★ 6 cited

A Complete Axiomatisation for Quantifier-Free Separation Logic

Stéphane Demri, Étienne Lozes, Alessio Mansutti

We present the first complete axiomatisation for quantifier-free separation logic. The logic is equipped with the standard concrete heaplet semantics and the proof system has no ex…

cs.DC2020★ 2 cited

Message complexity of population protocols

Talley Amir, James Aspnes, David Doty +2

The standard population protocol model assumes that when two agents interact, each observes the entire state of the other agent. We initiate the study of $\textit{message complexit…