Caduceus

swMATH4625MaRDI QIDQ16796FDOQ16796

Author name not available (Why is that?)

Cited In (54)

• LCF-style Platform based on Multiway Decision Graphs
• FM 2005: Formal Methods
• A rewriting logic semantics approach to modular program analysis
• Inferring Loop Invariants Using Postconditions
• Verifying Whiley programs with Boogie
• Imperative Functional Programming with Isabelle/HOL
• Product programs in the wild: retrofitting program verifiers to check information flow security
• Formal verification of side-channel countermeasures using self-composition
• Faster and more complete extended static checking for the Java modeling language
• HOL-Boogie -- an interactive prover-backend for the verifying C compiler
• Automating Induction with an SMT Solver
• Abstract Interpretation of Symbolic Execution with Explicit State Updates
• Collaborative verification and testing with explicit assumptions
• HOL-Boogie — An Interactive Prover for the Boogie Program-Verifier
• A framework for the verification of certifying computations
• Matching logic: an alternative to Hoare/Floyd logic
• Dynamic boundaries: information hiding by second order framing with first order assertions
• Automatic decidability and combinability
• A program logic for resources
• Hardware-Dependent Proofs of Numerical Programs
• Complete instantiation-based interpolation
• Combining Coq and Gappa for Certifying Floating-Point Programs
• Floats and Ropes: A Case Study for Formal Numerical Program Verification
• Modular inference of subprogram contracts for safety checking
• Instrumenting a weakest precondition calculus for counterexample generation
• Reasoning about assignments in recursive data structures
• Trusting computations: a mechanized proof from partial differential equations to actual program
• Static contract checking with abstract interpretation
• Verification conditions for source-level imperative programs
• Sufficient Preconditions for Modular Assertion Checking
• Understanding parameters of deductive verification: an empirical investigation of KeY
• Correct code containing containers
• Doomed program points
• Reasoning about memory layouts
• Wave equation numerical resolution: a comprehensive mechanized proof of a C program
• A system for compositional verification of asynchronous objects
• CPBPV: a constraint-programming framework for bounded program verification
• FEVS: a functional equivalence verification suite for high-performance scientific computing
• Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\)
• Practical Tactics for Separation Logic
• Multi-prover verification of floating-point programs
• Handling Polymorphism in Automated Deduction
• A refinement methodology for object-oriented programs
• Challenging SMT solvers to verify neural networks
• Practical realisation and elimination of an ECC-related software bug attack
• Proving fairness and implementation correctness of a microkernel scheduler
• Dafny: an automatic program verifier for functional correctness
• MUNCH -- automated reasoner for sets and multisets
• A dynamic logic for unstructured programs with embedded assertions
• Verification of the Schorr-Waite algorithm -- from trees to graphs
• A Machine Checked Soundness Proof for an Intermediate Verification Language
• TASS: the toolkit for accurate scientific software
• Formal verification of numerical programs: from C annotated programs to mechanical proofs
• Towards Modular Algebraic Specifications for Pointer Programs: A Case Study

This page was built for software: Caduceus