Harald Ruess

age ~60

from Palo Alto, CA

Harald Ruess Phones & Addresses

  • 3901 Middlefield Rd, Palo Alto, CA 94303 • 6502519859
  • East Palo Alto, CA
  • 1943 Euclid Ave, Menlo Park, CA 94025 • 6503257574
  • Woodside, CA

Us Patents

  • Method For Combining Decision Procedures With Satisfiability Solvers

    view source
  • US Patent:
    20040019468, Jan 29, 2004
  • Filed:
    May 8, 2003
  • Appl. No.:
    10/431780
  • Inventors:
    Leonardo De Moura - Fremont CA, US
    Harald Ruess - Palo Alto CA, US
  • Assignee:
    SRI INTERNATIONAL - menlo Park CA
  • International Classification:
    G06F017/10
  • US Classification:
    703/002000
  • Abstract:
    The invention provides bounded model checking of a program with respect to a property of interest comprising unfolding the program for a number of steps to create a program formula; translating the property of interest into an automaton; encoding the transition system of the automaton into a Boolean formula creating a transition formula; conjoining the program formula with the transition formula to create a conjoined formula; and deciding the satisfiability of the conjoined formula.
  • Method For Combining Decision Procedures

    view source
  • US Patent:
    20040049474, Mar 11, 2004
  • Filed:
    May 28, 2003
  • Appl. No.:
    10/447759
  • Inventors:
    Natarajan Shankar - Los Altos CA, US
    Harald Ruess - Palo Alto CA, US
  • Assignee:
    SRI INTERNATIONAL - Menlo Park CA
  • International Classification:
    G06N005/02
    G06F017/00
    G06N005/00
  • US Classification:
    706/046000, 706/045000
  • Abstract:
    The method provides a sound and complete online decision method for the combination of canonizable and solvable theories together with uninterpreted function and predicate symbols. It also provides the representation of a solution state in terms of theory-wise solution sets that are used to capture the equality information extracted from the processed equalities. The method includes a context-sensitive canonizer that uses theory-specific canonizers and the solution state to obtain the canonical form of an expression with respect to the given equality information. Moreover, included is the variable abstraction operation for reducing and equality between term to an equality between variables and an enhanced solution state. The closure operation for propagating equality information between solution sets for individual theories uses the theory-specific solvers. The invention teaches a modular method for combining solvers and canonizers into a combination decision procedure. Furthermore, the modular method is useful for integrating Shostak-style decision procedures within a Nelson-Oppen combination so that equality information can be exchanged between theories that are canonizable and solvable, and those that are not. The invention provides a method for deciding a formula with respect to a state comprising: canonizing the formula to create a canonical formula; abstracting the variables in the canonical formula and the state to create an abstracted formula and an abstracted state; asserting the abstracted formula into the abstracted state to create an asserted state; and closing the asserted state.

Get Report for Harald Ruess from Palo Alto, CA, age ~60
Control profile