10568 search results - page 1591 / 2114 » Computer Intelligence and Formalization |
218
click to vote
VLSID
2002
IEEE
16 years 7 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
172
click to vote
VLSID
2002
IEEE
16 years 7 months ago
2002
IEEE
Verification is one of the most complex and expensive tasks in the current Systems-on-Chip (SOC) design process. Many existing approaches employ a bottom-up approach to pipeline v...
317
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
304
click to vote
POPL
2007
ACM
16 years 7 months ago
2007
ACM
An asynchronous program is one that contains procedure calls which are not immediately executed from the callsite, but stored and "dispatched" in a non-deterministic ord...
321
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...