Showing papers in "Electronic Notes in Theoretical Computer Science in 2007"

TL;DR: This work presents a graphical language for dagger compact closed categories, and sketches a proof of its completeness for equational reasoning, and gives a general construction, the CPM construction, which associates to each Dagger compact closed category its ''category of completely positive maps'', and shows that the resulting category is again dagger compactclosed.

TL;DR: PCL supports compositional reasoning about complex security protocols and has been applied to a number of industry standards including SSL/TLS, IEEE 802.11i and Kerberos V5.

TL;DR: These are the first industrial examples that have been synthesized automatically from their specifications and shown their practicality by synthesizing a generalized buffer and an arbiter for ARM's AMBA AHB bus from specifications given in PSL.

TL;DR: The history of Gordon Plotkin's mature work is studied, in particular asking why Lawvere theories were eclipsed by monads in the 1960's, and how the renewed interest in them in a computer science setting might develop in future.

TL;DR: The issues involved in higher-order session communication are discussed, a formulation of the recursive types as well as proofs of the Subject Reduction and Type Safety Theorems of the original session typing system by Honda-Vasconcelos-Kubo in ESOP'98 are presented and a variant which allows a more liberal higher- order session communication is proposed, based on an idea of Gay and Hole.

TL;DR: This work proposes to model development information as change operations that the developers are using, while they are effecting changes to the system, which opens new ways for both developers and researchers to explore and evolve complex systems.

TL;DR: This work investigates access control models based on rules, called Rule-BAC, and presents weaknesses that arise when they try to manage conflicts in this model, and shows how a more structured model, say OR-Bac (Organization Based Access Control), gifted with inheritance mechanism make redundant rules and potential conflict problems tractable in polynomial time.

TL;DR: In this paper, Asmuth et al. showed that the Chinese remainder theorem can be used for realizing more general access structures, such as the compartmented or the weighted threshold ones.

TL;DR: CCS-R, a reversible variant of Milner's CCS offering a backtracking mechanism, is presented and formalization of biological systems satisfying a ''perfect mix'' assumption within C CS-R is discussed.

TL;DR: It is shown that DCC can also be used as a calculus for access control in distributed systems, and some of its appealing properties are explored.

TL;DR: The experimental results show that indeed a large reduction in the size of the generated formulas can be obtained and the availability of these benchmarks will help improve the state of the art of QBF solvers and make QBF based symbolic model checking a viable alternative.

TL;DR: The paper uses bigraphs in which names have multiple locality; this enables a formulation of the lambda calculus with explicit substitutions, seeking conditions on a bigraphical reactive system that are sufficient to ensure confluence.

TL;DR: JOLIE, an interpreter and engine for orchestration programs that provides an easy to use development environment and it is based on a solid mathematical underlying model, which was developed in previous works of the authors.

TL;DR: This paper takes the well-established ReSpecT language for programming tuple centre behaviour, and adopts the A&A (agents and artifacts) meta-model as a perspective to reinterpret, revise, extend and complete it.

TL;DR: A taxonomy according to changes in the role played by individuals as members of groups is presented, so that CSCW systems can be classified in a more flexible way.

TL;DR: It is shown that under certain assumptions, accessible functors admit expressive logics for their coalgebras under the setting of locally presentable categories.

TL;DR: The design of a strategy language for the Maude rewriting language that supports this modular decomposition: inference systems are specified in system modules, and strategies in strategy modules is presented.

TL;DR: Nominal Equational Logic is shown to be both sound and complete for the support interpretation of freshness and equality provided by the Gabbay-Pitts nominal sets model of names, binding and @a-conversion.

TL;DR: Criteria that guarantee completeness of Real-Time Maude search and temporal logic model checking analyses, under the maximal time sampling strategy, for a large class of real-time systems are presented.

TL;DR: A set of process algebra operators, that are called controller operators, able to mimic the behavior of security automata introduced by Schneider are defined, and the semantics of four controllers that act by monitoring possible un-trusted component of a system in order to enforce certain security policies are given.

TL;DR: A mathematical measure is defined for quantitatively comparing the effectiveness of probabilistic computational trust systems in various environments and is derived formally, rather than obtained via experimental simulation as traditionally done.

TL;DR: An automatic approach for fault localization in C programs is presented, based on model checking and reports only components that can be changed such that the difference between actual and intended behavior of the example is removed.

TL;DR: It turns out that the labeled @p-calculus is a conservative extension of the standard one, and this comparison provides the expressiveness of the various fair testing-based semantics and emphasizes the discriminating power of the one already proposed in the literature.

TL;DR: In this article, the authors present the formalization of one of the most wide spread safety analysis methods: fault tree analysis (FTA), which allows to rigorously reason about completeness of a faulty tree.

TL;DR: A formal semantics for BRN is given in terms of transition systems which formalizes the evolution rules given by Rene Thomas and it is shown how to use this model to find interesting properties of a BRN like the set of stable states, cycles etc using tools for analyzing transition systems.

TL;DR: This paper proposes a calculus for describing communication-centred programs and discusses its use through a formal description of several use cases from real business protocols.

TL;DR: The model-based framework is compared with other well-known Automated Debugging approaches and open issues, challenges and potential future directions of MBSD are presented.

TL;DR: The paper shows that the notion of reversibility can bridge the gap between some interleaving models and non-interleaving model of concurrency, and makes them interchangeable, and proves that transition systems associated with reversible process algebras are equivalent as models to labelled prime event structures.

TL;DR: This paper presents a stochastic model of the cell cycle control in eukaryotes based on Stochastic process algebras for mobile systems and compares its approach with classical ODE specifications.

TL;DR: The paper motivates this approach and gives some ideas on how to build general self-managing software systems, an important part of which is to build systems as hierarchies of interacting feedback loops.