The weakest specifunction

DOI10.1007/S00236-005-0163-5zbMATH Open1079.68021OpenAlexW2018420372MaRDI QIDQ2484065FDOQ2484065

Jeff W. Sanders, Yi F. Chen

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Refinement Calculus
• Title not available (Why is that?)
• Unifying theories for logic programming
• Guarded commands, nondeterminacy and formal derivation of programs
• Parallelism in random access machines
• Title not available (Why is that?)
• A calculus of refinements for program derivations
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Unambiguous Büchi Is Weak

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)