Sciweavers

352 search results - page 24 / 71
» Good Programming in Transactional Memory
Sort
View
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
14 years 4 months ago
Towards type-theoretic semantics for transactional concurrency
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett
POPL
2008
ACM
14 years 7 months ago
High-level small-step operational semantics for transactions
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...
Katherine F. Moore, Dan Grossman
ITCC
2002
IEEE
14 years 14 days ago
The Object Behavior of Java Object-Oriented Database Management Systems
Due to its portability and popularity for Internet applications, Java has become one of the major programming languages. The similar syntax inherited from the C language and the p...
Chia-Tien Dan Lo, J. Morris Chang, Ophir Frieder, ...
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
13 years 7 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
WMPI
2004
ACM
14 years 1 months ago
Selective main memory compression by identifying program phase changes
During a program’s runtime, the stack and data segments of the main memory often contain much redundancy, which makes them good candidates for compression. Compression and decomp...
Doron Nakar, Shlomo Weiss