2473 search results - page 10 / 495 » The Logic of Communication Graphs |
ENTCS
2008
13 years 7 months ago
2008
This paper explores a unification of the ideas of Concurrent Separation Logic with those of Communicating Sequential Processes. It extends separation logic by an operator for sepa...
ECCC
2007
13 years 7 months ago
2007
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
IJCAI
2001
13 years 9 months ago
2001
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...
FASE
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. The OMG’s Model-Driven Architecture focusses on the evolution and integration of applications across heterogeneous middleware platforms. Presently available instances o...