scientific article; zbMATH DE number 176727

MaRDI QIDQ4036556zbMATH OpenFDO

Authors Limor Fix, Nissim Francez, Orna Grumberg

Publication date 18 May 1993

zbMATH Keywords

fair schedulerfair terminationgapped- terminationmodularityparallel-composed programproof system for union and superpositionunfair scheduler

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 3956417
• A foundation for modular reasoning about safety and progress properties of state-based concurrent programs
• scientific article; zbMATH DE number 177256
• On the completeness of modular proof systems
• Logical foundations for compositional verification and development of concurrent programs in UNITY

Cited in

(17)

• Program composition via unification
• A methodology of structured-modular composition programming
• Optimization issues in structured-modular composition programming technology
• Modular verification of programs with effects and effects handlers
• Compositional analysis of C/C++ programs with veriSoft
• Program verification with interacting analysis plugins
• Sound, modular and compositional verification of the input/output behavior of programs
• Modular termination verification for non-blocking concurrency
• Compositional termination proofs for multi-threaded programs
• Parameterized weighted containment
• scientific article; zbMATH DE number 1487634 (Why is no real title available?)
• Towards modularly comparing programs using automated theorem provers
• Program composition via unification
• Mathematical Foundations of Computer Science 2004
• An experiment in program composition and proof
• Modular specification and verification of object-oriented programs
• Modular inference of subprogram contracts for safety checking

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 Q4036556)