8 search results - page 2 / 2 » Tree-Walking Automata Cannot Be Determinized |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...
RTSS
2008
IEEE
14 years 2 months ago
2008
IEEE
The Real-Time Calculus (RTC) framework proposed in [Chakraborty et al., DATE 2003] and subsequently extended in [Wandeler et al., Real-Time Systems 29(2-3), 2005] and a number of ...
SACMAT
2009
ACM
14 years 2 months ago
2009
ACM
Many access control policy languages, e.g., XACML, allow a policy to contain multiple sub-policies, and the result of the policy on a request is determined by combining the result...