東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Linear logic and imperative programming.

Princeton University.

FindBook

Google Book

Amazon

博客來

Linear logic and imperative programming.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Linear logic and imperative programming./
作者:	Jia, Limin.
面頁冊數:	254 p.
附註:	Source: Dissertation Abstracts International, Volume: 68-12, Section: B, page: 8132.
Contained By:	Dissertation Abstracts International68-12B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3295302
ISBN:	9780549397458

Linear logic and imperative programming.
Jia, Limin.

Linear logic and imperative programming. - 254 p.

Source: Dissertation Abstracts International, Volume: 68-12, Section: B, page: 8132.

Thesis (Ph.D.)--Princeton University, 2008.

One of the most important and enduring problems in programming languages research involves verification of programs that construct, manipulate and dispose of complex heap-allocated data structures. Over the last several years, great progress has been made on this problem by using substructural logics to specify the shape of heap-allocated data structures. These logics can capture aliasing properties in a concise notation.

ISBN: 9780549397458Subjects--Topical Terms:

626642
Computer Science.

Linear logic and imperative programming.
LDR:02763nmm 2200265 a 45 001 867563
005 20100804
008 100804s2008 ||||||||||||||||| ||eng d
020 $a 9780549397458
035 $a (UMI)AAI3295302
035 $a AAI3295302
040 $a UMI $c UMI
100 1 $a Jia, Limin. $3 1036309
245 1 0 $a Linear logic and imperative programming.
300 $a 254 p.
500 $a Source: Dissertation Abstracts International, Volume: 68-12, Section: B, page: 8132.
502 $a Thesis (Ph.D.)--Princeton University, 2008.
520 $a One of the most important and enduring problems in programming languages research involves verification of programs that construct, manipulate and dispose of complex heap-allocated data structures. Over the last several years, great progress has been made on this problem by using substructural logics to specify the shape of heap-allocated data structures. These logics can capture aliasing properties in a concise notation.
520 $a In this dissertation, we present our work on using an extension of Girard's intuitionistic linear logic (a substructural logic) with classical constraints as the base logic to reason about the memory safety and shape invariants of programs that manipulate complex heap-allocated data structures. To be more precise, we have defined formal proof rules for an intuitionistic linear logic with constraints, ILC, which modularly combines substructural reasoning with general constraint-based reasoning. We have also defined a formal semantics for our logic -- program heaps -- with recursively defined predicates. Next, we developed verification systems using different fragments of ILC to verify pointer programs. In particular, we developed a set of sound verification generation rules that are used to statically verify pointer programs. We also demonstrated how to interpret the logical formulas as run-time assertions. In the end, we developed a new imperative language that allows programmers to define and manipulate heap-allocated data structures using ILC formulas.
520 $a The main contributions of this thesis are that (1) the development of a substructural logic that is capable of general constraint-based reasoning; and (2) the idea of incorporating high-level logical formulas into imperative languages; either as dynamic contract specifications, which allow clear, compact and semantically well-defined documentation of heap-shape properties; or as language constructs, which drive safe construction and manipulation of sophisticated heap-allocated data structures.
590 $a School code: 0181.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 $a Princeton University. $3 645579
773 0 $t Dissertation Abstracts International $g 68-12B.
790 $a 0181
791 $a Ph.D.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3295302