2473 search results - page 42 / 495 » The Logic of Communication Graphs |
165
click to vote
AMAST
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
106
Voted
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...
133
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
121
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Existing work on programmable self assembly has focused on deterministic performance guarantees--stability of desirable states. In particular, for any acyclic target graph a binary...
118
Voted
WG
1998
Springer
15 years 7 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....