44 search results - page 5 / 9 » A Fully Abstract Semantics for Concurrent Graph Reduction |
ENTCS
2006
14 years 9 months ago
2006
The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a st...
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
82
Voted
SIAMDM
2000
14 years 9 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
APN
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...
107
click to vote
FM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract: There is growing need to develop formal verification tools for Message Passing Interface (MPI) programs, to eliminate bugs such as deadlocks and local assertion violatio...