Sciweavers

2272 search results - page 416 / 455
» A Calculus for
Sort
View
ENTCS
2007
126views more  ENTCS 2007»
13 years 9 months ago
Modelling Calculi with Name Mobility using Graphs with Equivalences
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
ENTCS
2007
104views more  ENTCS 2007»
13 years 9 months ago
A Formal Framework for Web Services Coordination
Recently the term Web Services choreography has been introduced to address some issues related to Web Services composition and coordination. Several proposals for describing chore...
Claudio Guidi, Roberto Lucchi, Manuel Mazzara
ENTCS
2007
121views more  ENTCS 2007»
13 years 9 months ago
Incremental Parametric Development of Greedy Algorithms
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
Dominique Cansell, Dominique Méry
ENTCS
2007
98views more  ENTCS 2007»
13 years 9 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow
JUCS
2006
145views more  JUCS 2006»
13 years 9 months ago
Computer Science, Logic, Informatics Education
: Our aim is to discuss what, when and, how deep logic should be taught in the computer science education in connection with the so called "Bologna process". We survey th...
Katalin Pásztor-Varga, Magda Várter&...