Titlebook: Certified Programs and Proofs; Third International Georges Gonthier,Michael Norrish Conference proceedings 2013 Springer International Pub

HBA1C

書(shū)目名稱Certified Programs and Proofs影響因子(影響力)




書(shū)目名稱Certified Programs and Proofs影響因子(影響力)學(xué)科排名




書(shū)目名稱Certified Programs and Proofs網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Certified Programs and Proofs網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Certified Programs and Proofs被引頻次




書(shū)目名稱Certified Programs and Proofs被引頻次學(xué)科排名




書(shū)目名稱Certified Programs and Proofs年度引用




書(shū)目名稱Certified Programs and Proofs年度引用學(xué)科排名




書(shū)目名稱Certified Programs and Proofs讀者反饋




書(shū)目名稱Certified Programs and Proofs讀者反饋學(xué)科排名

有助于

Mostly Sound Type System Improves a Foundational Program VerifiermpCert verified optimizing C compiler. The C language is known to not be type-safe but we show the value of a provably . type system: integrating the typechecker with the program logic makes the logic significantly more usable. The computational nature of our typechecker (within Coq) makes program p

不利

Negotiate

不確定

Cardiac

Cardiac

GROG

Nonfree Datatypes in Isabelle/HOLssive datatypes on axiomatic means: nonfree datatypes generated from constructors modulo equations. We have implemented an Isabelle/HOL package for nonfree datatypes, without compromising foundations. The use of the package, and its nonfree iterator in particular, is illustrated with examples: bags,

Chronic

Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOLlibrary of operations and theorems about an abstract type, but they want to write definitions and proofs in terms of a more concrete representation type, or “raw” type. Earlier work on the Isabelle Quotient package has yielded great progress in automation, but it still has many technical limitations

PANT

Refinements for Free!fficient. One way to reconcile both consists in adopting a high-level view when proving correctness and then refining stepwise down to an efficient low-level implementation. Some refinement steps are interesting, in the sense that they improve the algorithms involved, while others only express a swi