DocumentCode
3497814
Title
A Scheduling Strategy for Parallel Proof Checking and Verification
Author
Pei, He ; Lishan, Kang ; Zengliang, Xiao ; Zhuoyu, Xiao
Author_Institution
Wuhan Univ., Wuhan
fYear
2008
fDate
6-8 April 2008
Firstpage
1823
Lastpage
1827
Abstract
Proof checking is one of the major concerns of many mechanized formal approaches. This paper first deals with scheduling issues related to parallel proof checking, then applies the obtained result and similar idea to parallel verifications. To facilitate understanding, the discussion is based on INCAPS, an interactive deduction system of temporal logic. This method can also be adapted for improving other mechanized formal systems.
Keywords
formal verification; parallel processing; scheduling; temporal logic; theorem proving; interactive deduction system; mechanized formal system; parallel proof checking; parallel verification; temporal logic; Computer industry; Concurrent computing; Helium; Job shop scheduling; Kernel; Laboratories; Logic; Mathematics; Processor scheduling; Software reliability;
fLanguage
English
Publisher
ieee
Conference_Titel
Networking, Sensing and Control, 2008. ICNSC 2008. IEEE International Conference on
Conference_Location
Sanya
Print_ISBN
978-1-4244-1685-1
Electronic_ISBN
978-1-4244-1686-8
Type
conf
DOI
10.1109/ICNSC.2008.4525520
Filename
4525520
Link To Document