481 search results - page 72 / 97 » Executing Higher Order Logic |
114
click to vote
SIGARCH
2008
15 years 17 days ago
2008
Conventional programming models were designed to be used by expert programmers for programming for largescale multiprocessors, distributed computational clusters, or specialized p...
113
Voted
LOPSTR
1997
Springer
15 years 4 months ago
1997
Springer
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
CADE
2002
Springer
16 years 29 days ago
2002
Springer
Modularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Michael Abbott, Neil Ghani, and Christoph L?uth Union of Equational Theo...
82
Voted
ICCAD
2008
IEEE
15 years 9 months ago
2008
IEEE
—To overcome the energy-efficiency limitations imposed by finite sub-threshold slope in CMOS transistors, this paper explores the design of integrated circuits based on nanoelect...
86
Voted
KBSE
2007
IEEE
15 years 7 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...