Skip to content
Carmelics
TopicsThinkersChangesContributorsLoading account…

    Carmelics

    A reasoning platform. Break down any belief into clear reasons, explore both sides, and weigh the evidence honestly.

    Navigate

    • Topics
    • Search
    • Recent Changes
    • Contribute
    • How It Works
    • Glossary
    • Thinkers
    • Contributors
    • About
    • Statistics
    • Terms
    • Privacy

    Database

    Statements
    —
    Perspectives
    —
    Topics
    —

    Press ? for keyboard shortcuts

    LoyalLoyalJusticeJustice
    Made withinDC&Austin
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    The Floyd-Naur inductive assertion method was a way to pr... — Carmelics
    Home/Philosophy of Language
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→Hoare logic is a true logic of programs, not merely a proof method

    The Floyd-Naur inductive assertion method was a way to prove program correctness using logic, but was not itself a logic in the strict sense

    Philosophy of LanguageTruth & Knowledge
    ?Rate how convincing each reason is below to see the overall strength.

    No one has weighed in yet. Be the first to share reasons for or against this statement.

    Sign in or register to share your perspective on this statement.

    Topics

    Philosophy of LanguageTruth & Knowledge

    Related

    Hoare exploited the syntactic structure of imperative programs to derive composi...Hoare introduced Hoare triples of the form {P}S{Q} as formal assertions, giving ...Hoare logic is a true logic of programs, not merely a proof method

    Next step

    Based on where you are in your exploration

    Browse more in Philosophy of Language
    Related propositions within the same area of thought.

    Similar

    Hoare logic is a true logic of programs, not merely a proof method81%If IBE is merely an alternative way of characterizing inductive infere...77%The purpose of inductive logic is to provide a measure of the extent t...76%Permitting hidden premises in inductive logic is analogous to permitti...76%

    Source

    AI-extracted
    SEP: logic-action
    View source passageHide passage
    Program verification has a long history. Already since the inception of the computer and its programming researchers started to think of ways of analyzing programs to be sure they did what they were supposed to do. In the 60s the development of a true mathematical theory of program correctness began to take serious shape (de Bakker 1980, 466). Remarkably, the work of John McCarthy who we will also encounter later on when we turn to the field of artificial intelligence played an important role he

    Details

    Type
    premise
    Perspectives
    0 (0 for, 0 against)
    Edits
    1 edit

    Open for perspectives

    This idea is waiting for its first supporting or challenging perspective.

    Share the first perspective