Sciweavers

3889 search results - page 114 / 778
» The Use of Program Dependence Graphs in Software Engineering
Sort
View
148
Voted
FSTTCS
2008
Springer
15 years 4 months ago
STCON in Directed Unique-Path Graphs
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
Sampath Kannan, Sanjeev Khanna, Sudeepa Roy
139
Voted
SEW
2003
IEEE
15 years 9 months ago
Applying Run-Time Monitoring to the Deep-Impact Fault Protection Engine
Run-time monitoring is a lightweight verification method whereby the correctness of a programs’ execution is verified at run-time using executable specifications. This paper des...
Doron Drusinsky, Garth Watney
CCS
2009
ACM
15 years 10 months ago
Behavior based software theft detection
Along with the burst of open source projects, software theft (or plagiarism) has become a very serious threat to the healthiness of software industry. Software birthmark, which re...
Xinran Wang, Yoon-chan Jhi, Sencun Zhu, Peng Liu
105
Voted
ICSE
2001
IEEE-ACM
15 years 8 months ago
Architecture-Oriented Programming Using FRED
Implementing application-specific code conforming to architectural rules and conventions can be tedious. FRED is a tool prototype for architecture-oriented programming that takes ...
Markku Hakala, Juha Hautamäki, Kai Koskimies,...
122
Voted
MSR
2006
ACM
15 years 9 months ago
Are refactorings less error-prone than other changes?
Refactorings are program transformations which should preserve the program behavior. Consequently, we expect that during phases when there are mostly refactorings in the change hi...
Peter Weißgerber, Stephan Diehl