TO
Filters: Department: "Kahlert School of Computing" Collection: "ir_uspace" Subject: "Satisfiability"
1 - 25 of 1
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 1 |
 | Gopalakrishnan, Ganesh | psolve: Deciding satisfiability for presburger formulae using automata, rewriting and a model checker | Presburger formulas are an expressive but decidable language of arithmetic expressions and boolaen connectives with quantification. psolve is a prototype of an automata based tool for deciding the satisfiability of Presburger formulae extended with a predicate that recognizes powers of two. The uniq... | psolve; Presburger formulas; Satisfiability; Automata; Rewriting; Model checker | 1999 |
1 - 25 of 1