462 search results - page 14 / 93 » Symbolic Bounded Synthesis |
135
click to vote
FMCAD
2004
Springer
15 years 7 months ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
123
click to vote
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
112
click to vote
SC
1994
ACM
15 years 5 months ago
1994
ACM
Most current data dependence tests cannot handle loop bounds or array subscripts that are symbolic, nonlinear expressions e.g. Ani+j, where 0 j n. In this paper, we describe a d...
89
Voted
ASPDAC
2007
ACM
15 years 5 months ago
2007
ACM
While the covering algorithm has been perfected recently by the iterative approaches, such as DAOmap and IMap, its application has been limited to technology mapping. The main fact...
ASPDAC
2010
ACM
14 years 12 months ago
2010
ACM
Abstract-- Optimizing blocks in a System-on-Chip (SoC) circuit is becoming more and more important nowadays due to the use of third-party Intellectual Properties (IPs) and reused d...