Filters








667 Hits in 9.8 sec

Programming language constructs for which it is impossible to obtain good hoare-like axiom systems

Edmund Melson Clarke
1977 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77  
Hoare-like deduction systems for establishing partial correctness of programs LooK,  ...  be given. 8.2 Theorem: It is impossible to obtain a system of Hoare-like axioms H for the programming language L which is sound and complete in the sense of c,r .-,. -.,- .-  ...  We show that it is impossible to obtain a sound-complete system of Hoare-like axioms for a programming language allowing both coroutines and recursion provided that we do not assume  ... 
doi:10.1145/512950.512952 dblp:conf/popl/Clarke77 fatcat:gffsutld3nflrno467tsxnreoq

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

Edmund Melson Clarke
1979 Journal of the ACM  
assertion language satisfies a natural expresstbthty condition then a sound and complete axiom system for a large subset of Algol may be devised We exhibit programming language constructs for which it  ...  ms impossible to obtain sound and complete sets of Hoare axioms even in this special sense of Cook's These constructs include (0 recursive procedures with procedure parameters in a programming language  ...  Additional programming language constructs for which it is impossible to obtain good axioms are discussed in Section 9 1.3 OUTLINE OF PAPER.  ... 
doi:10.1145/322108.322121 fatcat:ffyhp2ky3bc3jbwn6e2debkigq

A good Hoare axiom system for an ALGOL-like language

Joseph Y. Halpern
1984 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '84  
Clarke has shown that it is impossible to obtain a relatively complete axiomatization of a block-structured programming language if it has features such as static scope, reeursive procedure calls with  ...  Such an axiom system provides a tool for understanding how to reason about languages with powerful eontrol features.  ...  INTRODUCTION In a paper entitled "Programming languages for which it is impossible to obtain good Hoare axiom systems" [CI], Clarke showed that it is impossible to obtain a "good" Hoare axiom system for  ... 
doi:10.1145/800017.800538 dblp:conf/popl/Halpern84 fatcat:6hnmiqgzuvcobkgzltgvxw2hrq

The Characterization Problem for Hoare Logics [and Discussion]

E. M. Clarke, P. Aczel, J. V. Tucker, J. C. Shepherdson
1984 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences  
A natural question to ask is whether it is possible to characterize those programming languages for which sound and complete proof systems can be obtained.  ...  Specifically, we have shown that there are control structures for which it is impossible to obtain axiom systems that are sound and relatively complete in the sense of Cook.  ...  CHARACTERIZATION PROBLEM FOR HOARE LOGICS 427 Incompleteness results Are there any programming language constructs for which it is impossible to obtain good Hoare axiomatizations?  ... 
doi:10.1098/rsta.1984.0068 fatcat:6t4lqc2uzbeyrjyfsjtgaou6vq

Page 1498 of Mathematical Reviews Vol. , Issue 87c [page]

1987 Mathematical Reviews  
As it is known that there are programming languages for which it is impossible to obtain complete Hoare calculi, the question arises whether there are criteria which guarantee that a programming language  ...  It exhibits a number of function-level identities for these constructs and shows how these can be used to convert inefficient FP programs into efficient Fortran-like ones.”  ... 

Matching Logic: An Alternative to Hoare/Floyd Logic [chapter]

Grigore Roşu, Chucky Ellison, Wolfram Schulte
2011 Lecture Notes in Computer Science  
Using a simple imperative language (IMP), it is shown that a restricted use of the matching logic proof system is equivalent to IMP's Hoare logic proof system, in that any proof derived using either can  ...  This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics.  ...  To obtain a matching logic semantics for HIMP, all we need to add is one rule for each new language construct, as shown in Fig. 3 .  ... 
doi:10.1007/978-3-642-17796-5_9 fatcat:zz5usc3qjjbgbd7a7oladuorhy

An overview of the Tecton proof system

D. Kapur, X. Nie, D.R. Musser
1994 Theoretical Computer Science  
The Tecton proof system is an experimental tool for constructing proofs of first-order logic formulas and of program specifications expressed using formulas in Hoare's axiomatic proof formalism.  ...  It is designed to make interactive proof construction easier than with previous proof tools, by maintaining multiple proof attempts internally in a structured form called a proof forest; displaying them  ...  Acknowledgment Raj Agarwal, Michael Seager, and Changqing Wang have assisted in the implementation of Tecton, particularly of the program parser, Hoare formula generator, and  ... 
doi:10.1016/0304-3975(94)90192-9 fatcat:fnkjdxg2lbf5xl7axzibotkkba

A verification framework for agent programming with declarative goals

