28 Result(s)
within
English
Logics and Meanings of Programs
Vladimiro Sassone
Chapter
-
Chapter and Conference Paper
Descriptive Types for Linked Data Resources
This work introduces the notion of descriptive ty**. Type systems are typically prescriptive in the sense that they prescribe a space of permitted programs. In contrast, descriptive types assigned to resourc...
-
Chapter and Conference Paper
Trust in Anonymity Networks
Anonymity is a security property of paramount importance, as we move steadily towards a wired, online community. Its import touches upon subjects as different as eGovernance, eBusiness and eLeisure, as well as...
-
Chapter
Models of Computation: A Tribute to Ugo Montanari’s Vision
Ugo’s research activity in the area ofModels of Computation (MoC, for short) has been prominent, influential and broadly scoped. Ugo’s trademark is that undefinable ability to understand and distill computatio...
-
Chapter and Conference Paper
Structural Operational Semantics for Stochastic Process Calculi
A syntactic framework called SGSOS, for defining well-behaved Markovian stochastic transition systems, is introduced by analogy to the GSOS congruence format for nondeterministic processes. Stochastic bisimila...
-
Chapter and Conference Paper
Towards a Formal Framework for Computational Trust
We define a mathematical measure for the quantitative comparison of probabilistic computational trust systems, and use it to compare a well-known class of algorithms based on the so-called beta model. The main...
-
Chapter and Conference Paper
Semantic Barbs and Biorthogonality
We use the framework of biorthogonality to introduce a novel semantic definition of the concept of barb (basic observable) for process calculi. We develop a uniform basic theory of barbs and demonstrate its ro...
-
Chapter and Conference Paper
Labels from Reductions: Towards a General Theory
We consider open terms and parametric rules in the context of the systematic derivation of labelled transitions from reduction systems.
-
Chapter and Conference Paper
A Calculus for Trust Management
We introduce ctm, a process calculus which embodies a notion of trust for global computing systems. In ctm each principal (location) is equipped with a policy, which determines its legal behaviour, and with a ...
-
Chapter and Conference Paper
A Survey of Name-Passing Calculi and Crypto-Primitives
The paper surveys the literature on high-level name-passing process calculi, and their extensions with cryptographic primitives. The survey is by no means exhaustive, for essentially two reasons. First, in try...
-
Chapter and Conference Paper
A Dependently Typed Ambient Calculus
The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to enforce elementary access cont...
-
Chapter and Conference Paper
Deriving Bisimulation Congruences: 2-Categories Vs Precategories
G-relative pushouts (GRPOs) have recently been proposed by the authors as a new foundation for Leifer and Milner's approach to deriving labelled bisimulation congruences from reduction systems. This paper deve...
-
Chapter and Conference Paper
A Calculus of Bounded Capacities
Resource control has attracted increasing interest in foundational research on distributed systems. This paper focuses on space control and develops an analysis of space usage in the context of an ambient-like...
-
Chapter and Conference Paper
Algebraic Theories for Contextual Pre-nets
The algebraic models of computation for contextual nets that have been proposed in the literature either rely on a non-free monoid of objects, or introduce too many fictitious behaviors that must be somewhat f...
-
Chapter and Conference Paper
Communication Interference in Mobile Boxed Ambients
Boxed Ambients (BA) replace Mobile Ambients’open capability with communication primitives acting across ambient boundaries. Expressiveness is achieved at the price of communication interferences on message rec...
-
Chapter and Conference Paper
Ty** and Subty** Mobility in Boxed Ambients*
We provide a novel type system for Bugliesi et al.’s Boxed Ambients that combines value subty** with mobility types. The former is based on read/write exchange types, the latter builds on the notion of ambient ...
-
Chapter and Conference Paper
A Calculus of Mobile Resources*
We introduce a calculus of Mobile Resources (MR) tailored for the design and analysis of systems containing mobile, possibly nested, computing devices that may have resource and access constraints,an d which are ...
-
Chapter and Conference Paper
Properties of Distributed Timed-Arc Petri Nets
In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. This ...
-
Chapter
Two Algebraic Process Semantics for Contextual Nets
We show that the so-called ‘Petri nets are monoids’ approach initiated by Meseguer and Montanari can be extended from ordinary place/transition Petri nets to contextual nets by considering suitable non-free monoi...
-
Chapter and Conference Paper
High-Level Petri Nets as Type Theories in the Join Calculus
We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four classes of nets of increasing expressiv...
-
Chapter and Conference Paper
Comparing transition systems with independence and asynchronous transition systems
Transition systems with independence and asynchronous transition systems are noninterleaving models for concurrency arising from the same simple idea of decorating transitions with events. They differ for the cho...
