4401 search results - page 165 / 881 » Computing with Default Logic |
133
Voted
TCS
2011
14 years 9 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
105
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
140
click to vote
FCCM
2000
IEEE
15 years 7 months ago
2000
IEEE
Custom computing systems exhibit significant speedups over traditional microprocessors by mapping compute-intensive sections of a program to reconfigurable logic [Hauck98]. Howeve...
116
click to vote
ICFP
2000
ACM
15 years 7 months ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
FPL
2008
Springer
15 years 4 months ago
2008
Springer
This paper presents a fast and scalable method of computing signal toggle rate in FPGA-based circuits. Our technique is a vectorless estimation technique, which can be used in a C...