2181 search results - page 78 / 437 » The restriction scaffold problem |
107
Voted
JCS
2008
15 years 23 days ago
2008
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
98
Voted
MFCS
2005
Springer
15 years 6 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
99
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of decidin...
88
Voted
ECOOPW
1999
Springer
15 years 5 months ago
1999
Springer
Unwanted effects of aliasing cause encapsulation problems in object oriented programming. Nevertheless, aliasing is part of common and efficient programming techniques for expres...
91
Voted
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem be...