In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
William Thies, Michal Karczmarek, Janis Sermulins,...
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
— Since the advent of distributed computer systems an active field of research has been the investigation of scheduling strategies for parallel applications. The common approach...
The paper begins with a response to the nature of contemporary artists relationships to how computers have permeated the fine art domain and how they affect the creative process. ...
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...