198 search results - page 29 / 40 » Reachability on prefix-recognizable graphs |
LCPC
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
AUSAI
2005
Springer
14 years 3 months ago
2005
Springer
The key problem in applying verification techniques such as model checking to agent architectures is to show how to map systematically from an agent program to a model structure t...
TAPSOFT
1997
Springer
14 years 2 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
ACSAC
2003
IEEE
14 years 1 months ago
2003
IEEE
When a receiver of a ciphertext message can not decrypt the message due to the fact that he has lost his private-key, the private-key of the receiver and session-key of the messag...
CIE
2008
Springer
13 years 12 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...