Sciweavers

6167 search results - page 78 / 1234
» Can Refinement be Automated
Sort
View
EWC
2008
117views more  EWC 2008»
13 years 11 months ago
Performance of parallel computations with dynamic processor allocation
In parallel adaptive mesh refinement (AMR) computations the problem size can vary significantly during a simulation. The goal here is to explore the performance implications of dyn...
Saeed Iqbal, Graham F. Carey
SIGMOD
2008
ACM
120views Database» more  SIGMOD 2008»
14 years 11 months ago
Muse: a system for understanding and designing mappings
Schema mappings are logical assertions that specify the relationships between a source and a target schema in a declarative way. The specification of such mappings is a fundamenta...
Bogdan Alexe, Laura Chiticariu, Renée J. Mi...
FASE
2004
Springer
14 years 4 months ago
Systematic Testing of Software Architectures in the C2 Style
The topic of software architecture (SA) based testing has recently raised some interest. Recent work on the topic has used the SA as a reference model for code conformance testing,...
Henry Muccini, Marcio S. Dias, Debra J. Richardson
ECOOP
2007
Springer
14 years 3 months ago
Tracking Linear and Affine Resources with Java(X)
Java(X) is a framework for type refinement. It extends Java's type language with annotations drawn from an algebra X and structural subtyping in terms of the annotations. Each...
Markus Degen, Peter Thiemann, Stefan Wehr
CADE
2005
Springer
14 years 11 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard