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 20 of 30 for “"Equational Reasoning"”.

  1. Equational Reasoning about Object-Oriented Programs

    … Programs) that allows the user to prove equational properties of programs interactively.

    brock Repository record for Equational Reasoning about Object-Oriented Programs (opens in a new tab)

  2. Equational Reasoning for Verified Cryptographic Security

    … cryptographers. This thesis explores the use of equational reasoning to conduct machine-checked security proofs. Equational reasoning is pervasive in cryptography, as it underlies the concepts of game-hopping hybrids and the simulation paradigm; thus, optimizing formal tools for equational …

    cornell Repository record for Equational Reasoning for Verified Cryptographic Security (opens in a new tab)

  3. Rewriting context-free families of string diagrams

    … graphical framework which may be used for equational reasoning about morphisms of monoidal categories. However, unlike term rewriting, which is the standard way of reasoning about the morphisms of monoidal categories, rewriting string diagrams results in shorter equational proofs, because …

    oxford Repository record for Rewriting context-free families of string diagrams (opens in a new tab)

  4. !-Logic

    <p>Equational reasoning with string diagrams provides an intuitive method for proving equations between morphisms in various forms of monoidal category. !-Graphs were introduced with the intention of reasoning with infinite families of string diagrams by allowing repetition of sub-diagrams. …

    oxford Repository record for !-Logic (opens in a new tab)

  5. Lightweight Approaches to the Verification of Functional Programs

    … functional programs naturally lend themselves to equational specifications. These specifications are a desirable target for an automated verification tool because they are immediately accessible to the average programmer. Nevertheless, such a tool must tackle the thorny issue of proof by induction …

    bristol Repository record for Lightweight Approaches to the Verification of Functional Programs (opens in a new tab) Download PDF for Lightweight Approaches to the Verification of Functional Programs (opens in a new tab)

  6. PROOFS OF EQUALITY IN DEDUCTIVE DATABASE SYSTEMS

    … their utility, enabling efficient and robust equational reasoning for more sophisticated data analysis and transformations. In this paper, I introduce a proof system P≡ for deductive databases extended with equality. This system offers a formal mechanism for reasoning about equivalences within …

    cornell Repository record for PROOFS OF EQUALITY IN DEDUCTIVE DATABASE SYSTEMS (opens in a new tab)

  7. PureCake: Towards a formally verified non-strict language compiler

    … include purity, referen tial transparency and equational reasoning facilitate the proof process, ultimately encouraging the spread of formal methods.

    chalmers Repository record for PureCake: Towards a formally verified non-strict language compiler (opens in a new tab)

  8. Studies in mechanical verification of mathematical proofs

    … to solve. One particular problem, namely equational reasoning, is studied in more depth and a method for dealing with it in a convenient way is presented in a separate chapter

    radboud Repository record for Studies in mechanical verification of mathematical proofs (opens in a new tab) Download PDF for Studies in mechanical verification of mathematical proofs (opens in a new tab)

  9. Logical relation categories and lambda calculi.

    … lambda calculus, is based on a directed form of equational reasoning called reduction. In computer science terminology, reduction may be regarded as a form of symbolic evaluation. It models a sequential computation process step by step. The crucial properties for a rewriting system are …

    ottawa-retro Repository record for Logical relation categories and lambda calculi. (opens in a new tab)

  10. Graphical Recursion for String Diagrams

    … diagrams and eDSL<br/>terms, enabling sound equational reasoning on recursive diagrams and a straightforward<br/>translation between diagrams and executable code. A case study on the Quantum Fourier<br/>Transform (QFT) illustrates the end-to-end workflow: define the algorithm as a …

    bristol Repository record for Graphical Recursion for String Diagrams (opens in a new tab) Download PDF for Graphical Recursion for String Diagrams (opens in a new tab)

  11. Dependency Tracking and Dependent Types

    … DCOI gives programmers more control during equational reasoning. Third, it demonstrates that DCOIOmega, an instantiation of DCOI with a predicative universe hierarchy, is suitable as a program logic. It establishes logical consistency and normalization with a logical predicate. From …

    penn Repository record for Dependency Tracking and Dependent Types (opens in a new tab)

  12. Supporting formal reasoning about functional programs

    … functional languages are suitable for formal reasoning. This claim is supported by the fact that many people in the functional programming community do reason about languages and programs in a formal or semi-formal way. Different reasoning principles such as equational reasoning, induction and …

    glasgow Repository record for Supporting formal reasoning about functional programs (opens in a new tab) Download PDF for Supporting formal reasoning about functional programs (opens in a new tab)

  13. Contributions to the theory of syntax with bindings and to process algebra

    … for recursive definitions and inductive reasoning. Our approach consists of a combination of FOAS (First-Order Abstract Syntax) and HOAS (Higher-Order Abstract Syntax) and tries to take advantage of the best of both worlds. The connection between FOAS and HOAS follows some general …

    uiuc Repository record for Contributions to the theory of syntax with bindings and to process algebra (opens in a new tab)

  14. Type Systems for Nominal Terms

    … to<br/>informal practice, for representing and reasoning about formal languages that<br/>use binders.<br/>Nominal techniques allow a rst-order approach to binding in formal languages,<br/>providing direct access to both binders and bound variables and a formal axiomatisation of -equivalence. …

    kings Repository record for Type Systems for Nominal Terms (opens in a new tab) Download PDF for Type Systems for Nominal Terms (opens in a new tab)

  15. Region Connection Calculus: Composition Tables and Constraint Satisfaction Problems

    Qualitative spatial reasoning (QSR) is an important field of AI that deals with qualitative aspects of spatial entities. Regions and their relationships are described in qualitative terms instead of numerical values. This approach models human based reasoning about such entities closer than other …

    brock Repository record for Region Connection Calculus: Composition Tables and Constraint Satisfaction Problems (opens in a new tab)

  16. A Kleene Theorem and Decision Problems for Probability and Angelic Nondeterminism

    … and operational viewpoints: for example, the equational theory may be axiomatized, and we can classify the computations which can be carried out by the corresponding model of computation. Even in otherwise lim- ited models of computation, the combination of probability and nondetermin- ism in …

    cornell Repository record for A Kleene Theorem and Decision Problems for Probability and Angelic Nondeterminism (opens in a new tab)

  17. Algebraic Principles for Program Correctness Tools in Isabelle/HOL

    … and program construction rules are based on equational reasoning and supported by powerful Isabelle tactics and automated theorem proving. Second, the tool is expanded to support different programming features and verification methods. A basic program construction tool is developed by adding …

    whiterose Download PDF for Algebraic Principles for Program Correctness Tools in Isabelle/HOL (opens in a new tab)

  18. Towards A Practical High-Assurance Systems Programming Language

    … developers. To make the matter worse, formally reasoning about their correctness properties introduces yet another level of complexity to the task. It requires considerable expertise in both systems programming and formal verification. The development can be extremely costly due to the sheer …

    unsw Repository record for Towards A Practical High-Assurance Systems Programming Language (opens in a new tab)

  19. Putting Types To Good Use

    … good support for abstraction, composition, and equational reasoning. They also feature advanced type systems, which can be used to warn programmers about a certain class of mistakes early. This thesis investigates the usefulness of hybrid static/dynamic typing and polytypic programming by …

    radboud Repository record for Putting Types To Good Use (opens in a new tab) Download PDF for Putting Types To Good Use (opens in a new tab)

Page 1 of 2