Proving entailment between conceptual state specifications

DOI10.1016/0304-3975(86)90007-1zbMATH Open0632.68026OpenAlexW1525901496MaRDI QIDQ1095649FDOQ1095649

Authors: Eugene W. Stark 

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90007-1

zbMATH Keywords

temporal logicconcatenationspecification languageconceptual state specificationsentailment between specificationsFIFO bufferssimulation between machines

Mathematics Subject Classification ID

Data structures (68P05) Theory of operating systems (68N25)

Cites Work

• Proof of correctness of data representations
• Specifying Concurrent Program Modules
• Proving Liveness Properties of Concurrent Programs
• Abstract data types and software validation
• Title not available (Why is that?)
• Verifying temporal properties without temporal logic

Cited In (4)

• The existence of refinement mappings
• Proving properties of states in the situation calculus
• Application of the composition principle to unity-like specifications
• Two implementation relations and the correctness of communicating replicated processes

This page was built for publication: Proving entailment between conceptual state specifications

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