861 search results - page 100 / 173 » Symbolic Program Analysis Using Term Rewriting and Generaliz... |
138
click to vote
DAC
2006
ACM
16 years 4 months ago
2006
ACM
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
111
Voted
WWW
2004
ACM
16 years 3 months ago
2004
ACM
This paper presents a search architecture that combines classical search techniques with spread activation techniques applied to a semantic model of a given domain. Given an ontol...
111
click to vote
GLVLSI
2003
IEEE
15 years 8 months ago
2003
IEEE
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
138
click to vote
SAC
2011
ACM
14 years 5 months ago
2011
ACM
Dynamically typed programming languages are powerful tools for rapid software development. However, there are scenarios that would benefit from actual type information being avai...
222
click to vote
UPP
2004
Springer
15 years 8 months ago
2004
Springer
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...