scientific article

zbMath0797.68002MaRDI QIDQ4024005

Gregory R. Andrews

Publication date: 23 January 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

synchronizationremote procedure callsparallel programmingmessage passingconcurrent programmingOccamLindacommunicationssemaphoresprogramming logicAdaSRTuring Plus

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of programming languages (68N15) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (27)

Delay-bounded scheduling without delay! ⋮ Bounded model checking of infinite state systems ⋮ Unnamed Item ⋮ A verification framework for agent programming with declarative goals ⋮ Using atomic await commands to develop concurrent programs in Java ⋮ Completed double layer boundary element algorithm in many-body problems for a multi-processor: An implementation on the \(CM-5\) ⋮ Combining Predicate Abstraction with Fixpoint Approximations ⋮ A semantics for concurrent separation logic ⋮ Resources, concurrency, and local reasoning ⋮ Fairness in shared invocation servicing ⋮ Data-race and concurrent-write freedom are undecidable. ⋮ The essence of parallel Algol. ⋮ Fast and scalable rendezvousing ⋮ Unnamed Item ⋮ Angelic semantics of fine-grained concurrency ⋮ Transfer Principles for Reasoning About Concurrent Programs ⋮ Simulation refinement for concurrency verification ⋮ Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism ⋮ Lost in abstraction: monotonicity in multi-threaded programs ⋮ Simple concurrent garbage collection almost without synchronization ⋮ Partial predicate abstraction and counter-example guided refinement ⋮ The semantics of the combination of atomized statements and parallel choice ⋮ Concurrency and knowledge-level communication in agent languages ⋮ Fine-grained concurrency with separation logic ⋮ Formal verification of a programming logic for a distributed programming language ⋮ A structured approach for developing concurrent programs in Java ⋮ A minimal property for characterizing deadlock-free programs

This page was built for publication: