Sciweavers

FOSSACS
2005
Springer
14 years 2 months ago
Model Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto
FOSSACS
2005
Springer
14 years 2 months ago
History-Based Access Control with Local Policies
Abstract. An extension of the λ-calculus is proposed, to study historybased access control. It allows for security policies with a possibly nested, local scope. We define a type ...
Massimo Bartoletti, Pierpaolo Degano, Gian Luigi F...
FOSSACS
2005
Springer
14 years 2 months ago
A Computational Model for Multi-variable Differential Calculus
Abstract. We introduce a domain-theoretic computational model for multivariable differential calculus, which for the first time gives rise to data types for differentiable functio...
Abbas Edalat, André Lieutier, Dirk Pattinso...
FOSSACS
2005
Springer
14 years 2 months ago
Axiomatizations for Probabilistic Finite-State Behaviors
Abstract. We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s probabilistic automata. We consider vario...
Yuxin Deng, Catuscia Palamidessi
FOSSACS
2005
Springer
14 years 2 months ago
From Separation Logic to First-Order Logic
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model prope...
Cristiano Calcagno, Philippa Gardner, Matthew Hagu...
FOSSACS
2005
Springer
14 years 2 months ago
A Simpler Proof Theory for Nominal Logic
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
James Cheney
FOSSACS
2005
Springer
14 years 2 months ago
Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
Samy Abbes, Albert Benveniste
FOSSACS
2005
Springer
14 years 2 months ago
Stochastic Transition Systems for Continuous State Spaces and Non-determinism
Abstract. We study the interaction between non-deterministic and probabilistic behaviour in systems with continuous state spaces, arbitrary probability distributions and uncountabl...
Stefano Cattani, Roberto Segala, Marta Z. Kwiatkow...
FOSSACS
2005
Springer
14 years 2 months ago
Full Abstraction for Polymorphic Pi-Calculus
traction for Polymorphic Pi-Calculus Alan Jeffrey 1,2 and Julian Rathke3 1 Bell Labs, Lucent Technologies, Chicago, IL, USA 2 DePaul University, Chicago, IL, USA 3 University of Su...
Alan Jeffrey, Julian Rathke
EDCC
2005
Springer
14 years 2 months ago
Performance Evaluation of Consistent Recovery Protocols Using MPICH-GF
This paper presents an implementation of several consistent protocols at the abstract device level and their performance comparison. We have performed experiments using three NAS P...
Namyoon Woo, Hyungsoo Jung, Dongin Shin, Hyuck Han...