東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Concurrency analysis based on fracti...

Zhao, Yang.

FindBook

Google Book

Amazon

博客來

Concurrency analysis based on fractional permissions.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Concurrency analysis based on fractional permissions./
作者:	Zhao, Yang.
面頁冊數:	117 p.
附註:	Adviser: John Boyland.
Contained By:	Dissertation Abstracts International68-08B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3279111
ISBN:	9780549194767

Concurrency analysis based on fractional permissions.
Zhao, Yang.

Concurrency analysis based on fractional permissions. - 117 p.

Adviser: John Boyland.

Thesis (Ph.D.)--The University of Wisconsin - Milwaukee, 2007.

Concurrent programs are hard to write and debug because of the inherent concurrency and indeterminism. The most common runtime errors in concurrent programs are data races and deadlocks.

ISBN: 9780549194767Subjects--Topical Terms:

626642
Computer Science.

Concurrency analysis based on fractional permissions.
LDR:02953nam 2200313 a 45 001 957629
005 20110630
008 110630s2007 ||||||||||||||||| ||eng d
020 $a 9780549194767
035 $a (UMI)AAI3279111
035 $a AAI3279111
040 $a UMI $c UMI
100 1 $a Zhao, Yang. $3 964626
245 1 0 $a Concurrency analysis based on fractional permissions.
300 $a 117 p.
500 $a Adviser: John Boyland.
500 $a Source: Dissertation Abstracts International, Volume: 68-08, Section: B, page: 5377.
502 $a Thesis (Ph.D.)--The University of Wisconsin - Milwaukee, 2007.
520 $a Concurrent programs are hard to write and debug because of the inherent concurrency and indeterminism. The most common runtime errors in concurrent programs are data races and deadlocks.
520 $a We provide a fractional permission type system as well as the operational semantics for a simple object-oriented language. A consistency property between the static permission environment and the dynamic runtime state is established.
520 $a This thesis presents a "fractional permission" type system for a Java-style shared-memory programs. A permission is a linear value associated with some piece of state in a program. Fractions are used to distinguish reads from writes and the permission nesting is used to indicate that some permissions may be nested in some others. With permission analysis, each expression in the program will be statically checked to determine whether it is permitted to be executed under the granted permissions.
520 $a The permissions come from the design intent expressed by field and method an notations. Besides the traditional pointer annotations (uniqueness, nullity...), a field may have a protector, such that any access to this field should be in the synchronized block holding that protector object. Method annotations include not only the traditional "reads", "writes" effects, but also lock usage annotations including "requires", "uses" and lock ordering.
520 $a The novel technical features of this approach include: (1) A unified permission form is created to represent all annotations in multithreaded programs including uniqueness, nullity, method effects, lock protected state etc.; (2) The previously published permission type system is extended to programs with unstructured parallelism and synchronization; (3) Fields are attached annotations indicating how they can be accessed safely; (4) Lock objects may be ordered based on some levels; (5) Permission nesting is used to simulate the protection mechanism between fields (data groups) and their guards; (6) Formal rules for permission typing, transformation and consistency.
590 $a School code: 0263.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 $a The University of Wisconsin - Milwaukee. $3 1019345
773 0 $t Dissertation Abstracts International $g 68-08B.
790 $a 0263
790 1 0 $a Boyland, John, $e advisor
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3279111