Sciweavers

1418 search results - page 126 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
PLDI
2005
ACM
15 years 10 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
POPL
2000
ACM
15 years 8 months ago
Type Systems for Distributed Data Structures
Distributed-memory programs are often written using a global address space: any process can name any memory location on any processor. Some languages completely hide the distincti...
Ben Liblit, Alexander Aiken
ICFP
2009
ACM
16 years 5 months ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg
REFSQ
2009
Springer
15 years 11 months ago
Composing Models for Detecting Inconsistencies: A Requirements Engineering Perspective
Abstract. [Context and motivation] Ever-growing systems’ complexity and novel requirements engineering approaches such as reuse or globalization imply that requirements are produ...
Gilles Perrouin, Erwan Brottier, Benoit Baudry, Yv...
CICLING
2003
Springer
15 years 9 months ago
Computing with Realizational Morphology
The theory of realizational morphology presented by Stump in his influential book Inflectional Morphology (2001) describes the derivation of inflected surface forms from underly...
Lauri Karttunen