scientific article; zbMATH DE number 3890704

zbMATH Open0558.68012MaRDI QIDQ3347264FDOQ3347264

Authors: Krzysztof R. Apt 

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 35422
• On the complexity analysis of static analyses
• Symbolic analysis tools for CSP
• A static analysis framework for livelock freedom in CSP
• Static Livelock Analysis in CSP
• The MEB and CEB Static Analysis for CSP Specifications
• scientific article; zbMATH DE number 3903944
• Static analysis, abstract interpretation and verification in (constraint logic) programming

zbMATH Keywords

static analysiscommunicationscorrectness proofs of concurrent and distributed programsreducing complexity of the correctness proofs of CSP programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (15)

• A static analysis framework for livelock freedom in CSP
• Title not available (Why is that?)
• Static checking of variable handling in Dijkstra's Guarded Commands language
• Static Livelock Analysis in CSP
• Title not available (Why is that?)
• Communicating Sequential Processes. The First 25 Years
• Static analysis: a brief survey
• Title not available (Why is that?)
• An algorithm for analyzing communicating processes
• Total correctness of CSP programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The MEB and CEB Static Analysis for CSP Specifications
• Static analysis based on formal models and incremental computation in Go programming
• Graph generation to statically represent CSP processes

This page was built for publication:

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