861 search results - page 4 / 173 » Symbolic Program Analysis Using Term Rewriting and Generaliz... |
GLVLSI
2002
IEEE
14 years 11 days ago
2002
IEEE
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are suitable for automatic hardware verification of Register Transfer Level (RTL) ...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The study of common, complex multifactorial diseases in genetic epidemiology is complicated by nonlinearity in the genotype-to-phenotype mapping relationship that is due, in part,...
ENTCS
2007
13 years 7 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
JGO
2010
13 years 2 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...