1153 search results - page 191 / 231 » Reversing graph transformations |
ENTCS
2008
13 years 8 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
KES
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We present a method for mapping security levels among the components of a distributed system where data in the local sources are represented in XML. Distributed data is i...
ALGORITHMICA
2002
13 years 8 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
DC
2002
13 years 8 months ago
2002
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
JSA
2008
13 years 8 months ago
2008
We present a framework for the formal verification of abstract state machine (ASM) designs using the multiway decision graphs (MDG) tool. ASM is a state based language for describ...