Sciweavers

309 search results - page 45 / 62
» Termination proofs for systems code
Sort
View
APSEC
2002
IEEE
14 years 1 months ago
Quality Driven Transformation Compositions for Object Oriented Migration
Reengineering legacy software systems to object oriented platforms has received significant attention over the past few years. In this paper, we propose a goal driven software mig...
Ying Zou, Kostas Kontogiannis
ICCS
2003
Springer
14 years 2 months ago
Performance Analysis of a Parallel Application in the GRID
Performance analysis of real applications in clusters and GRID like environments is essential to fully exploit the performance of new architectures. The key problem is the deepenin...
Holger Brunst, Edgar Gabriel, Marc Lange, Matthias...
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
14 years 19 days ago
Algebraic simplification of GP programs during evolution
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
Phillip Wong, Mengjie Zhang
FM
1998
Springer
153views Formal Methods» more  FM 1998»
14 years 1 months ago
VSE: Controlling the Complexity in Formal Software Developments
We give an overview of the enhanced VSE system which is a tool to formally specify and verify systems. It provides means for structuring speci cations and it supports the developme...
Dieter Hutter, Heiko Mantel, Georg Rock, Werner St...
PLDI
2003
ACM
14 years 2 months ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang