Sciweavers

2419 search results - page 257 / 484
» A Formal Approach to Software Testing
Sort
View
CSMR
2004
IEEE
15 years 8 months ago
Source Code Modularization Using Lattice of Concept Slices
Most legacy systems have been altered due to prolonged maintenance to the point that they deviate significantly from their original and intended design and consequently, they lack...
Raihan Al-Ekram, Kostas Kontogiannis
COORDINATION
2009
Springer
15 years 2 months ago
Automata for Context-Dependent Connectors
Abstract. Recent approaches to component-based software engineering employ coordinating connectors to compose components into software systems. For maximum flexibility and reuse, s...
Marcello M. Bonsangue, Dave Clarke, Alexandra Silv...
ENTCS
2002
166views more  ENTCS 2002»
15 years 4 months ago
Translation and Run-Time Validation of Optimized Code
The paper presents approaches to the validation of optimizing compilers. The emphasis is on aggressive and architecture-targeted optimizations which try to obtain the highest perf...
Lenore D. Zuck, Amir Pnueli, Yi Fang, Benjamin Gol...
IWMM
2010
Springer
173views Hardware» more  IWMM 2010»
15 years 9 months ago
CETS: compiler enforced temporal safety for C
Temporal memory safety errors, such as dangling pointer dereferences and double frees, are a prevalent source of software bugs in unmanaged languages such as C. Existing schemes t...
Santosh Nagarakatte, Jianzhou Zhao, Milo M. K. Mar...
COCO
2003
Springer
102views Algorithms» more  COCO 2003»
15 years 9 months ago
Memoization and DPLL: Formula Caching Proof Systems
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...
Paul Beame, Russell Impagliazzo, Toniann Pitassi, ...