4767 search results - page 130 / 954 » Structures for Abstract Rewriting |
132
click to vote
KBSE
2009
IEEE
15 years 9 months ago
2009
IEEE
—Automated debugging is becoming increasingly important as the size and complexity of software increases. This paper makes a case for using constraint-based data structure repair...
128
Voted
ICOIN
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
123
click to vote
CAV
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
BIRTHDAY
1997
Springer
15 years 6 months ago
1997
Springer
Abstract. Logic preservation theorems often have the form of a syntax/semantics correspondence. For example, the Los-Tarski theorem asserts that a rst-order sentence is preserved b...
86
Voted
CTCS
1989
Springer
15 years 6 months ago
1989
Springer
We combine the principles of the Floyd-Warshall-Kleene algorithm, enriched categories, and Birkhoff arithmetic, to yield a useful class of algebras of transitive vertex-labeled s...