loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IEEE International Conference on Software-Science, Technology & Engineering
Towards a Standard Family of Languages for Matching Patterns in Source Code
Herzlia, Israel
November 04-November 05
ISBN: 0-7695-2047-2
Uri Dekel, Carnegie Mellon University, Pittsburgh, PA
Tal Cohen, Technion - IIT, Haifa, Israel
Sara Porat, IBM Haifa Research Lab, Haifa, Israel
This paper makes a case for the definition of a family of languages for expressing patterns over both the structure and semantics of source code. Our proposal is unique in that it attempts to provide a unified solution to the problem of searching for patterns in multiple programming languages, and in that it focuses on the semantics of the program rather than on its syntactic structure, all while striving to ensure simplicity and ease-of-use. We present the motivation and the unique difficulties involved in defining such languages, discuss strategies for dealing with these problems, and propose a prototype family of Code Pattern Languages (CPLs).
Citation:
Uri Dekel, Tal Cohen, Sara Porat, "Towards a Standard Family of Languages for Matching Patterns in Source Code," swste, pp.10, IEEE International Conference on Software-Science, Technology & Engineering, 2003
Usage of this product signifies your acceptance of the Terms of Use.