Recursive Assertions are not enough - or are they?

No abstract is available for this paper.

• Publication year

  1979

• Venue

  Theoretical Computer Science

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/0304-3975(79)90058-6
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems

  1979cited by this paper
• A New Incompleteness Result for Hoare's System

  1978cited by this paper
• Soundness and Completeness of an Axiom System for Program Verification

  1978cited by this paper
• Programming language constructs for which it is impossible to obtain good hoare-like axiom systems

  1977cited by this paper
• A consistent and complete deductive system for the verification of parallel programs

  1976cited by this paper
• The case for the assert statement

  1976cited by this paper
• On the Completeness of the Inductive Assertion Method

  1975cited by this paper
• A simple axiomatic basis for programming language constructs

  1973cited by this paper
• Mathematical logic

  1967cited by this paper
• Mathematical Aspects of Computer Science

  1967cited by this paper
• The classical and the ω-complete arithmetic

  1958cited by this paper

• Practical End-to-End Verification of Cyber-Physical Systems

  2021cites this paper
• Toward Structured Proofs for Dynamic Logics 1 : 3

  2019cites this paper
• Toward Structured Proofs for Dynamic Logics

  2019cites this paper
• Completeness of Hoare Logic Relative to the Standard Model

  2017cites this paper
• On Completeness Results of Hoare Logic Relative to the Standard Model

  2017cites this paper
• Effectively Eliminating Auxiliaries

  2016cites this paper
• Formal Verification of Temporal Properties for Parametrized Concurrent Programs and Concurrent Data Structures

  2015cites this paper
• Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks

  2013cites this paper
• Books and Edited Volumes Lambda Calculus and Rewrite Systems

  2007cites this paper
• about the Internet and Networking : 2010 – 2019

  2003cites this paper
• Inadequacy of computable loop invariants

  2001cites this paper
• Methods and Logics for Proving Programs

  1991cites this paper
• Some General Incompleteness Results for Partial Correctness Logics

  1988cites this paper
• Semantically Based Axiomatics

  1987cites this paper
• Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs

  1982cites this paper
• Recursive assertions and parallel programs

  1981influential citation
• Algebraically Specified Programming Systems and Hoare's Logic

  1981cites this paper
• Ten Years of Hoare's Logic: A Survey—Part I

  1981cites this paper
• Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes

  1980cites this paper
• Axiomatic definitions of programming languages: a theoretical assessment (preliminary report)

  1980cites this paper
• Program Equivalence and Provability

  1979cites this paper
• Proving the correctness of coroutines without history variables

  1978cites this paper