Pages that link to "Item:Q5326280"

The following pages link to Why3 — Where Programs Meet Provers (Q5326280):

Displaying 16 items.

• Contract-based verification of MATLAB-style matrix programs (Q282101) (← links)
• Polynomial function intervals for floating-point software verification (Q457251) (← links)
• A generic framework for symbolic execution: a coinductive approach (Q507361) (← links)
• The spirit of ghost code (Q518394) (← links)
• Building program construction and verification tools from algebraic principles (Q736461) (← links)
• Tests and proofs for custom data generators (Q1624592) (← links)
• Instrumenting a weakest precondition calculus for counterexample generation (Q1648649) (← links)
• Distant decimals of \(\pi \): formal proofs of some algorithms computing them and guarantees of exact computation (Q1663216) (← links)
• Hammer for Coq: automation for dependent type theory (Q1663240) (← links)
• The matrix reproved (verification pearl) (Q1703015) (← links)
• Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (Q1722647) (← links)
• Superposition with first-class booleans and inprocessing clausification (Q2055873) (← links)
• Integrating ADTs in KeY and their application to history-based reasoning about collection (Q6185826) (← links)
• Deductive Binary Code Verification Against Source-Code-Level Specifications (Q6487259) (← links)
• Integrating ADTs in KeY and Their Application to History-Based Reasoning (Q6488468) (← links)
• Formal Reasoning Using Distributed Assertions (Q6496629) (← links)