Program invariants as fixedpoints
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3485183 (Why is no real title available?)
- scientific article; zbMATH DE number 3569792 (Why is no real title available?)
- scientific article; zbMATH DE number 3569793 (Why is no real title available?)
- scientific article; zbMATH DE number 3436597 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- scientific article; zbMATH DE number 3349291 (Why is no real title available?)
- scientific article; zbMATH DE number 3351184 (Why is no real title available?)
- scientific article; zbMATH DE number 3362972 (Why is no real title available?)
- A Complete and Consistent Hoare Axiomatics for a Simple Programming Language
- An axiomatic basis for computer programming
- Consistent and complementary formal theories of the semantics of programming languages
- Formalization of Properties of Functional Programs
- Grammar Analysis and Parsing by Abstract Interpretation
- Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
Cited in
(9)- Meanings of model checking
- The Birth of Model Checking
- scientific article; zbMATH DE number 7589540 (Why is no real title available?)
- Computing differential invariants of hybrid systems as fixed points
- Computing Differential Invariants of Hybrid Systems as Fixedpoints
- Semantics of algorithmic languages
- Stratified least fixpoint logic
- SMT-based model checking for recursive programs
- Differential game logic
This page was built for publication: Program invariants as fixedpoints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1254848)
