458 search results - page 18 / 92 » Symbolic Object Code Analysis |
132
click to vote
ISORC
2011
IEEE
14 years 1 months ago
2011
IEEE
—Static cache analysis for data allocated on the heap is practically impossible for standard data caches. We propose a distinct object cache for heap allocated data. The cache is...
102
click to vote
TIT
2010
14 years 4 months ago
2010
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...
ACSC
2003
IEEE
15 years 3 months ago
2003
IEEE
In response to Searle's well-known Chinese room argument against Strong AI (and more generally, computationalism), Harnad proposed that if the symbols manipulated by a robot ...
PPOPP
1999
ACM
15 years 2 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
HYBRID
1994
Springer
15 years 2 months ago
1994
Springer
This paper presents algorithms for the symbolic synthesis of discrete and real-time controllers. At the semantic level the controller is synthesized by nding a winning strategy for...