On the strength of temporal proofs (Q809066): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The power of temporal proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete logic for reasoning about programs via nonstandard model theory. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programs and program verifications in a general setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A completeness theorem for dynamic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PROPERTY OF 2‐SORTED PEANO MODELS AND PROGRAM VERIFICATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of philosophical logic. Vol. 9 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4726228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order dynamic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cylindric algebras. Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: To the memory of Arthur Prior Formal properties of ‘now’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the termination of program schemas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3711745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak second order characterizations of various program verification systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3956390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-standard algorithmic and dynamic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive programs and denotational semantics in absolute logics of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3744163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3896482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STRUCTURED NONSTANDARD DYNAMIC LOGIC / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof for the completeness of Floyd's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total correctness in nonstandard logics of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary proof for some semantic characterizations of nondeterministic Floyd-Hoare logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logics need their clocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3472083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinateness of program equivalence over peano axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3979260 / rank
 
Normal rank

Latest revision as of 18:20, 21 June 2024

scientific article
Language Label Description Also known as
English
On the strength of temporal proofs
scientific article

    Statements

    On the strength of temporal proofs (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    The theme in this work is the strengths of various temporal logics. The results are in the style of Abadi, Manna, and Pnueli, often drawing on their work. The system used includes the modalities ``first'', ``next'', ``always'', ``always in the future'', and ``always in the past''. A typical theorem is that the partial correctness assertions provable in some previously proposed systems (e.g. Floyd-Hoare's or Harel's) are exactly those implied (either syntactically with a proof or semantically by being true in all models) by a system currently under consideration. There is also some attention paid to total correctness assertions and arbitrary assertions in the temporal languages. Even though most of the paper is a survey, it is best suited for those with some prior experience with this subject: many notions drawn on from elsewhere are not defined, and the exposition is wanting.
    0 references
    0 references
    0 references
    0 references
    0 references
    temporal logics
    0 references
    correctness assertions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references