Programs as partial graphs. I: Flow equivalence and correctness (Q1168723): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q127436288, #quickstatements; #temporary_batch_1726362513169
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Decidable Properties of Monadic Functional Schemas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5649409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of the inductive assertion method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Properties of Programs by Structural Induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5626272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5677070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4403707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarded commands, nondeterminacy and formal derivation of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic structure of rooted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5584402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Properties of Predicate Transformers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matrix program schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Algebras with Operators. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Algebras with Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On formalised computer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The representation of relational algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The representation of relation algebras. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4772698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of Programs and the First-Order Predicate Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalization of Properties of Functional Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations binaires, fermetures, correspondances de Galois / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programs as partial graphs. II: Recursion / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127436288 / rank
 
Normal rank

Latest revision as of 02:10, 15 September 2024

scientific article
Language Label Description Also known as
English
Programs as partial graphs. I: Flow equivalence and correctness
scientific article

    Statements

    Programs as partial graphs. I: Flow equivalence and correctness (English)
    0 references
    0 references
    1981
    0 references
    program semantics
    0 references
    correctness
    0 references
    termination
    0 references
    programs as partial graphs
    0 references

    Identifiers