94 search results - page 7 / 19 » Weakest-precondition of unstructured programs |
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
The ability to dynamically adapt an unstructured grid (or mesh) is a powerful tool for solving computational problems with evolving physical features; however, an efficient parall...
PASTE
2005
ACM
14 years 1 months ago
2005
ACM
ACTAC
2002
13 years 7 months ago
2002
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing...
ICDT
1997
ACM
13 years 11 months ago
1997
ACM
We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be mu...
IPPS
1996
IEEE
13 years 11 months ago
1996
IEEE
A concurrent partitioner for partitioning unstructured finite element meshes on distributed memory architectures is developed. The partitioner uses an element-based partitioning st...