61 search results - page 7 / 13 » Program Analysis via Graph Reachability |
ICSE
1995
IEEE-ACM
13 years 11 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...
IPL
2010
13 years 6 months ago
2010
Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that cat...
AIS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Model verification examines the correctness of a model implementation with respect to a model specification. While being described from model specification, implementatio...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....