Locally abstract, globally concrete semantics of concurrent programming languages

DOI10.1007/978-3-319-66902-1_2MaRDI QIDQ1694447zbMATH OpenOpenAlexFDO

Authors Crystal Chang Din, Reiner Hähnle, Einar Broch Johnsen, Silvia Lizeth Tapia Tarifa, Ka I Pun

Publication date 2 February 2018

Full work available at URL https://doi.org/10.1007/978-3-319-66902-1_2

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of programming languages (68N15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 3958700
• A fully abstract may testing semantics for concurrent objects
• scientific article; zbMATH DE number 3932376
• scientific article; zbMATH DE number 3890713
• scientific article; zbMATH DE number 1424057

Cited in

(17)

• Partial order and contextual net semantics for atomic and locally atomic CC programs
• Abstract interpretation of trace semantics for concurrent calculi
• Designing a semantic model for a wide-spectrum language with concurrency
• Fully abstract trace semantics for protected module architectures
• A small-step semantics of a concurrent calculus with Goroutines and deferred functions
• A formal semantics for debugging synchronous message passing-based concurrent programs
• Abstract local reasoning for concurrent libraries: mind the gap
• Direct semantics of concurrent languages in the SMoLCS approach
• scientific article; zbMATH DE number 1761891 (Why is no real title available?)
• Abstract Semantic Diffing of Evolving Concurrent Programs
• Thread-Local Semantics and Its Efficient Sequential Abstractions for Race-Free Programs
• Programming Languages and Systems
• A fully abstract may testing semantics for concurrent objects
• Tools and Algorithms for the Construction and Analysis of Systems
• Runtime enforcement using knowledge bases
• Choice trees: representing and reasoning about nondeterministic, recursive, and impure programs in Rocq
• Trace-based deductive verification

This page was built for publication: Locally abstract, globally concrete semantics of concurrent programming languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1694447)