The weakest specifunction

DOI10.1007/S00236-005-0163-5MaRDI QIDQ2484065zbMATH OpenOpenAlexFDO

Authors Yi F. Chen, Jeff W. Sanders

Publication date 2 August 2005

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-005-0163-5

zbMATH Keywords

dynamic load balancingspecifunction

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• The weakest prespecification
• scientific article; zbMATH DE number 3974258
• Proof system for weakest prespecification
• Parallel composition and decomposition of specifications
• Two small parallel programming exercises

Cites work

• scientific article; zbMATH DE number 3116984 (Why is no real title available?)
• scientific article; zbMATH DE number 3974258 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 605806 (Why is no real title available?)
• scientific article; zbMATH DE number 1105469 (Why is no real title available?)
• scientific article; zbMATH DE number 2163031 (Why is no real title available?)
• scientific article; zbMATH DE number 1864594 (Why is no real title available?)
• scientific article; zbMATH DE number 814821 (Why is no real title available?)
• A calculus of refinements for program derivations
• Guarded commands, nondeterminacy and formal derivation of programs
• Parallelism in random access machines
• Refinement Calculus
• Unifying theories for logic programming

Cited in

(1)

• Unambiguous Büchi Is Weak

Describes a project that uses

Uses Software

• Eiffel

This page was built for publication: The weakest specifunction

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