Publication:3791123
From MaRDI portal
zbMath0647.03018MaRDI QIDQ3791123
Publication date: 1987
Hoare logicprogram verificationfixed-point operatorexistential fixed-point logicpolynomial time complexity class
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Related Items
Stratified least fixpoint logic, Symbioses between mathematical logic and computer science, Leveraging Horn clause solving for compositional verification of PLC software, Horn Clause Solvers for Program Verification, Existential Fixed-Point Logic as a Fragment of Second-Order Logic, First-order spectra with one variable, Existential Fixed-Point Logic, Universal Quantifiers, and Topoi, One Useful Logic That Defines Its Own Truth, Fifty years of Hoare's logic, Comparison of expressive power of some query languages for databases, Infinitary logic for computer science, Positive versions of polynomial time, On the completeness of propositional Hoare logic