Now showing items 1-3 of 3

    • Bilateral Algorithms for Symbolic Abstraction 

      Reps, Thomas; Elder, Matt; Thakur, Aditya (University of Wisconsin-Madison Department of Computer Sciences, 2012-03-28)
      Given a concrete domain C, a concrete operation tau: C -> C, and an abstract domain A, a fundamental problem in abstract interpretation is to find the best abstract transformer tau#: A -> A that over-approximates tau. ...
    • A Method for Symbolic Computation 

      Reps, Thomas; Thakur, Aditya (2011-12)
      In 1979, Cousot and Cousot gave a specification of the ?best? (most-precise) abstract transformer possible for a given concrete transformer and a given abstract domain. Unfortunately, their specification does not lead to ...
    • A Method for Symbolic Computation of Abstract Operations 

      Thakur, Aditya; Reps, Thomas (2012-02)
      In 1979, Cousot and Cousot gave a specification of the best (most-precise) abstract transformer possible for a given concrete transformer and a given abstract domain. Unfortunately, their specification does not lead to an ...