Sciweavers

3653 search results - page 212 / 731
» On Recognizable Timed Languages
Sort
View
ICFP
2009
ACM
16 years 6 months ago
Parallel concurrent ML
Concurrent ML (CML) is a high-level message-passing language that supports the construction of first-class synchronous abstractions called events. This mechanism has proven quite ...
John H. Reppy, Claudio V. Russo, Yingqi Xiao
PLDI
2011
ACM
14 years 8 months ago
Language-independent sandboxing of just-in-time compilation and self-modifying code
When dealing with dynamic, untrusted content, such as on the Web, software behavior must be sandboxed, typically through use of a language like JavaScript. However, even for such ...
Jason Ansel, Petr Marchenko, Úlfar Erlingss...
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 5 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
ICALP
2003
Springer
15 years 10 months ago
The Cell Probe Complexity of Succinct Data Structures
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
Anna Gál, Peter Bro Miltersen
ECOOP
2000
Springer
15 years 9 months ago
Generic Wrappers
Abstract. Component software means reuse and separate marketing of pre-manufactured binary components. This requires components from different vendors to be composed very late, pos...
Martin Büchi, Wolfgang Weck