Manson

Results: 238



#Item
181Concurrency control / Concurrency / Computer memory / C++ / Data types / Java Memory Model / Double-checked locking / Immutable object / Constructor / Computing / Software engineering / Computer programming

Semantics of Multithreaded Java Jeremy Manson and William Pugh Institute for Advanced Computer Science and Department of Computer Science University of Maryland, College Park {jmanson,pugh}@cs.umd.edu January 11, 2002

Add to Reading List

Source URL: www.cs.umd.edu

Language: English - Date: 2002-01-11 16:42:23
182Logic in computer science / Java Memory Model / Java platform / Computer memory / Concurrency / Programming language semantics / Memory model / Consistency model / Causal consistency / Computing / Computer architecture / Software engineering

A New Approach to the Semantics of Multithreaded Java Jeremy Manson and William Pugh Institute for Advanced Computer Science and Department of Computer Science University of Maryland, College Park {jmanson,pugh}@cs.umd.e

Add to Reading List

Source URL: www.cs.umd.edu

Language: English - Date: 2003-01-13 16:21:08
183Java Memory Model / Java platform / Justification / Constructible universe / Expected value / Group action / Christian theology / Christianity / Theology

Formal Description of the Manson/Pugh Model February 6, 2004, 1:44pm This document is intended to supplement the Public Review of the Java Memory Model. It can be considered as a replacement for Sections 7 and 8 of that

Add to Reading List

Source URL: www.cs.umd.edu

Language: English - Date: 2004-02-06 13:47:14
184Constructible universe / Expected value

January 21, 2004, 1:51pm Proof sketch that Manson/Pugh allows reordering Consider a program P and the program P 0 that is obtained from P by reordering two adjacent statements x and y. Let x be the statement that comes

Add to Reading List

Source URL: www.cs.umd.edu

Language: English - Date: 2004-01-21 13:53:53
185Lock / Constructible universe / Theoretical physics / Science / Philosophy / Epistemology / Econometrics / Conditionals / Causality / Philosophy of science

August 29th: One Page Informal Description of Manson/Pugh model hb hb There is a happens-before relation → defined on actions i → j if i is before j in program

Add to Reading List

Source URL: www.cs.umd.edu

Language: English - Date: 2003-08-29 17:09:08
186Forestry / Plantation / Real estate / Biogeography / Eucalyptus / Forest / Soil / Ecology / Tropical rainforest / Ecosystems / Systems ecology / Historical geology

Agroforest Syst[removed]:233–250 DOI[removed]s10457[removed]Species-site matching in mixed species plantations of native trees in tropical Australia Daniel G. Manson • Susanne Schmidt

Add to Reading List

Source URL: jkv.50megs.com

Language: English - Date: 2013-04-06 16:32:05
187Concurrency control / Lock / Justification / Constructible universe / Variable / Group action / Christian theology / Christianity / Algebra

Informal Description of Manson/Pugh model February 6, 2004, 1:45pm Note: the issue of what it means for an action to occur in more than one execution is elided. hb hb

Add to Reading List

Source URL: www.cs.umd.edu

Language: English - Date: 2004-02-06 13:47:14
188Group action / Mathematics / Concurrency control / Lock / Constructible universe

Almost One Page Informal Description of Manson/Pugh model October 23, 2003, 6:18pm Note: the issue of what it means for an action to occur in more than one execution is elided. hb hb

Add to Reading List

Source URL: www.cs.umd.edu

Language: English - Date: 2003-10-24 05:48:40
189Expected value / Constructible universe

February 6, 2004, 1:46pm Proof sketch that Manson/Pugh allows reordering Consider a program P and the program P 0 that is obtained from P by reordering two adjacent statements x and y. Let x be the statement that comes

Add to Reading List

Source URL: www.cs.umd.edu

Language: English - Date: 2004-02-06 13:47:14
1902nd millennium BC / Amarna Period / Ay / Year of birth unknown

Proof sketch that Manson/Pugh allows reordering August 4, 2003, 2:51pm Consider a program P and the program P 0 that is obtained from P by reordering two adjacent statements x and y. Let x be the statement that comes bef

Add to Reading List

Source URL: www.cs.umd.edu

Language: English - Date: 2003-08-04 14:52:12
UPDATE