Sort by:

• Highly Influential Citations
• Citations
• Acceleration
• Velocity
• Recency

Learn More

Automatic Verification of Erlang-Style Concurrency

• Emanuele D'Osualdo, Jonathan Kochems, C.-H. Luke Ong
• SAS
• 2013

This paper presents an approach to verify safety properties of Erlang-style, higher-order concurrent programs automatically. Inspired by Core Erlang, we introduce λACTOR, a prototypical functional… (More)

Soter: an automatic safety verifier for erlang

• Emanuele D'Osualdo, Jonathan Kochems, C.-H. Luke Ong
• AGERE!@SPLASH
• 2012

This paper presents Soter, a fully-automatic program analyser and verifier for Erlang modules. The fragment of Erlang accepted by Soter includes the higher-order functional constructs and all the key… (More)

A Type System for proving Depth Boundedness in the pi-calculus

• Emanuele D'Osualdo, C.-H. Luke Ong
• ArXiv
• 2015

The depth-bounded fragment of the π-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable.… (More)

Verification of message passing concurrent systems

• Emanuele D'Osualdo
• 2015

This dissertation is concerned with the development of fully-automatic methods of veri cation, for message-passing based concurrent systems. In the rst part of the thesis we focus on Erlang, a… (More)

On Hierarchical Communication Topologies in the pi-calculus

• Emanuele D'Osualdo, C.-H. Luke Ong
• ESOP
• 2016

This paper is concerned with the shape invariants satisfied by the communication topology of π-terms, and the automatic inference of these invariants. A π-term P is hierarchical if there is a finite… (More)

TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs

• Emanuele D'Osualdo, Azadeh Farzan, Philippa Gardner, Julian Sutherland
• ArXiv
• 2019

We introduce TaDA Live, a separation logic for reasoning compositionally about the termination of fine-grained concurrent programs. We illustrate the subtlety of our reasoning using a spin lock and a… (More)

Deciding Secrecy of Security Protocols for an Unbounded Number of Sessions: The Case of Depth-Bounded Processes

• Emanuele D'Osualdo, C.-H. Luke Ong, Alwen Tiu
• IEEE 30th Computer Security Foundations Symposium…
• 2017

We introduce a new class of security protocols with an unbounded number of sessions and unlimited fresh data for which the problem of secrecy is decidable. The only constraint we place on the class… (More)

First-order logic with reachability for infinite-state systems

• Emanuele D'Osualdo, Roland Meyer, Georg Zetzsche
• 31st Annual ACM/IEEE Symposium on Logic in…
• 2016

First-order logic with the reachability predicate (FO[R]) is an important means of specification in system analysis. Its decidability status is known for some individual types of infinite-state… (More)

• ‹
• 1
• ›