scientific article; zbMATH DE number 3890704

MaRDI QIDQ3347264zbMATH OpenFDO

Authors Krzysztof R. Apt

Publication date 1984

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)

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

Cited in

(15)

• A static analysis framework for livelock freedom in CSP
• scientific article; zbMATH DE number 4052987 (Why is no real title available?)
• Static Livelock Analysis in CSP
• Static checking of variable handling in Dijkstra's Guarded Commands language
• scientific article; zbMATH DE number 2079674 (Why is no real title available?)
• Communicating Sequential Processes. The First 25 Years
• Static analysis: a brief survey
• scientific article; zbMATH DE number 3903944 (Why is no real title available?)
• Total correctness of CSP programs
• An algorithm for analyzing communicating processes
• scientific article; zbMATH DE number 35422 (Why is no real title available?)
• scientific article; zbMATH DE number 3911719 (Why is no real title available?)
• 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)