Proving entailment between conceptual state specifications (Q1095649): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(86)90007-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1525901496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying temporal properties without temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract data types and software validation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of correctness of data representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specifying Concurrent Program Modules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Liveness Properties of Concurrent Programs / rank
 
Normal rank

Latest revision as of 13:38, 18 June 2024

scientific article
Language Label Description Also known as
English
Proving entailment between conceptual state specifications
scientific article

    Statements

    Proving entailment between conceptual state specifications (English)
    0 references
    0 references
    1988
    0 references
    See the preliminary version in Lect. Notes Comput. Sci. 213, 197-209 (1986; Zbl 0587.68020).
    0 references
    0 references
    temporal logic
    0 references
    specification language
    0 references
    conceptual state specifications
    0 references
    entailment between specifications
    0 references
    simulation between machines
    0 references
    concatenation
    0 references
    FIFO buffers
    0 references
    0 references