Sciweavers

311 search results - page 23 / 63
» A Bialgebraic Approach to Automata and Formal Language Theor...
Sort
View
PLDI
2005
ACM
14 years 2 months ago
Composing security policies with polymer
We introduce a language and system that supports definition and composition of complex run-time security policies for Java applications. Our policies are comprised of two sorts o...
Lujo Bauer, Jay Ligatti, David Walker
IFM
2007
Springer
101views Formal Methods» more  IFM 2007»
14 years 2 months ago
Translating FSP into LOTOS and Networks of Automata
Many process calculi have been proposed since Robin Milner and Tony Hoare opened the way more than 25 years ago. Although they are based on the same kernel of operators, most of th...
Gwen Salaün, Jeff Kramer, Frédé...
ICFP
2005
ACM
14 years 8 months ago
Witnessing side-effects
We present a new approach to the old problem of adding side effects to purely functional languages. Our idea is to extend the language with "witnesses," which is based o...
Tachio Terauchi, Alexander Aiken
CALCO
2007
Springer
95views Mathematics» more  CALCO 2007»
14 years 2 months ago
Higher Dimensional Trees, Algebraically
In formal language theory, James Rogers published a series of innovative papers generalising strings and trees to higher dimensions.Motivated by applications in linguistics, his go...
Neil Ghani, Alexander Kurz
LATA
2010
Springer
14 years 3 months ago
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
Frank Weinberg, Markus E. Nebel