F.S. de Boer, K.V. Hindriks, W. van der Hoek, J.-J.Ch. Meyer
2007 Journal of Applied Logic  
The notion of a commitment strategy-one of the main theoretical insights due to agent logics, which explains the relation between beliefs and goals-is used to construct a computational semantics for GOAL  ...  In this paper, the programming language GOAL is introduced which incorporates such declarative goals.  ...  logic in use to implementations which meet this specification in, for example, an object-oriented programming language like Java.  ... 
doi:10.1016/j.jal.2005.12.014 fatcat:3jhoftbtvbdxlh47fiqd2oq65m

Verification conditions for source-level imperative programs

Maria João Frade, Jorge Sousa Pinto
2011 Computer Science Review  
An inference system of Hoare logic for annotated programs is shown in Fig. 5 . We name it system Hga.  ...  It is also easier to modify a program verification system organised in this way. For instance if the programming language is modified, only the first step above is affected.  ... 
doi:10.1016/j.cosrev.2011.02.002 fatcat:3dlygn76mnhlthqoxjcgvljlva

Insight, Inspiration and Collaboration [chapter]

C. B. Jones, A. W. Roscoe
2010 Reflections on the Work of C.A.R. Hoare  
Tony Hoare's many contributions to computing science are marked by insight that was grounded in practical programming.  ...  We examine the development of his work through a review of the development of some of his most influential pieces of work such as Hoare logic, CSP and Unifying Theories.  ...  The first author's research is supported by the EPSRC Platform Grant on "Trustworthy Ambient Systems" and EU FP7 "DEPLOY project". The  ... 
doi:10.1007/978-1-84882-912-1_1 fatcat:a6bc3renrzeoxfx3tmzglpagjm

Agent Programming with Declarative Goals [article]

F.S. de Boer, K.V. Hindriks, W. van der Hoek, J.-J.Ch. Meyer
2002 arXiv   pre-print
In this paper, a new programming language called GOAL is introduced which incorporates such declarative goals.  ...  The notion of a 'commitment strategy' - one of the main theoretical insights due to agent logics, which explains the relation between beliefs and goals - is used to construct a computational semantics  ...  logic in use to implementations which meet this specification in, for example, an object-oriented programming language like Java.  ... 
arXiv:cs/0207008v1 fatcat:hh32eowqqbcupjsu6cnc5c4o6a

The early search for tractable ways of reasoning about programs

C.B. Jones
2003 IEEE Annals of the History of Computing  
Over time it became clear that post facto verification is only practical for small programs and attention turned to verification methods which support the development of programs; for larger programs it  ...  is necessary to exploit a notation of compositionality.  ...  Acknowledgements This text is an extended version of a paper which was to have been published  ... 
doi:10.1109/mahc.2003.1203057 fatcat:xq3pteyxnvfmtct5ahzc3ou6ci

Reasoning about procedures as parameters [chapter]

S. M. German, E. M. Clarke, J. Y. Halpern
1984 Lecture Notes in Computer Science  
Introduction In [2] it was shown that for sufficiently complex Algol-like languages there cannot be a Hoare axiom system which is sound and relatively complete in the sense of Cook [4].  ...  This intuition is supported by [9], where a precise characterization is given for the class of Hoare axiom systems based on copy rules, and it is shown that none of these axiom systems can deal adequately  ...  "Programming language constructs for which it is impossible to obtain good Hoare-like axioms."  ... 
doi:10.1007/3-540-12896-4_365 fatcat:mivqartqancfjijswqgpxuskq4

Quantum Hoare Type Theory [article]

Kartik Singhal
2021 arXiv   pre-print
QHTT has the potential to be a unified system for programming, specifying, and reasoning about quantum programs.  ...  As quantum computers become real, it is high time we come up with effective techniques that help programmers write correct quantum programs.  ...  Acknowledgments I would like to thank John Reppy and Robert Rand for their guidance.  ... 
arXiv:2012.02154v2 fatcat:aiqmck3cdjatlgtaq6odwsjqsq

In praise of algebra

Tony Hoare, Stephan van Staden
2012 Formal Aspects of Computing  
We end with a section in praise of algebra, of which Carroll Morgan is such a master.  ...  We survey the well-known algebraic laws of sequential programming, and extend them with some less familiar laws for concurrent programming.  ...  Acknowledgments We are grateful to the anonymous referees of this paper, who made many suggestions for its improvement.  ... 
doi:10.1007/s00165-012-0249-0 fatcat:6jsnrjik7fc5nhiqlu3w5edpii
« Previous Showing results 1 — 15 out of 667 results