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 25 for “"abstract interpretation"”.

  1. Neural abstract interpretation: Leveraging neural networks for automated, efficient and differentiable abstract interpretation

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-09-16 without embargo terms

    uiuc Repository record for Neural abstract interpretation: Leveraging neural networks for automated, efficient and differentiable abstract interpretation (opens in a new tab)

  2. Constraint-Based Thread-Modular Abstract Interpretation

    … a set of novel constraint-based thread-modular abstract-interpretation techniques for static analysis of concurrent programs. Specifically, I integrate a lightweight constraint solver into a thread-modular abstract interpreter to reason about inter-thread interference more accurately. Then, I …

    vt Repository record for Constraint-Based Thread-Modular Abstract Interpretation (opens in a new tab)

  3. AbsInt-AI: Language Models for Abstract Interpretation

    … almost always rely on uniform, hard-coded heap abstractions. While more adaptive abstractions are possible in theory, they are rarely implemented in practice due to their complexity and fragility. This limits their precision and flexibility, especially in dynamic languages like JavaScript, where …

    mit Repository record for AbsInt-AI: Language Models for Abstract Interpretation (opens in a new tab)

  4. TACHYON : customizable program analysis via generic abstract interpretation

    Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.

    mit Repository record for TACHYON : customizable program analysis via generic abstract interpretation (opens in a new tab)

  5. Efficient computation of fixpoints that arise in abstract interpretation

    … dynamic allocation. Program analyses based on abstract interpretation are a promising means of analyzing these difficult constructs. Unfortunately, abstract interpretation often gives rise to complex and expensive fixpoint computations. If it is to become a practical and widely used technique, …

    uiuc Repository record for Efficient computation of fixpoints that arise in abstract interpretation (opens in a new tab)

  6. Efficient resolution of security-sensitive values in Android using abstract interpretation

    … I present a design for an efficient and sound abstract interpretation-based Value Analysis which calculates field values of security-relevant Android API class instances. The analysis is an important component of DroidSafe, an Android malware detection system designed to prove important …

    mit Repository record for Efficient resolution of security-sensitive values in Android using abstract interpretation (opens in a new tab)

  7. Inferring program sequences for texture generation with learned abstractions

    Abstract interpretation of computer programs is an active area of research in program synthesis [11] that involves learning the behavior and characterization of programs given a sequence of inputs/ output examples for the program. One aims to learn as much about a program as possible with very …

    mit Repository record for Inferring program sequences for texture generation with learned abstractions (opens in a new tab)

  8. Categorization and analyzing linked structures

    … property. An analysis, which has the form of an abstract interpretation, is defined and implemented with the program generator Z1. The language analyzed is a low-level intermediate form in which there is no user-level type information. This fact makes the analysis applicable to languages like C …

    uiuc Repository record for Categorization and analyzing linked structures (opens in a new tab)

  9. Subtyping in alloy

    … enclosing formula. Relevance is computed with an abstract interpretation that is relatively insensitive to standard algebraic manipulations. The typechecker for the system is presented in the context of Alloy Analyzer 3.0. Its architecture is explained in terms of key data abstractions, …

    mit Repository record for Subtyping in alloy (opens in a new tab)

  10. The role of the crucial experiment in student modelling

    … which the student must solve, generates an abstract specification of the problems which discriminate between those two hypotheses. Through a process termed 'Abstract Interpretation', PO tips the balance in favour of diagnostic measurement. The key to this problem lies in the realisation that …

    the-open-u Repository record for The role of the crucial experiment in student modelling (opens in a new tab)

  11. Inference Plans for Hybrid Probabilistic Inference

    … inference plan can be implemented, I present an abstract-interpretation-based static analysis for Siren for determining inference plan satisfiability, and prove the analysis is sound with respect to Siren's semantics. In our evaluation, the results show that custom inference plans can produce up …

    mit Repository record for Inference Plans for Hybrid Probabilistic Inference (opens in a new tab)

  12. PDDL.jl: An Extensible Interpreter and Compiler Interface for Fast and Flexible AI Planning

    … to stochastic and continuous domains), domain abstraction for generalized heuristic search (via abstract interpretation), and domain compilation for efficient planning, enabling speed and flexibility for PDDL and its many descendants. Collectively, these features allow PDDL.jl to serve as a …

    mit Repository record for PDDL.jl: An Extensible Interpreter and Compiler Interface for Fast and Flexible AI Planning (opens in a new tab)

  13. Quantifying Information Flow with Constraints

    … bounds on the size of flows, and that classical abstract interpretation provides an effective mechanism for determining such dependencies in the form of linear constraints. Our approach is then to view the problem as one of constrained optimization (maximum entropy), allowing us to apply the …

    city-london Repository record for Quantifying Information Flow with Constraints (opens in a new tab)

  14. Static analysis for detecting and avoiding floating-point run-time errors in logic programs

    … of this thesis is to provide techniques for the abstraction of floating-point expressions into the polyhedra domain as well as into the finite powerset of polyhedra domain. Moreover, this thesis aims at presenting a forward and a backward analysis for the detection and inference of floating-point …

    whiterose Repository record for Static analysis for detecting and avoiding floating-point run-time errors in logic programs (opens in a new tab)

  15. Making Hybrid Systems Easier to Model, Simulate, and Visualize

    … symbolic Gaussian elimination, and abstract interpretation using interval analysis. We give an operational semantics for the specialization process along with a declarative and algorithmic specifications of the binding-time analysis. A type safety theorem is given to show the …

    rice Repository record for Making Hybrid Systems Easier to Model, Simulate, and Visualize (opens in a new tab)

  16. Analysis and Enforcement of Properties in Software Systems

    … analysis. Specifically, I develop a novel abstract interpretation framework that considers both speculative execution and a cache model, and guarantees to be sound for estimating the execution time of a program and detecting side-channel information leaks. The second category is concerned …

    vt Repository record for Analysis and Enforcement of Properties in Software Systems (opens in a new tab)

  17. Optimal certifying algorithms for linear and lattice point feasibility in a system of UTVPI constraints

    … but not limited to program verification, abstract interpretation, and operations research. As per the literature, the fastest known certifying algorithm for checking lattice point feasibility in UTVPI constraint systems ([1]), runs in O( m n + n2 log n) time and O(n2) space, where m …

    wvu Repository record for Optimal certifying algorithms for linear and lattice point feasibility in a system of UTVPI constraints (opens in a new tab)

  18. Static analysis of differentiable programs

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-03-28 without embargo terms

    uiuc Repository record for Static analysis of differentiable programs (opens in a new tab)

  19. Issues in Validation and Executability of Formal Specifications in the Z Notation

    … and the practicality of the rules. Correctness - Abstract Approximation: Published criteria for correctness of an animation are compared and contrasted with the method of Abstract Interpretation (AI). In AI a concrete semantics is related to an approximate one that explicitly exhibits an …

    whiterose Repository record for Issues in Validation and Executability of Formal Specifications in the Z Notation (opens in a new tab)

  20. Enhancing trustworthiness in probabilistic programming: systematic approaches for robust and accurate inference

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-09-16 without embargo terms

    uiuc Repository record for Enhancing trustworthiness in probabilistic programming: systematic approaches for robust and accurate inference (opens in a new tab)

Page 1 of 2