4716 search results - page 455 / 944 » Iterative-free program analysis |
197
click to vote
TOOLS
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper presents a method and a tool for building trustable OO components. The methodology is based on an integrated design and test approach for OO software components. It is ...
199
click to vote
PPOPP
1999
ACM
15 years 11 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...
200
click to vote
APLAS
2006
ACM
15 years 10 months ago
2006
ACM
Abstract. Static analyses calculate abstract states, and their logics validate properties of the abstract states. We place into perspective the variety of forwards, backwards, func...
189
click to vote
PLDI
2005
ACM
16 years 12 days ago
2005
ACM
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
318
click to vote
POPL
2005
ACM
16 years 7 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...