Sciweavers

3889 search results - page 722 / 778
» The Use of Program Dependence Graphs in Software Engineering
Sort
View
CGO
2008
IEEE
15 years 10 months ago
Prediction and trace compression of data access addresses through nested loop recognition
This paper describes an algorithm that takes a trace (i.e., a sequence of numbers or vectors of numbers) as input, and from that produces a sequence of loop nests that, when run, ...
Alain Ketterlin, Philippe Clauss
128
Voted
VMCAI
2004
Springer
15 years 8 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
PASTE
2010
ACM
15 years 5 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
JUCS
2008
162views more  JUCS 2008»
15 years 3 months ago
Composition and Run-time Adaptation of Mismatching Behavioural Interfaces
Abstract: Reuse of software entities such as components or Web services raise composition issues since, most of the time, they present mismatches in their interfaces. These mismatc...
Javier Cámara, Gwen Salaün, Carlos Can...
ICST
2011
IEEE
14 years 7 months ago
EFindBugs: Effective Error Ranking for FindBugs
—Static analysis tools have been widely used to detect potential defects without executing programs. It helps programmers raise the awareness about subtle correctness issues in t...
Haihao Shen, Jianhong Fang, Jianjun Zhao