CakeML

From MaRDI portal
Revision as of 20:10, 5 March 2024 by Import240305080343 (talk | contribs) (Created automatically from import240305080343)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Software:20799



swMATH8799MaRDI QIDQ20799


No author found.





Related Items (59)

The reflective Milawa theorem prover is sound (down to the machine code that runs it)Self-formalisation of higher-order logic. Semantics, soundness, and a verified implementationExtensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and ProofsA formal semantics of the GraalVM intermediate representationComputational logic: its origins and applicationsUnnamed ItemTranslation certification for smart contractsIntroduction to ``Milestones in interactive theorem provingA verified ODE solver and the Lorenz attractorCoSMed: a confidentiality-verified social media platformMechanising a type-safe model of multithreaded Java with a verified compilerInteractive theorem proving. 8th international conference, ITP 2017, Brasília, Brazil, September 26--29, 2017. ProceedingsUnnamed ItemImproved Tool Support for Machine-Code Decompilation in HOL4Pattern Matches in HOL:Extracting functional programs from Coq, in CoqSchulze voting as evidence carrying computationVerified spilling and translation validation with repairPOPLMark reloaded: Mechanizing proofs by logical relationsProof-producing synthesis of CakeML from monadic HOL functionsRefinement through restraint: bringing down the cost of verificationMetamath Zero: designing a theorem prover proverVerified Characteristic Formulae for CakeMLThe CADE-26 automated theorem proving system competition – CASC-26The 9th IJCAR Automated Theorem Proving System Competition – CASC-J9Lem\texttt{cake\_lpr}: verified propagation redundancy checking in CakeMLAmortized complexity verifiedVerified secure compilation for mixed-sensitivity concurrent programsA verified proof checker for higher-order logicForeword to the special focus on formal proofs for mathematics and computer scienceA verified generational garbage collector for CakeMLOperational semantics of a weak memory model with channel synchronizationUnnamed ItemFrom LCF to Isabelle/HOLCoCon: a conference management system with formally verified document confidentialityA verified generational garbage collector for CakeMLVerifying the LTL to Büchi automata translation via very weak alternating automataSoftware verification with ITPs should use binary code extraction to reduce the TCB (short paper)Fast machine words in Isabelle/HOLA formal equational theory for call-by-push-valueHoare-style logic for unstructured programsA Higher-Order Abstract Syntax Approach to Verified Transformations on Functional ProgramsProof-producing synthesis of CakeML with I/O and local state from monadic HOL functionsAn abstraction-refinement framework for reasoning with large theoriesEfficient verified (UN)SAT certificate checkingThe verified CakeML compiler backendIsabelle's metalogic: formalization and proof checkerGRUNGE: a grand unified ATP challengeA Verified Theorem Prover Backend Supported by a Monotonic LibraryCoSMed: A Confidentiality-Verified Social Media PlatformA Framework for the Automatic Formal Verification of Refinement from Cogent to CA verified compiler from Isabelle/HOL to CakeMLCakeMLProof Auditing Formalised MathematicsA formalization and proof checker for Isabelle's metalogicTowards a Formally Verified Proof AssistantHOL with Definitions: Semantics, Soundness, and a Verified ImplementationThe Reflective Milawa Theorem Prover Is Sound


This page was built for software: CakeML