2555 search results - page 282 / 511 » Quantifiers and Working Memory |
140
click to vote
TASE
2009
IEEE
15 years 11 months ago
2009
IEEE
—Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to...
144
click to vote
SADFE
2009
IEEE
15 years 11 months ago
2009
IEEE
Increasingly advances in file carving, memory analysis and network forensics requires the ability to identify the underlying type of a file given only a file fragment. Work to dat...
140
Voted
ISVC
2009
Springer
15 years 11 months ago
2009
Springer
In this work we describe a parallel implementation of the Poisson Surface Reconstruction algorithm based on multigrid domain decomposition. We compare implementations using differ...
137
Voted
RR
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we present an embedding of propositional production systems into µ-calculus, and first-order production systems into fixed-point logic, with the aim of using these...
133
click to vote
AINA
2008
IEEE
15 years 11 months ago
2008
IEEE
—This work tries to derive ideas for thread allocation in Chip Multiprocessor (CMP)-based network processors performing general applications by Continuous-Time Markov Chain model...