Sciweavers

143 search results - page 24 / 29
» Incremental Analysis of real Programming Languages
Sort
View
AMAST
2008
Springer
13 years 10 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...
LCPC
1999
Springer
14 years 27 days ago
An Empirical Study of Function Pointers Using SPEC Benchmarks
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...
Ben-Chung Cheng, Wen-mei W. Hwu
ISSTA
2009
ACM
14 years 3 months ago
HAMPI: a solver for string constraints
Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraint-generation phase followed by a constraint-solving phase. Th...
Adam Kiezun, Vijay Ganesh, Philip J. Guo, Pieter H...
PASTE
2010
ACM
14 years 1 months ago
Opportunities for concurrent dynamic analysis with explicit inter-core communication
Multicore is now the dominant processor trend, and the number of cores is rapidly increasing. The paradigm shift to multicore forces the redesign of the software stack, which incl...
Jungwoo Ha, Stephen P. Crago
UM
2010
Springer
13 years 7 months ago
User Modeling for Telecommunication Applications: Experiences and Practical Implications
Abstract. Telecommunication applications based on user modeling focus on extracting customer behavior and preferences from the information implicitly included in Call Detail Record...
Heath Hohwald, Enrique Frías-Martíne...