POPL 2009 - PDF Preprint Papers

POPL 2009 Annual Symposium on Principles of Programming Languages

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed POPL-2009 Paper

click to vote

POPL
2009
ACM

222views Programming Languages» more POPL 2009»

Language constructs for transactional memory

13 years 11 months ago

Download www.adamwelc.org

Transactional memory (TM) provides a safer, more modular, and more scalable alternative to traditional lock-based synchronization. Implementing high performance TM systems has rec...

Tim Harris

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	222	Language constructs for transactional memory	claim
2	199	Declarative aspects of memory management in the concurrent collections parallel programming model	claim
3	188	Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures	claim
4	187	Bidirectionalization for free! (Pearl)	claim
5	180	Formal certification of code-based cryptographic proofs	claim
6	174	Copy-on-write in the PHP language	claim
7	170	Equality saturation: a new approach to optimization	claim
8	169	Automatic modular abstractions for linear constraints	claim
9	164	Relaxed memory models: an operational approach	claim
10	164	Compositional shape analysis by means of bi-abduction	claim
11	154	The semantics of x86-CC multiprocessor machine code	claim
12	153	Focusing on pattern matching	claim
13	148	Verifying liveness for asynchronous programs	claim
14	148	Flexible types: robust type inference for first-class polymorphism	claim
15	148	Verifying distributed systems: the operational approach	claim
16	146	Feedback-directed barrier optimization in a strongly isolated STM	claim
17	145	Automated verification of practical garbage collectors	claim
18	145	State-dependent representation independence	claim
19	141	A cost semantics for self-adjusting computation	claim
20	141	The semantics of power and ARM multiprocessor machine code	claim
21	137	Wild control operators	claim
22	136	A calculus of atomic actions	claim
23	135	A combination framework for tracking partition sizes	claim
24	134	Masked types for sound object initialization	claim
25	129	Types and higher-order recursion schemes for verification of higher-order programs	claim
26	129	Comparing the performance of concurrent linked-list implementations in Haskell	claim
27	125	Unifying type checking and property checking for low-level code	claim
28	124	A model of cooperative threads	claim
29	123	Modular code generation from synchronous block diagrams: modularity vs. code size	claim
30	121	The theory of deadlock avoidance via discrete control	claim
31	119	Modeling abstract types in modules with open existential types	claim
32	116	Static contract checking for Haskell	claim
33	114	Lazy evaluation and delimited control	claim
34	113	Classical BI: a logic for reasoning about dualising resources	claim
35	111	Positive supercompilation for a higher order call-by-value language	claim
36	107	The semantics of progress in lock-based transactional memory	claim
37	107	SPEED: precise and efficient static estimation of program computational complexity	claim
38	102	A foundation for flow-based program matching: using temporal logic and model checking	claim
39	98	Speculative N-Way barriers	claim
40	94	Semi-sparse flow-sensitive pointer analysis	claim
41	94	Local rely-guarantee reasoning	claim
42	89	Proving that non-blocking algorithms don't block	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers