198 search results - page 31 / 40 » Reachability on prefix-recognizable graphs |
ISSTA
2004
ACM
15 years 3 months ago
2004
ACM
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
ICSE
1995
IEEE-ACM
15 years 1 months ago
1995
IEEE-ACM
This paper presents a compact Petri net representation that is e cient to construct for concurrent programs that use explicit tasking and rendezvous style communication. These Pet...
AMAST
2008
Springer
14 years 11 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...
IWMM
2009
Springer
15 years 4 months ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
ASE
1999
14 years 9 months ago
1999
Behaviour analysis should form an integral part of the software development process. This is particularly important in the design of concurrent and distributed systems, where comp...