CONCUR 2004 - Concurrency Theory
From MaRDI portal
Publication:5311497
DOI10.1007/b100113zbMath1099.68588OpenAlexW2499482941MaRDI QIDQ5311497
Publication date: 23 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100113
Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Verifying Visibility-Based Weak Consistency, On grainless footprint semantics for shared-memory programs, Certifying low-level programs with hardware interrupts and preemptive threads, Concurrent Kleene algebra with tests and branching automata, Model Checking Concurrent Programs, The Laws of Programming Unify Process Calculi, Toward compositional verification of interruptible OS kernels and device drivers, Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems, A formal C memory model for separation logic, Concise outlines for a complex logic: a proof outline checker for TaDA, Varieties of unary-determined distributive $\ell$-magmas and bunched implication algebras, In praise of algebra, Tackling Real-Life Relaxed Concurrency with FSL++, Spatial-behavioral types for concurrency and resource control in distributed systems, Separation Logic for Multiple Inheritance, Unifying Semantics for Concurrent Programming, A Revisionist History of Concurrent Separation Logic, Step-Indexed Kripke Model of Separation Logic for Storable Locks, Unnamed Item, Spatial-Behavioral Types, Distributed Services, and Resources, Generic Models of the Laws of Programming
