133 search results - page 5 / 27 » Expressive Power of Non-Deterministic Operators for Logic-ba... |
141
Voted
CCS
2004
ACM
15 years 8 months ago
2004
ACM
Comparing the expressive power of access control models is recognized as a fundamental problem in computer security. Such comparisons are generally based on simulations between di...
119
Voted
CONCUR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
125
Voted
SAC
2010
ACM
15 years 10 months ago
2010
ACM
Most mainstream system programming languages provide support for builtin types, and extension mechanisms through userdefined types. They also come with a notion of constant expre...
107
Voted
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
We consider a general class of timed automata parameterized by a set of "input-determined" operators, in a continuous time setting. We show that for any such set of opera...
257
Voted
POPL
2004
ACM
16 years 3 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...