8 search results - page 1 / 2 » Verifying Properties of Infinite Sequences of Description Lo... |
ECAI
2010
Springer
13 years 5 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...
CSFW
2009
IEEE
13 years 8 months ago
2009
IEEE
This paper presents a language, based on transaction logic, for specifying dynamic authorisation policies, i.e., rules governing actions that may depend on and update the authoris...
SIGSOFT
2003
ACM
13 years 10 months ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
SIGSOFT
2006
ACM
14 years 5 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
ICWE
2005
Springer
13 years 10 months ago
2005
Springer
As the Web becomes a platform for implementing complex B2C and B2B applications, there is a need to extend Web conceptual modeling to process-centric applications. In this context,...