| Computer Aided Formal Design of Swarm Robotics Algorithms. | 0 | 0.34 | 2021 |
| A Strong Call-By-Need Calculus. | 0 | 0.34 | 2021 |
| On the Semantics of Polychronous Polytimed Specifications | 0 | 0.34 | 2020 |
| Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm. | 5 | 0.43 | 2019 |
| Continuous vs. Discrete Asynchronous Moves - A Certified Approach for Mobile Robots. | 0 | 0.34 | 2019 |
| A Foundational Framework for Certified Impossibility Results with Mobile Robots on Graphs. | 1 | 0.35 | 2018 |
| Brief Announcement Continuous Vs. Discrete Asynchronous Moves: A Certified Approach For Mobile Robots | 0 | 0.34 | 2018 |
| Foundations of strong call by need | 0 | 0.34 | 2017 |
| Certified Gathering of Oblivious Mobile Robots: Survey of Recent Results and Open Problems. | 0 | 0.34 | 2017 |
| The Design and Formalization of Mezzo, a Permission-Based Programming Language | 1 | 0.36 | 2016 |
| Towards a Formal Semantics of the TESL Specification Language. | 0 | 0.34 | 2015 |
| Type Soundness and Race Freedom for Mezzo. | 3 | 0.40 | 2014 |
| Weak optimality, and the meaning of sharing | 0 | 0.34 | 2013 |
| Axiomatic Sharing-via-Labelling. | 0 | 0.34 | 2012 |
| A unified approach to fully lazy sharing | 5 | 0.47 | 2012 |
| On the Implementation of Dynamic Patterns | 1 | 0.38 | 2010 |
| Optimality for dynamic patterns | 1 | 0.37 | 2010 |
| A geometric approach to the problem of unique decomposition of processes | 3 | 0.43 | 2010 |
