231 search results - page 31 / 47 » Mu-calculus path checking |
ICWE
2007
Springer
15 years 5 months ago
2007
Springer
Initially, web development methods focused on the generation of read-only web applications for browsing the data stored in relational database systems. Lately, many have evolved to...
115
click to vote
SLS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
100
click to vote
RTA
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
IPPS
2003
IEEE
15 years 4 months ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
FOCS
1999
IEEE
15 years 3 months ago
1999
IEEE
We compare the performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks to a path selection algorithm that ...