Effective Axiomatizations of Hoare Logics

Authors:
Edmund M. Clarke, Jr.;Steven M. German;Joseph Y. Halpern
Affiliations:
Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA and Harvard University, Cambridge, Massachusetts;Aiken Computation Laboratories, Harvard University, Cambridge, MA and Massachusetts and Stanford University, Stanford, California;IBM San Jose Laboratory, 5600 Cottle Road, San Jose, CA and Harvard University, Cambridge, Massachusetts, Massachusetts Institute of Technology, Cambridge, Massachusetts
Venue:
Journal of the ACM (JACM)
Year:
1983

Citing 8
Cited 7

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

Journal of the ACM (JACM)
Axiomatic Definitions of Programming Languages: A Theoretical Assessment

Journal of the ACM (JACM)
An axiomatic basis for computer programming

Communications of the ACM
First-Order Dynamic Logic

First-Order Dynamic Logic
On effective axiomatizations of Hoare logics

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Axiomatic definability and completeness for recursive programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Present-Day Hoare-Like Systems for Programming Languages with Procedures: Power, Limits and most Likely Expressions

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Hoare's Logic is Incomplete When It Does Not Have To Be

Logic of Programs, Workshop

Meager and replete failures of relative completeness

Journal of the ACM (JACM)
Towards fully abstract semantics for local variables

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Strategic directions in software engineering and programming languages

ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
On Hoare logic and Kleene algebra with tests

ACM Transactions on Computational Logic (TOCL)
The Birth of Model Checking

25 Years of Model Checking
On revival of Algol-concepts in modern programming and specification languages

Formal methods and hybrid real-time systems
Expressibility Of The Semantics Of Sequential Programs In First-Order Logic

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract