Mostly Automated Formal Verification of Loop Dependencies with Applications to Distributed Stencil Algorithms
From MaRDI portal
Publication:2829257
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
Cites work
- scientific article; zbMATH DE number 5209981 (Why is no real title available?)
- scientific article; zbMATH DE number 5180707 (Why is no real title available?)
- Formal proof of a wave equation resolution scheme: the method error
- Numerical Analysis of Ordinary Differential Equations in Isabelle/HOL
- The cache complexity of multithreaded cache oblivious algorithms
- Wave equation numerical resolution: a comprehensive mechanized proof of a C program
Cited in
(1)
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)