Showing papers by "Luís Caires published in 2007"
20 Aug 2007
TL;DR: A generic type system for the π-calculus is developed which may be instantiated for specific notions of typing by extension with adequate subtyping principles and soundness of the type system is established using a logical predicate technique.
Abstract: We motivate and present a logical semantic approach to types for concurrency and to soundness of related systems. The approach is illustrated by the development of a generic type system for the π-calculus, which may be instantiated for specific notions of typing by extension with adequate subtyping principles. Soundness of our type system is established using a logical predicate technique, based on a compositional spatial logic interpretation of types.
19 citations
TL;DR: The tensions between intensionality and extensionality of spatial observations in distributed systems are discussed, showing that there are natural models where extensional observational equivalences may be characterized by spatial logics, including the composition and void operators.
10 citations
01 Jan 2007
TL;DR: This work proposes a motivation from “first principles” of a small set of abstractions for expressing and analyzing service based systems, and instantiates the model by extending of a fragment of the p-calculus, and shows that behavioral equivalences are congruences for all operators.
Abstract: We propose a motivation from “first principles” of a small set of abstractions for expressing and analyzing service based systems. In particular, we suggest the aspects of distribution, process delegation, communication and context sensitiveness, and loose coupling as specific to the service-oriented computational model. Distinguishing aspects of our model are the adoption of a very simple, context sensitive, message-passing local communication mechanism, and a novel mechanism for handling exceptional behavior. We instantiate our model by extending of a fragment of the p-calculus, and show that behavioral equivalences, defined by strong bisimilarity and weak bisimilarity, are congruences for all operators.
8 citations
03 Sep 2007
2 citations
Book•
01 Jan 2007
TL;DR: In this paper, the authors present an approach to check coverage for infinite collections of timed scenarios in Equational Horn Logic with respect to a fixedpoint calculus for pushingdown games. But they do not discuss the relationship between timed games and timed game structures.
Abstract: Invited Lectures- Mapping the Security Landscape: A Role for Language Techniques- The Saga of the Axiomatization of Parallel Composition- Rule-Based Modelling of Cellular Signalling- Contributed Papers- Making Random Choices Invisible to the Scheduler- Strategy Logic- Solving Games Via Three-Valued Abstraction Refinement- Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness- On Modal Refinement and Consistency- Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems- Decidability Results for Well-Structured Transition Systems with Auxiliary Storage- A Nice Labelling for Tree-Like Event Structures of Degree 3- Causal Message Sequence Charts- Checking Coverage for Infinite Collections of Timed Scenarios- Is Observational Congruence Axiomatisable in Equational Horn Logic?- The Must Preorder Revisited- Topology-Dependent Abstractions of Broadcast Networks- On the Expressive Power of Global and Local Priority in Process Calculi- A Marriage of Rely/Guarantee and Separation Logic- Fair Cooperative Multithreading- Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures- Automatic Derivation of Compositional Rules in Automated Compositional Reasoning- Compositional Event Structure Semantics for the Internal ?-Calculus- Interpreting a Finitary Pi-calculus in Differential Interaction Nets- Mobility Control Via Passports- Coalgebraic Models for Reactive Systems- Reactive Systems over Directed Bigraphs- Asynchronous Games: Innocence Without Alternation- Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes- Strategy Synthesis for Markov Decision Processes and Branching-Time Logics- Timed Concurrent Game Structures- Pushdown Module Checking with Imperfect Information- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages- Temporal Antecedent Failure: Refining Vacuity
2 citations