Application of sampling methodologies to network traffic characterization
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
A framework for reducing the cost of instrumented code
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
The grand challenge of Trusted Components
Proceedings of the 25th International Conference on Software Engineering
Bug isolation via remote program sampling
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Low-overhead memory leak detection using adaptive statistical profiling
ASPLOS XI Proceedings of the 11th international conference on Architectural support for programming languages and operating systems
A Component Architecture for High-Performance Scientific Computing
International Journal of High Performance Computing Applications
Proceedings of the 2009 Workshop on Component-Based High Performance Computing
Reducing component contract overhead by offloading enforcement
Proceedings of the 2009 Workshop on Component-Based High Performance Computing
Toward multi-language, multi-component interface contract enforcement
Proceedings of the 2009 Workshop on Component-Based High Performance Computing
Performance-driven interface contract enforcement for scientific components
CBSE'07 Proceedings of the 10th international conference on Component-based software engineering
High-performance language interoperability for scientific computing through Babel
International Journal of High Performance Computing Applications
Hi-index | 0.00 |
We are proposing research on self-adaptive interface assertion enforcement for the purposes of improving scientific software component quality. Demonstrating software correctness through assertions is a well-known technique for quality improvement. However, the performance penalty is often considered too high for deployment. In order to determine if partial enforcement based on adaptive sampling is a viable solution in performance critical environments, we are pursuing research on mechanisms combining static and dynamic analyses to efficiently maximize assertion checking within performance constraints. This paper gives an overview of our initial experiments, current work, and plans.