Titlebook: Higher Order Logic Theorem Proving and Its Applications; 6th International Wo Jeffrey J. Joyce,Carl-Johan H. Seger Conference proceedings 1

浮淺

書目名稱Higher Order Logic Theorem Proving and Its Applications影響因子(影響力)




書目名稱Higher Order Logic Theorem Proving and Its Applications影響因子(影響力)學(xué)科排名




書目名稱Higher Order Logic Theorem Proving and Its Applications網(wǎng)絡(luò)公開度




書目名稱Higher Order Logic Theorem Proving and Its Applications網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Higher Order Logic Theorem Proving and Its Applications被引頻次




書目名稱Higher Order Logic Theorem Proving and Its Applications被引頻次學(xué)科排名




書目名稱Higher Order Logic Theorem Proving and Its Applications年度引用




書目名稱Higher Order Logic Theorem Proving and Its Applications年度引用學(xué)科排名




書目名稱Higher Order Logic Theorem Proving and Its Applications讀者反饋




書目名稱Higher Order Logic Theorem Proving and Its Applications讀者反饋學(xué)科排名

神秘

Mechanizing a programming logic for the concurrent programming language microSR in HOL,en to be sound within HOL. The logic we derived allows one to reason and state formal assertions about concurrently executing processes that do not share any data objects, but communicate through shared channels.

TAIN

Reasoning with the formal definition of standard ML in HOL, The correctness of the representation is demonstrated by the derivation of several important language properties, including determinacy. A symbolic evaluator to assist in proving properties of Standard ML program fragments is also described. Some sample applications of the theory in the area of program verification are given.

Vldl379

朋黨派系

The HOL-Voss system: Model-checking inside a general-purpose theorem-prover,pproach. We illustrate the use of this extension with three examples, namely, the formal verification of a 32-bit adder, an 8-bit by 8-bit multiplier and the MAJORLOGIC block of the Viper microprocessor.

decipher

元音

FOLLY

驚奇

0302-9743 s 40 papers, including an invited paper by David Parnas, McMaster University, Canada, entitled "Some theorems we should prove".978-3-540-57826-0978-3-540-48346-5Series ISSN 0302-9743 Series E-ISSN 1611-3349

低位的人或事