An Axiomatic Definition of the Programming Language PASCAL

@inproceedings{Hoare1973AnAD,
  title={An Axiomatic Definition of the Programming Language PASCAL},
  author={Charles Antony Richard Hoare and Niklaus Wirth},
  booktitle={Acta Informatica},
  year={1973}
}
The axiomatic definition method proposed in reference [5] is extended and applied to define the meaning of the programming language PASCAL [1]. The whole language is covered with the exception of real arithmetic and go to statements. 
An axiomatic definition of the programming language PASCAL
TLDR
The axiomatic definition method proposed in reference [5] is extended and applied to define the meaning of the programming language PASCAL with the exception of real arithmetic and go to statements.
Proof rules for the programming language Euclid
TLDR
This paper describes Hoare-style proof rules for Euclid, a programming language intended for the expression of system programs which are to be verified, and all constructs of Euclid are covered.
Correctness of the compiling process based on axiomatic semantics
SummaryA language that includes computed gotos and parameterized procedures is defined and its semantics are given axiomatically. A number of program transformations are described and proved correct.
Axiomatic definitions of programming languages: a theoretical assessment (preliminary report)
TLDR
Assertions involving only formulas of first order predicate calculus are proved capable of specifying program scheme semantics, and effective axiom systems for deriving such assertions are described.
Verification of Euclid Programs
  • J. Horning
  • Computer Science
    Program Construction
  • 1978
The proof rules for the programming language Euclid are closely modelled on the axiomatic definition of Pascal. However, there is intended to be a much closer correspondence between the language as
An Approach to Formal Definitions and Proofs of Programming Principles
  • J. Misra
  • Computer Science
    IEEE Transactions on Software Engineering
  • 1978
TLDR
A method for formal description of programming prinicples is presented, which represents a principle as a program scheme which has partially interpreted functions in it that must obey certain input constraints.
The denotational semantics of programming languages
TLDR
This paper is a tutorial introduction to the theory of programming language semantics developed by D. Scott and C. Strachey and presents a formal definition of the language GEDANKEN.
The assignment axiom and programming language design
TLDR
The effect of using the assignment rule of Hoare as such a criterion on the design of procedure-oriented, block-structured programming languages is investigated.
Formal Semantics of Programming Languages
TLDR
These notes give an overview of the main frameworks that have been developed for specifying the formal semantics of programming languages, including modularity, and potential applicability to visual and modelling languages.
An assessment of the programming language pascal
  • N. Wirth
  • Computer Science
    IEEE Transactions on Software Engineering
  • 1975
The programming language Pascal is assessed in the light of `reliable programming' and with the background of five years of experience with the language. Some features are selected to point out
...
1
2
3
4
5
...

References

SHOWING 1-6 OF 6 REFERENCES
The design of a pascal compiler
  • N. Wirth
  • Computer Science
    Softw. Pract. Exp.
  • 1971
The development of a compiler for the programming language PASCAL1 is described in some detail. Design decisions concerning the layout of program and data, the organization of the compiler including
Procedures and parameters: An axiomatic approach
  • C. Hoare
  • Computer Science
    Symposium on Semantics of Algorithmic Languages
  • 1971
TLDR
The application of the axiomatic method to the definition of procedure and parameter passing features of a high-level progr~mning language reveals that ease of demonstrating program correctness and high efficiency of implementation may be achieved simultaneously.
A note on the for statement
This note discusses methods of defining the for statement in high level languages and suggests a proof rule intended to reflect the proper role of a for statement in computer programming. It
A pascal compiler for ICL 1900 series computers
The transport of a PASCAL compiler from a CDC 6000 series computer to an ICL 1900 series computer is reported, with some comments on the method used.
Revised report on the algorithm language ALGOL 60
a survey of the basic coustituents arid fcuturcs of the language is given, and the formal notation, by which the syntactic structure is defined, is esplaincd. The sccnnd chapter lists all the basic
Notes on Data Structuring