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 14 of 14 for “"Unifying Theories of Programming"”.

  1. Embedding an object calculus in the unifying theories of programming

    Hoare and He's Unifying Theories of Programming (UTP) provides a rich model of programs as relational predicates. This theory is intended to provide a single framework in which any programming paradigms, languages, and features, can be modelled, compared and contrasted. The UTP already has models …

    oxford Repository record for Embedding an object calculus in the unifying theories of programming (opens in a new tab)

  2. Denotational Semantics of Mobility in Unifying Theories of Programming (UTP)

    UTP promotes the unification of programming theories and has been used successfully for giving denotational semantics to Imperative Programming, CSP process algebra, and the Circus family of programming languages, amongst others. In this thesis, we present an extension of UTP-CSP (the UTP semantics …

    whiterose Download PDF for Denotational Semantics of Mobility in Unifying Theories of Programming (UTP) (opens in a new tab)

  3. The formal semantics of a domain-specific modelling language

    … industry as a common language for the design of asynchronous communicating systems. Designs expressed in SDL can be given a formal, mathematical interpretation to facilitate analysis and to guide correct implementation. The standard formalisation of SDL is adequate for the purposes of language …

    oxford Repository record for The formal semantics of a domain-specific modelling language (opens in a new tab)

  4. Algebraic laws for process subtyping

    … Inspirado pela engenharia, o desenvolvimento de software deve preterir a abordagem empirica e seguir uma abordagem estruturada, formal, passível de repetição e prova face ao advento de sistemas mais complexos, paralelos e concorrentes. Este trabalho apresenta uma extensão conservativa de OhCircus, …

    brazil-ufpe Repository record for Algebraic laws for process subtyping (opens in a new tab)

  5. 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) …

    whiterose Download PDF for Unifying Theories of Logics with Undefinedness (opens in a new tab)

  6. On Confidentiality and Formal Methods

    The contemporary challenge of engineering verifiably secure software has motivated various techniques for measuring and regulating the flow of confidential data from systems to their users. Unfortunately, these techniques suffer from a lack of integration with modern formal methods for software …

    whiterose Download PDF for On Confidentiality and Formal Methods (opens in a new tab)

  7. A strategy to verify the code generation from concurrent and state-rich circus specifications to executable code

    The use of Automatic Code Generators for Formal Methods not only minimizes efforts on the implementation of Software Systems, but also reduces the chance of existing errors on the execution of such Systems. These tools, however, can themselves have faults on their source codes that may cause errors …

    brazil-ufrn Repository record for A strategy to verify the code generation from concurrent and state-rich circus specifications to executable code (opens in a new tab)

  8. Angelic Processes

    In the formal modelling of systems, demonic and angelic nondeterminism play fundamental roles as abstraction mechanisms. The angelic nature of a choice pertains to the property of avoiding failure whenever possible. As a concept, angelic choice first appeared in automata theory and Turing machines, …

    whiterose Download PDF for Angelic Processes (opens in a new tab)

  9. USIMPL: An Extension of Isabelle/UTP with Simpl-like Control Flow

    … and existing tools for the formal verification of programs do not scale well to large, complicated codebases such as that of systems software. This thesis presents USIMPL, a component of the Orca project for formal verification that builds on Foster’s Isabelle/UTP with features of Schirmer’s …

    vt Repository record for USIMPL: An Extension of Isabelle/UTP with Simpl-like Control Flow (opens in a new tab)

  10. Comparative Studies, Formal Semantics and PVS Encoding of CSP#

    … becomes an important and necessary property of large and complex systems. Many concurrent systems feature various interactions between execution processes, which are often communications via synchronous/asynchronous message passing or through shared resources. The intricate execution nature …

    nus Repository record for Comparative Studies, Formal Semantics and PVS Encoding of CSP# (opens in a new tab) Download file for Comparative Studies, Formal Semantics and PVS Encoding of CSP# (opens in a new tab)

  11. A verified compiler for Handel-C

    The recent popularity of Field Programmable Gate Array (FPGA) technology has made the synthesis of Hardware Description Language (HDL) programs into FPGAs a very attractive topic for research. In particular, the correctness in the synthesis of an FPGA programming file from a source HDL program has …

    whiterose Download PDF for A verified compiler for Handel-C (opens in a new tab)

  12. A framework for the specification and validation of Real Time Systems using Circus Action

    … A semântica de Circus está baseada na Unifying Theories of Programming (UTP). Neste trabalho, estendemos um subconjunto de Circus com operadores de tempo. A nova linguagem é denominada de Circus Time Action. Propomos um modelo novo do tempo que estende o modelo da UTP, adicionando …

    brazil-ufpe Repository record for A framework for the specification and validation of Real Time Systems using Circus Action (opens in a new tab)

  13. Model Checking of State-Rich Formalisms (By Linking to Combination of State-based Formalism and Process Algebra)

    … a grand challenge to assure the dependability of these systems with the growing complexity, especially for high integrity and safety critical systems that require extremely high dependability. Circus, as a formal language, is designed to tackle this problem by providing precision preservation …

    whiterose Download PDF for Model Checking of State-Rich Formalisms (By Linking to Combination of State-based Formalism and Process Algebra) (opens in a new tab)