Taras V. Panchenko. Simplified Method For Software Correctness Proof In Ipcl


Natural Sciences / Computer Science / Mathematical logic

Submitted on: Nov 19, 2014, 20:24:33

Description: This paper concerns the software correctness problem and program properties proof E" especially for concurrent programs. Interleaving Parallel Composition Language (IPCL) [1] and program properties proof in IPCL are the subjects of this article. The paper shines light on Simplified State and the appropriate Method for software properties proof (including correctness) in IPCL, and also shows its applications and advantages.

The abstract of this article will be published in the November 2014 issue of "Intellectual Archive Bulletin", ISSN 1929-1329.

The full-text article has been published in the "IntellectualArchive" journal , Vol.3, Num.6, November 2014, ISSN 1929-4700.

The Library and Archives Canada reference page: collectionscanada.gc.ca/ourl/res.php?url_ver=Z39.88......

To read the article posted on Intellectual Archive web site please click the link below.

article1_IPCL_model_of_simplified_state.doc



© 2011-2017 Shiny World Corp. All rights reserved. To reach us please send an e-mail to support@IntellectualArchive.com