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 16 of 16 for “"denotational semantics"”.
-
Modular Compilers and Their Correctness Proofs
… Modular compilers are defined in terms of denotational semantics based on monads, monad transformers, and a new model of staged computation called metacomputations. A novel form of denotational specification called observational program specification and related proof techniques are …
-
A verified compiler for Handel-C
… compile the program are proven to preserve the semantics, the correctness of the entire compilation process (i.e., semantic equivalence between source and target programs) can be argued by construction, considering each programming construct in isolation, rather than trying to assert the …
-
A topological framework for program semantics
Program semantics can be viewed relationally as in relational semantics, algebraically as in predicate transformer semantics, logically as in information systems and order-theoretically as in denotational semantics. This can be compared to a common situation in non-classical logics. Namely, a logic …
-
A Tag Contract Framework for Modeling Heterogeneous Systems
… design and verification difficult. Sev- eral denotational frameworks have been proposed to handle heterogeneity using a variety of approaches. However, the application of heterogeneous modeling frameworks to contract-based design has not yet been investigated. In this work, we develop an …
-
Spell checkers and correctors : a unified treatment
… An approach that is similar to the way in which denotational semantics used to describe programming languages is adopted. Secondly, the various attributes of existing spell checking and correcting techniques are discussed. Extensive studies on selected spell checking/correcting algorithms and …
-
Generalized metrics and topology in logic programming semantics
… orders. The latter theorem is fundamental in denotational semantics since semantic operators in most programming language paradigms satisfy its requirements. The use of negation in logic programming and non-monotonic reasoning, however, renders some semantic operators to be non-monotonic, …
-
Automatic Integration and Differentiation of Probabilistic Programs
… language and are proven correct using denotational semantics and logical relations. The resulting framework enables the sound and automated implementation of a wide range of algorithms for probabilistic inference and learning. To demonstrate the practical value of these techniques, we …
-
Reasoning about effectful programs and evaluation order
… for effect-dependent transformations, and a denotational semantics based on order-enriched category theory that can be used to prove correctness.
-
Multimodal Networks in Biology
… or hypergraph projections can be performed. A denotational semantics approach is used to specify the semantics of each hyperedge in MMN in terms of interaction among its vertices. This is done by mapping each hyperedge e to a hyperedge code algo:V(e), an algorithm that details how the vertices …
-
Functional Programming and Metamodeling frameworks for System Design
… flows based on these languages lack formal semantics underpinnings making it difficult to prove that refinements preserve correctness, and third, none of the available SLDLs are easily customizable by users. In our work, we address these problems as follows: To alleviate the first problem, …
-
Expressiveness of Concurrent Languages
… for storing messages. After having defined a denotational semantics based on traces, we obtain fully abstract semantics for both languages by using suitable abstractions in order to identify different traces which do not correspond to different behaviours. Since the ability of one of the two …
-
Programming and static analysis with graded monads
… using monads. Recent research in program semantics has focussed on graded monads, a useful generalisation of monads which allow the programmer to establish useful properties of a computation purely from their type of a computation. They have been used to represent a variety of properties …
-
A Framework for Specifying Business Rules Based on Logic with a Syntax Close to Natural Language
… domains. Atomic formulas are underpinned by a denotational semantics, which is based on Tempura (executable subset of Interval Temporal Logic (ITL)) to describe behaviour and the Object Constraint Language (OCL) to describe invariants and pre- and postconditions. APRIL statements can be used as …
-
Formally justified and modular Bayesian inference for probabilistic programs
… code. It has long been recognised that the semantics of programming languages is complicated and the intuitive understanding that programmers have is often inaccurate, resulting in difficult to understand bugs and unexpected program behaviours. Programming languages are therefore studied in …
-
Probabilistic concurrent game semantics
… Probabilistic PCF. For the former, we relate the semantics to the probabilistic Nakajima trees of Leventis, thus obtaining a characterisation of observational equivalence for programs in terms of strategies. For the latter, we show a definability result in the spirit of the game semantics …