scientific article; zbMATH DE number 2090840
From MaRDI portal
Publication:4813391
zbMath1067.68537MaRDI QIDQ4813391
Publication date: 13 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2694/26940055.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Automata-theoretic semantics of idealized Algol with passive expressions ⋮ Formal verification of parallel prefix sum and stream compaction algorithms in CUDA ⋮ Automated Verification of Parallel Nested DFS ⋮ Concise Read-Only Specifications for Better Synthesis of Programs with Pointers ⋮ RustHorn: CHC-Based Verification for Rust Programs ⋮ ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs ⋮ Automatic Inference of Access Permissions ⋮ Syntactic Control of Interference and Concurrent Separation Logic ⋮ Automated verification of the parallel Bellman-Ford algorithm ⋮ A perspective on specifying and verifying concurrent modules ⋮ Revisiting concurrent separation logic ⋮ A semantics for concurrent separation logic ⋮ Resources, concurrency, and local reasoning ⋮ Balancing expressiveness in formal approaches to concurrency ⋮ A formal C memory model for separation logic ⋮ Concise outlines for a complex logic: a proof outline checker for TaDA ⋮ Stepwise refinement of heap-manipulating code in Chalice ⋮ Linearity and uniqueness: an entente cordiale ⋮ Steps in modular specifications for concurrent modules (invited tutorial paper) ⋮ Iris from the ground up: A modular foundation for higher-order concurrent separation logic ⋮ Temporary Read-Only Permissions for Separation Logic ⋮ Tackling Real-Life Relaxed Concurrency with FSL++ ⋮ The Essence of Higher-Order Concurrent Separation Logic ⋮ The Relationship between Separation Logic and Implicit Dynamic Frames ⋮ A concurrent constraint programming interpretation of access permissions ⋮ The dynamic frames theory ⋮ A Revisionist History of Concurrent Separation Logic ⋮ A Resource Analysis of the π-calculus ⋮ Concurrent Separation Logic and Operational Semantics ⋮ Verification of Concurrent Systems with VerCors ⋮ Modular Termination Verification for Non-blocking Concurrency ⋮ Polymorphic Fractional Capabilities ⋮ Automatic Parallelization and Optimization of Programs by Proof Rewriting ⋮ Fine-grained concurrency with separation logic ⋮ Separation Logic Contracts for a Java-Like Language with Fork/Join ⋮ On Symbolic Heaps Modulo Permission Theories ⋮ Reasoning about Separation Using Abstraction and Reification
