311 search results - page 4 / 63 » A Bialgebraic Approach to Automata and Formal Language Theor... |
POPL
2004
ACM
14 years 7 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
SACMAT
2009
ACM
14 years 1 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...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
Security automata are a variant of B¨uchi automata used to specify security policies that can be enforced by monitoring system execution. In this paper, we propose using CSP-OZ, ...
MST
2011
13 years 2 months ago
2011
The theory of two-dimensional languages, generalizing formal string languages, was motivated by problems arising from image processing and models of parallel computing. Weighted au...