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 31 for “"formal proof"”.

  1. Bhāviveka’s Jewel in the Hand Treatise: Elucidating a Path to Awakening Utilizing Formal Inference

    … elucidates a path to awakening utilizing formal inference in his Jewel in the Hand Treatise. Bhāviveka defines conventional reality as that of worldly experience, including language, which is for those sentient beings who are not yet awakened even though such a reality is derived from …

    calgary Repository record for Bhāviveka’s Jewel in the Hand Treatise: Elucidating a Path to Awakening Utilizing Formal Inference (opens in a new tab)

  2. The Refinement of Formal Specifications Using Reusable Software Components in Ada95

    This thesis documents research that enables formal specifications, written in the specification language Z, to be turned into high level code in fewer steps than other refinement techniques and without the need for formal proof. This method helps to overcome one of the mam stumbling blocks for …

    southwales Repository record for The Refinement of Formal Specifications Using Reusable Software Components in Ada95 (opens in a new tab)

  3. Formalising Combinatorial Structures and Proof Techniques in Isabelle/HOL

    The formalisation of mathematics is an area of increasing interest, enabling us to verify correctness, gain deeper insight into proofs, and benefit from advances in automation and search. The remarkable growth over the last decade in proof assistant capabilities and advanced formal mathematical …

    cambridge Repository record for Formalising Combinatorial Structures and Proof Techniques in Isabelle/HOL (opens in a new tab)

  4. Topics in quantum physics: Schrodinger's cat problem - time measurement accuracies in quantum mechanics

    … evolution and slows it down. I also provide a formal proof to a previously suggested limiting accuracy relation on the measurements of the time-of-arrival experiments.

    ubc Repository record for Topics in quantum physics: Schrodinger's cat problem - time measurement accuracies in quantum mechanics (opens in a new tab)

  5. Self-stabilizing wormhole routing in hypercubes

    … resulting in suboptimality of path selection. Formal proof of correctness for both solutions is given. (Abstract shortened by UMI.).

    unlv Repository record for Self-stabilizing wormhole routing in hypercubes (opens in a new tab)

  6. Simulation of timed input/output automata

    … Automaton framework, and supports TIOA, a formal language for specifying timed I/O automata. Simulation of TIOA programs is useful in the process of testing the proposed system over a specific set of executions. During the execution the Simulator is able to test proposed invariants and …

    mit Repository record for Simulation of timed input/output automata (opens in a new tab)

  7. A Technologically Enriched Geometry Curriculum

    … unit is often the first introduction to formal proof techniques in today's secondary geometry classroom, this served the study effectively. The research was conducted in an Applied Mathematics class, comprised of ten students of varying grade levels (10-12) and differing abilities. Pre …

    brockport Repository record for A Technologically Enriched Geometry Curriculum (opens in a new tab)

  8. Quantum field theories on the light front

    … terms for the interacting Dirac theory. A formal proof of the equivalence of the S-m3trix in the new formulation and the usual time-ordered expansion is given for renormalized interacting Dirac fields. A set of generalized Schwinger conditions for a quantum theory to be Lorentz invariant …

    uiuc Repository record for Quantum field theories on the light front (opens in a new tab)

  9. Pupils' competencies in proof and argumentation: differences between Korea and Germany at the lower secondary level

    … Korean and German pupils' competencies in proof and argumentation about geometry, especially at the lower secondary level. In addition, pupils' belief about mathematics will be discussed. To help explain my data, I compared the Korean educational system and mathematics curriculum, in …

    oldenburg Repository record for Pupils' competencies in proof and argumentation: differences between Korea and Germany at the lower secondary level (opens in a new tab)

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

    … some general patterns and is presented as a (formally certified) statement of adequacy. We also develop a general technique for proving bisimilarity in process algebra. Our technique, presented as a formal proof system, is applicable to a wide range of process algebras. The proof system is …

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

  11. Model checking multi-agent systems

    … common technique, but in many circumstances a formal proof of correctness is needed. Techniques for formal verification include theorem proving and model checking. Model checking techniques, in particular, have been successfully employed in the formal verification of distributed systems, …

    ucl Repository record for Model checking multi-agent systems (opens in a new tab)

  12. An automata-based automatic verification environment

    … basic motivation of this work is to build such a formal verification environment for computer-based systems. An example of such a tool is the Design Oriented Verification and Evaluation (DOVE) created by Australian Defense Science and Technology Organization. One of the advantages of DOVE is that …

    njit Repository record for An automata-based automatic verification environment (opens in a new tab)

  13. Random Variable Spaces: Mathematical Properties and an Extension to Programming Computable Functions

    … random variables. The dissertation provides a formal proof of correctness for these new rules, validating the extended framework's reliability.</p> <p>The dissertation makes contributions to the fields of mathematical logic and computation. It not only extends PCF in a significant manner but …

    chapman Repository record for Random Variable Spaces: Mathematical Properties and an Extension to Programming Computable Functions (opens in a new tab)

  14. A formal methodology for the verification of concurrent systems

    … applications. A response to this is the use of formal methods for the specification and verification of safety critical control systems. These provide a mathematical representation of a system which permits reasoning about its properties. This thesis investigates the use of the formal method …

    aston Repository record for A formal methodology for the verification of concurrent systems (opens in a new tab)

  15. Compact integrity-aware architectures

    … of such applications by constructing the first formal proof that security requirements are met by a system even when it experiences unexpected, repeated halt conditions, specifically concerning our prototype. We also developed the only remote attestation mechanism for 8-bit Atmel AVR …

    uiuc Repository record for Compact integrity-aware architectures (opens in a new tab)

  16. A likelihood ratio analysis of digital phase modulation

    … ratio of MSK. These observations prompted a formal proof of the non-existence of simplified receivers which use information from more than two symbols in their observation period. This result strictly bounds the error performance that is possible with a simplified receiver. It was also proved …

    cape-town Repository record for A likelihood ratio analysis of digital phase modulation (opens in a new tab)

  17. Razonamiento mecanizado en álgebra homológica

    … in Homological Algebra. To this end, we use the proof assistant "Isabelle". Our main motivations are to increase the knowledge in the algorithmic nature of this mathematical result, as well as to evaluate different possibilities offered by Isabelle in order to prove theorems in Homological …

    dialnet Repository record for Razonamiento mecanizado en álgebra homológica (opens in a new tab)

  18. ENCOMPASS: An Environment for Incremental Software Development Using Executable, Logic-Based Specifications

    … of software specified in a notation suitable for formal verification. VDM has been used in industrial applications to enhance the development process. In such environments VDM is applied in an informal, non-automated manner; verification conditions are generated and certified without the aid of …

    uiuc Repository record for ENCOMPASS: An Environment for Incremental Software Development Using Executable, Logic-Based Specifications (opens in a new tab)

  19. On the probability of perfection of Software-Based systems

    … testing evidence, process evidence and formal proof evidence. Also, a “quasiperfection” notion is realized as a potentially useful approach to cover some shortages of perfection models. A possible framework to incorporate the various models is discussed at the end. There are generally …

    city-london Repository record for On the probability of perfection of Software-Based systems (opens in a new tab)

  20. Specification and verification of context conditions for programming languages

    … This thesis presents a new specification formalism called CFF/AML. This formalism is · designed to be both useful for the specification of programming languages to an environment generator and also simple to use. The driving insight behind CFF/AML is that a language specifier conceives of …

    cape-town Repository record for Specification and verification of context conditions for programming languages (opens in a new tab)

Page 1 of 2