東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

An implementation of feasible path c...

Li, Jun.

FindBook

Google Book

Amazon

博客來

An implementation of feasible path constraints generation for reproducible testing.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	An implementation of feasible path constraints generation for reproducible testing./
作者:	Li, Jun.
面頁冊數:	80 p.
附註:	Source: Masters Abstracts International, Volume: 43-01, page: 0239.
Contained By:	Masters Abstracts International43-01.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MQ92498
ISBN:	061292498X

An implementation of feasible path constraints generation for reproducible testing.
Li, Jun.

An implementation of feasible path constraints generation for reproducible testing. - 80 p.

Source: Masters Abstracts International, Volume: 43-01, page: 0239.

Thesis (M.Sc.)--University of Windsor (Canada), 2004.

Non-determinism features make the testing of a concurrent program not repeatable. Specification-based reproducible testing is a promising technique that may give the tester more control over the environment of concurrent testing. With a given test case, the crucial part of the test scenario which contributes to achieving the control on the execution path are input events and path constraints in terms of synchronization events. The problem considered in this thesis is to generate a significant set of path constraints automatically from the design specification in terms of design abstract under the assumption that monitors are the key mechanism to handle the synchronization events. In addition, as a considerable feature, formal methods have been applied in the implementation tool to construct the path constraints.

ISBN: 061292498XSubjects--Topical Terms:

626642
Computer Science.

An implementation of feasible path constraints generation for reproducible testing.
LDR:01673nmm 2200265 4500 001 1847090
005 20051103093618.5
008 130614s2004 eng d
020 $a 061292498X
035 $a (UnM)AAIMQ92498
035 $a AAIMQ92498
040 $a UnM $c UnM
100 1 $a Li, Jun. $3 1018610
245 1 3 $a An implementation of feasible path constraints generation for reproducible testing.
300 $a 80 p.
500 $a Source: Masters Abstracts International, Volume: 43-01, page: 0239.
500 $a Adviser: Jessica Chen.
502 $a Thesis (M.Sc.)--University of Windsor (Canada), 2004.
520 $a Non-determinism features make the testing of a concurrent program not repeatable. Specification-based reproducible testing is a promising technique that may give the tester more control over the environment of concurrent testing. With a given test case, the crucial part of the test scenario which contributes to achieving the control on the execution path are input events and path constraints in terms of synchronization events. The problem considered in this thesis is to generate a significant set of path constraints automatically from the design specification in terms of design abstract under the assumption that monitors are the key mechanism to handle the synchronization events. In addition, as a considerable feature, formal methods have been applied in the implementation tool to construct the path constraints.
590 $a School code: 0115.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Windsor (Canada). $3 1018526
773 0 $t Masters Abstracts International $g 43-01.
790 1 0 $a Chen, Jessica, $e advisor
790 $a 0115
791 $a M.Sc.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MQ92498