Sciweavers

2542 search results - page 266 / 509
» An Operational Definition of Context
Sort
View
PPOPP
2009
ACM
16 years 7 months ago
Safe open-nested transactions through ownership
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha
POPL
2008
ACM
16 years 7 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
16 years 6 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
ICFP
2005
ACM
16 years 6 months ago
A step-indexed model of substructural state
The concept of a "unique" object arises in many emerging programming languages such as Clean, CQual, Cyclone, TAL, and Vault. In each of these systems, unique objects ma...
Amal J. Ahmed, Matthew Fluet, Greg Morrisett
ICFP
2003
ACM
16 years 6 months ago
A static type system for JVM access control
This paper presents a static type system for JAVA Virtual Machine (JVM) code that enforces an access control mechanism similar to the one found, for example, in a JAVA implementat...
Tomoyuki Higuchi, Atsushi Ohori