Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"Undefinedness"”.
-
The problem of undefinedness in specifications.
Conventional approaches to the formal specifications of computing systems do not provide a facility for leaving elements undefined. The purpose of this thesis is to introduce a formalism for such a facility and to examine its affect on the underlying semantics. These ideas are thus a modification …
-
Unifying Theories of Logics with Undefinedness
A relational approach to the question of how different logics relate formally is described. We consider three three-valued logics, as well as classical and semi-classical logic. A fundamental representation of three-valued predicates is developed in the Unifying Theories of Programming (UTP) …
-
Defining the undefinedness of C11 : practical semantics-based program analysis
… examples of all 77 categories of core language undefinedness appearing in the C11 standard, more than any other tool we considered. Based on this evaluation, we argue that our work is the most comprehensive and complete semantic treatment of undefined behavior in C, and thus of the C language …
-
REASONING ABOUT DEFINEDNESS - A DEFINEDNESS CHECKING SYSTEM FOR AN IMPLEMENTED LOGIC
… is crucial for an implementation of a logic with undefinedness. The objective of the MathScheme project is to develop a new approach to mechanized mathematics that seeks to combine the capabilities of computer algebra systems and computer theorem proving systems. Chiron, the underlying logic of …
-
A refinement calculus for expressions
… of expressions which includes features for undefinedness, non-determinism and partiality. The added constructs allow the easy formulation of expressive and abstract specifications, giving maximum freedom to the implementor. The issue of methods to structure large specifications is addressed …
-
Partial-valued logic
… of a partial-valued semantics which admits of undefinedness in a uniform way in all categories. But we restrict special attention to a simple kind of first-order language with terms and quantifiers and a discrete and determinate identity relation. There is, finally, a section devoted to …
-
A runtime assertion checker for the Java Modeling Language
… The translation rules handle various kinds of undefinedness, such as runtime exceptions and non-executable constructs, in such a way as to both satisfy the standard rules of logic and detect as many assertion violations as possible. The rules also support various forms of quantifiers. …
-
Contributions to the Model Theory of Higher-Order Logic
In this thesis, we develop the model theory of higher-order logic by working in Alonzo, a classical higher-order logic based on Church's formulation of simple type theory that extends first-order logic and that admits undefined expressions. In particular, we sharpen the Löwenheim-Skolem theorem …