Program invariants as fixedpoints
- 1 December 1979
- journal article
- research article
- Published by Springer Nature in Computing
- Vol. 21 (4), 273-294
- https://doi.org/10.1007/bf02248730
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A necessary and sufficient condition for the existence of hoare logicsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977
- Implementation of an array bound checkerPublished by Association for Computing Machinery (ACM) ,1977
- Programming language constructs for which it is impossible to obtain good hoare-like axiom systemsPublished by Association for Computing Machinery (ACM) ,1977
- A complete and consistent hoare axiomatics for a simple programming languagePublished by Association for Computing Machinery (ACM) ,1977
- Proof Theory of Partial Correctness Verification SystemsSIAM Journal on Computing, 1976
- A new incompleteness result for Hoare's systemPublished by Association for Computing Machinery (ACM) ,1976
- The lattice of flow diagramsPublished by Springer Nature ,1971
- Formalization of Properties of Functional ProgramsJournal of the ACM, 1970
- Assigning meanings to programsPublished by American Mathematical Society (AMS) ,1967