Make flows small again: revisiting the flow framework
From MaRDI portal
Publication:6535380
DOI10.1007/978-3-031-30823-9_32zbMATH Open1543.68095MaRDI QIDQ6535380
Sebastian Wolff, Thomas Wies, Roland Meyer
Publication date: 13 December 2023
Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Programming languages and their definition. Selected papers ed. by C. B. Jones
- LCF considered as a programming language
- Monotone data flow analysis frameworks
- Fully abstract models of typed \(\lambda\)-calculi
- Compositional entailment checking for a fragment of separation logic
- On full abstraction for PCF: I, II and III
- A decidable logic for tree data-structures with measurements
- Frame inference for inductive entailment proofs in separation logic
- Views
- The ramifications of sharing in data structures
- Verifying Concurrent Graph Algorithms
- Deciding Entailments in Inductive Separation Logic with Tree Automata
- Iris from the ground up: A modular foundation for higher-order concurrent separation logic
- Local Reasoning for Global Graph Properties
- Verifying linearizability with hindsight
- Compositional shape analysis by means of bi-abduction
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Programming Languages and Systems
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Make flows small again: revisiting the flow framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535380)
