949 search results - page 102 / 190 » Lightweight Formal Methods for Computer Algebra Systems |
ICCAD
2003
IEEE
14 years 5 months ago
2003
IEEE
Symbolic image computation is the most fundamental computation in BDD-based sequential system optimization and formal verification. In this paper, we explore the use of over-appr...
SAC
2008
ACM
13 years 8 months ago
2008
ACM
The emergence of the Web has made more and more news items available, however only a small subset of these news items are relevant in a decision making process. Therefore decision...
SPAA
2006
ACM
14 years 2 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
FORTE
2004
13 years 10 months ago
2004
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
SMA
2010
ACM
13 years 9 months ago
2010
ACM
We present an algorithm which robustly computes the intersection curve(s) of an under-constrained piecewise polynomial system consisting of n equations with n + 1 unknowns. The so...