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 28 for “"Computer programs--Verification"”.
-
Program verification in functional programming systems
… a number of features which facilitate program verification. Such verification may be observed to rest directly upon the theoretical foundations of computing and simultaneously to exhibit a close relation to the programs being verified. In order to demonstrate these aspects of functional …
-
Symbolic model checking techniques for BDD-based planning in distributed environments
… using the causal language, C. SMC is a formal verification technique for propositional satisfiability used to test semantic properties (e.g. Computational Tree Logic) of Boolean domains. C is an action language based on a theory of causal explanation of action effects that supports action …
-
Formal verification of computer controlled systems
… dissertation discusses the application of formal verification methods to reasoning about the correctness of computer controlled systems. Due to the switching that is introduced by the computer controller, the differential equations associated with such systems may consist of discontinuous vector …
-
Techniques for formal verification of concurrent and distributed program traces
… eliminating errors in concurrent and distributed programs include formal methods and testing. This dissertation presents an approach toward combining formal methods and testing, while avoiding the complexity of model checking or theorem proving and the pitfalls of ad hoc testing. Our technique …
-
On the role of explainability and uncertainty in ensuring safety of AI applications
… to extract OREs that uses a neural network verification tool Marabou or Neurify as a black-box solver. We demonstrate the usefulness of OREs in model development and safety assurance tasks such as model debugging, bias evaluation and repair of explanations provided by non-formal explainers …
-
Specification and analysis of timing properties in real-time systems
… proposes a formalism for the specification and verification of timing properties of real-time systems. Reasoning about properties of a real-time system requires one to consider both relative and absolute timing of events. Relative timing concerns the order in which events occur, such as mutual …
-
Automated Verification of Compiler Transformations
… complexity and the limited scalability of formal verification techniques. We present a comprehensive approach for automatic verification of compiler transformations that are the core components of any compiler design. Our approach particularly targets the foundations of state-of-the-art compilers: …
-
Productivity with performance: property/behavior-based automated composition of parallel programs from self-describing components
Development of efficient and correct parallel programs is a complex task. These parallel codes have strong requirements for performance and correctness and must operate robustly and efficiently across a wide spectrum of application parameters and on a wide spectrum of execution environments. …
-
Efficient and effective symbolic model checking
… increase the capacity of automatic state-based verification as applied to sequential designs, i.e., symbolic model checking. Firstly, we propose the use of dynamically partitioned ordered Binary Decision Diagrams as a capable data structure. This leads to vast improvements in state space …
-
Generalization, lemma generation, and induction in ACL2
Formal verification is becoming a critical tool for designing software and hardware today. Rising complexity, along with software's pervasiveness in the global economy have meant that errors are becoming more difficult to find and more costly to fix. Among the formal verification tools available …
-
Automatic verification and revision of multitolerant programs
… is based on the observation that modern programs are often subject to multiple faults. And, the requirements in the presence of these faults vary based on the nature of the faults, its severity and the cost of providing fault-tolerance to it. Also, assurance of multitolerant systems is …
-
Using theorem proving and algorithmic decision procedures for large-scale system verification
The goal of formal verification is to use mathematical methods to prove that a computing system meets its specifications. When applicable, it provides a higher assurance than simulation and testing in correct system execution. However, the capacity of the state of the art in formal verification …
-
Reachability and escape problems in linear dynamical systems
… which are a fundamental model in theoretical computer science, software verification and control theory. We focus on the reachability and escape problems in discrete and continuous linear dynamical systems, and their generalizations to pseudo-orbits, which are a model of computation with …
-
Tag-based Security in C: Writing and Specifying Flexible Protection
The C language is ubiquitous and insecure. Tag-based security policies offer a flexible toolkit for runtime protection, including policies that mitigate the effects of undetected programming bugs and those that enforce security properties of the program logic. But tag policies can be difficult to …
-
Improving Software Quality through Syntax and Semantics Verification of Requirements Models
Software defects can frequently be traced to poorly-specified requirements. Many software teams manage their requirements using tools such as checklists and databases, which lack a formal semantic mapping to system behavior. Such a mapping can be especially helpful for safety-critical systems. …
-
HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs
… the mathematics of domain theory to reason about programs written in functional programming languages. This thesis introduces HOLCF '11, a thoroughly revised and extended version of HOLCF that advances the state of the art in program verification: HOLCF '11 can reason about many program …
-
Environment Analysis of Higher-Order Languages
Any analysis of higher-order languages must grapple with the tri-facetted nature of lambda. In one construct, the fundamental control, environment and data structures of a language meet and intertwine. With the control facet tamed nearly two decades ago, this work brings the environment facet to …
-
Modelling and verification of web services protocols
… deadlock and/or violation of a safety property. Verification itself is handled by automatic translation of the model and its properties into a model-checker's input code and interpretation of the output produced by the model-checker. A test-bed is proposed to check the conformance of a protocol …
Page 1 of 2