644 search results - page 62 / 129 » Precedence Automata and Languages |
106
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
135
click to vote
FOAL
2007
ACM
15 years 8 months ago
2007
ACM
The goal of this work is to treat safety and security policies as requirements to be composed in an aspectual style with a developing application. Policies can be expressed either...
156
click to vote
POPL
2010
ACM
15 years 7 months ago
2010
ACM
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly h...
171
click to vote
HYBRID
2007
Springer
15 years 10 months ago
2007
Springer
We propose the use of formal languages of infinite words over the alphabet of task identifiers as an interface between control designs and software implementations. We argue that...
107
click to vote
STACS
2004
Springer
15 years 10 months ago
2004
Springer
d Abstract)⋆⋆ Daniel Kirsten LIAFA, Universit´e Denis Diderot – Case 7014, 2 place Jussieu, F-75251 Paris Cedex 05, France We give a positive solution to the so-called fini...