| Formal Approaches to Secure Compilation: A Survey of Fully Abstract Compilation and Related Work | 4 | 0.39 | 2019 |
| Attached and detached closures in actors. | 0 | 0.34 | 2018 |
| Typed connector families and their semantics. | 0 | 0.34 | 2017 |
| A procedure for splitting data-aware processes and its application to coordination | 3 | 0.36 | 2016 |
| Editorial preface for the JLAMP Special Issue on Formal Methods for Software Product Line Engineering | 3 | 0.39 | 2016 |
| Feature Nets : Behavioural modelling of software product lines | 7 | 0.50 | 2016 |
| Part: An Asynchronous Parallel Abstraction For Speculative Pipeline Computations | 4 | 0.44 | 2016 |
| A formal model of service-oriented dynamic object groups. | 1 | 0.37 | 2016 |
| Implementing a secure abstract machine. | 1 | 0.34 | 2016 |
| Fully abstract trace semantics for protected module architectures | 10 | 0.44 | 2015 |
| The other side of privacy: surveillance in data control | 1 | 0.36 | 2015 |
| A high-level model for an assembly language attacker by means of reflection | 0 | 0.34 | 2015 |
| A Secure Compiler For Ml Modules | 3 | 0.37 | 2015 |
| Secure Compilation to Protected Module Architectures | 37 | 1.16 | 2015 |
| Refraction: Low-Cost Management of Reflective Meta-Data in Pervasive Component-Based Applications | 0 | 0.34 | 2015 |
| Formalizing a Secure Foreign Function Interface | 7 | 0.50 | 2015 |
| Contextual Healing: Privacy through Interpretation Management | 0 | 0.34 | 2015 |
| Operational Semantics for Secure Interoperation | 1 | 0.38 | 2014 |
| \mathrmCPS^2 : A Contextual Privacy Framework for Social Software. | 0 | 0.34 | 2014 |
| Fully abstract trace semantics for low-level isolation mechanisms | 8 | 0.49 | 2014 |
| Scaling Future Software: The Manycore Challenge | 0 | 0.34 | 2014 |
| Secure Compilation of Object-Oriented Components to Protected Module Architectures. | 7 | 0.46 | 2013 |
| Fixing idioms: a recursion primitive for applicative DSLs | 3 | 0.42 | 2013 |
| Monadic abstract interpreters | 4 | 0.41 | 2013 |
| Executable modelling of dynamic software product lines in the ABS language | 0 | 0.34 | 2013 |
| Interactive Interaction Constraints | 3 | 0.40 | 2013 |
| Data Abstraction in Coordination Constraints. | 5 | 0.43 | 2013 |
| Interactive Grouping of Friends in OSN: Towards Online Context Management | 6 | 0.43 | 2012 |
| Formal analysis of policies in wireless sensor network applications | 4 | 0.40 | 2012 |
| Calculating graph algorithms for dominance and shortest path | 4 | 0.41 | 2012 |
| A Procedure For Splitting Processes And Its Application To Coordination | 2 | 0.35 | 2012 |
| Decoupled Execution Of Synchronous Coordination Models Via Behavioural Automata | 8 | 0.48 | 2011 |
| Towards a Theory of Views for Feature Models. | 8 | 0.46 | 2010 |
| Feature Petri Nets. | 0 | 0.34 | 2010 |
| Concurrent objects à la carte | 6 | 0.46 | 2010 |
| Deconstructing R eo | 11 | 0.53 | 2009 |
| Coordination Via Interaction Constraints I: Local Logic | 2 | 0.38 | 2009 |
| A Basic Logic for Reasoning about Connector Reconfiguration | 16 | 0.63 | 2008 |
| Coordination Models Orc and Reo Compared | 7 | 0.47 | 2008 |
| Ownership, Uniqueness, and Immutability | 4 | 0.47 | 2008 |
| Coordination: Reo, Nets, and Logic | 5 | 0.43 | 2007 |
| A complete guide to the future | 111 | 3.13 | 2007 |
| Tribe: a simple virtual class calculus | 22 | 0.89 | 2007 |
| Connector colouring I: Synchronisation and context dependency | 47 | 1.58 | 2006 |
| Reasoning About Connector Reconfiguration II: Basic Reconfiguration Logic | 7 | 0.50 | 2006 |
| Types for hierarchic shapes | 2 | 0.50 | 2006 |
| Controlling object allocation using creation guards | 9 | 0.62 | 2005 |
| UUXML: A Type-Preserving XML Schema-Haskell Data Binding | 11 | 0.73 | 2004 |
| Modelling Coordination in Biological Systems | 12 | 0.68 | 2004 |
