694 search results - page 59 / 139 » Open Graphs and Computational Reasoning |
ENTCS
2007
13 years 10 months ago
2007
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
CC
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap annotated with a set o...
LPNMR
2005
Springer
14 years 3 months ago
2005
Springer
Loops and the corresponding loop formulas play an important role in answer set programming. On the one hand, they are used for guaranteeing correctness and completeness in SAT-base...
LICS
2007
IEEE
14 years 4 months ago
2007
IEEE
A topological space is Noetherian iff every open is compact. Our starting point is that this notion generalizes that of well-quasi order, in the sense that an Alexandroff-discrete...
LICS
2005
IEEE
14 years 3 months ago
2005
IEEE
We propose L-nets as a game model of concurrent interaction. L-nets, which correspond to strategies (in Games Semantics) or designs (in Ludics), are graphs rather than trees; the ...