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 4 of 4 for “"smt solving"”.

  1. Efficient Automated Security Analysis of Complex Authorization Policies

    … based on Satisfiability Modulo Theories (SMT) solving (for expressiveness) and carefully tuned heuristics (for scalability). Particularly, we present the implementation of the techniques on the automated analysis of ARBAC and ATRBAC policies and discuss extensive experiments that show that …

    trento Repository record for Efficient Automated Security Analysis of Complex Authorization Policies (opens in a new tab)

  2. Synthesizing a synthesis tool

    SMT/SAT solvers are used by many tools for program verification and analysis. Most of these tools have an optimization layer which applies transformations (or "rewrite rules") to simplify the internal representation of the problem. These hard coded rules can drastically affect the performance of …

    mit Repository record for Synthesizing a synthesis tool (opens in a new tab)

  3. Neural network based method for solving SMT problems

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

    uiuc Repository record for Neural network based method for solving SMT problems (opens in a new tab)

  4. Symbolic reachability analysis for rewrite theories

    This dissertation presents a significant step forward in automatic and semi-automatic reasoning for reachability properties of rewriting logic specifications, a major research goal in the current state of the art. In particular, this work develops deductive techniques for reasoning symbolically …

    uiuc Repository record for Symbolic reachability analysis for rewrite theories (opens in a new tab)