Concepts inAda exception handling: an axiomatic approach
Exception handling
Exception handling is the process of responding to the occurrence, during computation, of exceptions ¿ anomalous or exceptional situations requiring special processing ¿ often changing the normal flow of program execution. It is provided by specialized programming language constructs or computer hardware mechanisms.
more from Wikipedia
Ada (programming language)
Ada is a structured, statically typed, imperative, wide-spectrum, and object-oriented high-level computer programming language, extended from Pascal and other languages. It has strong built-in language support for explicit concurrency, offering tasks, synchronous message passing (via guarded task entries), protected objects (a monitor-like construct with additional guards as in conditional critical regions), and nondeterminism (via select statements).
more from Wikipedia
Axiomatic system
In mathematics, an axiomatic system is any set of axioms from which some or all axioms can be used in conjunction to logically derive theorems. A mathematical theory consists of an axiomatic system and all its derived theorems. An axiomatic system that is completely described is a special kind of formal system; usually though the effort towards complete formalisation brings diminishing returns in certainty, and a lack of readability for humans.
more from Wikipedia
Axiomatic semantics
Axiomatic semantics is an approach based on mathematical logic to proving the correctness of computer programs. It is closely related to Hoare logic. Axiomatic semantics define the meaning of a command in a program by describing its effect on assertions about the program state. The assertions are logical statements - predicates with variables, where the variables define the state of the program.
more from Wikipedia
Rule of inference
In logic, a rule of inference, inference rule, or transformation rule is the act of drawing a conclusion based on the form of premises interpreted as a function which takes premises, analyses their syntax, and returns a conclusion. For example, the rule of inference modus ponens takes two premises, one in the form of "If p then q" and another in the form of "p" and returns the conclusion "q".
more from Wikipedia
Pascal (programming language)
Pascal is an influential imperative and procedural programming language, designed in 1968¿ and published in 1970 by Niklaus Wirth as a small and efficient language intended to encourage good programming practices using structured programming and data structuring. A derivative known as Object Pascal designed for object-oriented programming was developed in 1985.
more from Wikipedia
Formal system
A formal system is loosely speaking, any well defined system of abstract thought, on the model of mathematics. Technically, Euclid's elements, with a model consisting of 23 definitions and 10 postulates/axioms followed by 13 books of theorems with proof, is often held to be the first formal system and displays the characteristic of a formal system.
more from Wikipedia
Axiom
An axiom is a premise or starting point of reasoning. As classically conceived, an axiom is a premise so evident as to be accepted as true without controversy. The word comes from the Greek ¿¿¿¿¿¿ 'that which is thought worthy or fit,' or 'that which commends itself as evident. ' As used in modern logic, an axiom is simply a premise or starting point for reasoning, and equivalent to what Aristotle calls a definition. Axioms define and delimit the realm of analysis.
more from Wikipedia