Sciweavers

772 search results - page 106 / 155
» From Graph Transformation to Software Engineering and Back
Sort
View
AMAST
2008
Springer
15 years 6 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
CSMR
2004
IEEE
15 years 7 months ago
Rewrite Systems for Symbolic Evaluation of C-like Preprocessing
Automatic analysis of programs with preprocessing directives and conditional compilation is challenging. The difficulties range from parsing to program understanding. Symbolic eva...
Mario Latendresse
139
Voted
WWW
2010
ACM
15 years 11 months ago
Live web search experiments for the rest of us
There are significant barriers to academic research into user Web search preferences. Academic researchers are unable to manipulate the results shown by a major search engine to ...
Timothy Jones, David Hawking, Ramesh S. Sankaranar...
DRM
2005
Springer
15 years 9 months ago
Control flow based obfuscation
A software obfuscator is a program O to transform a source program P for protection against malicious reverse engineering. O should be correct (O(P) has same functionality with P)...
Jun Ge, Soma Chaudhuri, Akhilesh Tyagi
ICSE
2010
IEEE-ACM
15 years 8 months ago
Using twinning to adapt programs to alternative APIs
We describe twinning and its applications to adapting programs to alternative APIs. Twinning is a simple technique that allows programmers to specify a class of program changes, i...
Marius Nita, David Notkin