Inductive data flow graphs
From MaRDI portal
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Nonnumerical algorithms (68W05)
Recommendations
Cited in
(17)- A tree-based approach to data flow proofs
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- Verification of concurrent programs using Petri net unfoldings
- Abstract semantic diffing of evolving concurrent programs
- Automated program verification
- Proof tree preserving tree interpolation
- Compositional reasoning
- Verifying concurrent graph algorithms
- Synthesizing and verifying multicore parallelism in categories of nested code graphs
- scientific article; zbMATH DE number 3907743 (Why is no real title available?)
- A Formal Definition of Data Flow Graph Models
- What's decidable about program verification modulo axioms?
- Transactions on Rough Sets III
- scientific article; zbMATH DE number 2222688 (Why is no real title available?)
- Causal Dataflow Analysis for Concurrent Programs
- Choose your proofs: commutativity and symmetry for smarter reasoning
- Lost in abstraction: monotonicity in multi-threaded programs
This page was built for publication: Inductive data flow graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931789)