Sciweavers

27 search results - page 4 / 6
» mscs 2007
Sort
View
MSCS
2007
92views more  MSCS 2007»
13 years 5 months ago
Restriction categories III: colimits, partial limits and extensivity
ction category is an abstract formulation for a category of partial maps, defined in terms of certain specified idempotents called the restriction idempotents. All categories of...
J. Robin B. Cockett, Stephen Lack
MSCS
2007
91views more  MSCS 2007»
13 years 5 months ago
A rewriting calculus for cyclic higher-order term graphs
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
TACAS
2007
Springer
144views Algorithms» more  TACAS 2007»
13 years 12 months ago
Detecting Races in Ensembles of Message Sequence Charts
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible dis...
Edith Elkind, Blaise Genest, Doron Peled
FSTTCS
2007
Springer
13 years 12 months ago
Synthesis of Safe Message-Passing Systems
We show that any regular set of basic MSCs can be implemented by a deadlock-free communicating finite-state machine with local termination: Processes stop in local dead-states ind...
Nicolas Baudru, Rémi Morin
MSCS
2007
125views more  MSCS 2007»
13 years 5 months ago
On categorical models of classical logic and the Geometry of Interaction
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
Carsten Führmann, David J. Pym