Mostly Automated Formal Verification of Loop Dependencies with Applications to Distributed Stencil Algorithms
DOI10.1007/978-3-319-43144-4_11zbMATH Open1468.68129OpenAlexW2495204228MaRDI QIDQ2829257FDOQ2829257
Publication date: 27 October 2016
Published in: Interactive Theorem Proving (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1721.1/131765
Recommendations
- Mostly automated formal verification of loop dependencies with applications to distributed stencil algorithms
- Formal Verification of Distributed Algorithms
- Automatic verification for a class of distributed systems
- Automatic verification of determinism for structured parallel programs
- Automating Verification of Loops by Parallelization
- A strategy for automatic verification of stabilization of distributed algorithms
- An automata-theoretic approach to the verification of distributed algorithms
- An automata-theoretic approach to the verification of distributed algorithms
- Formal verification of a programming logic for a distributed programming language
Specification and verification (program logics, model checking, etc.) (68Q60) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
- Title not available (Why is that?)
- The cache complexity of multithreaded cache oblivious algorithms
- Wave equation numerical resolution: a comprehensive mechanized proof of a C program
- Formal Proof of a Wave Equation Resolution Scheme: The Method Error
- Title not available (Why is that?)
- Numerical Analysis of Ordinary Differential Equations in Isabelle/HOL
Cited In (1)
Uses Software
This page was built for publication: Mostly Automated Formal Verification of Loop Dependencies with Applications to Distributed Stencil Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829257)
