Sciweavers

155 search results - page 14 / 31
» Analysis of Imperative XML Programs
Sort
View
JUCS
2006
92views more  JUCS 2006»
14 years 9 months ago
Program Slicing by Calculation
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
Nuno F. Rodrigues, Luís Soares Barbosa
WETICE
1999
IEEE
15 years 1 months ago
Static Analysis of Binary Code to Isolate Malicious Behaviors
In this paper, we address the problem of static slicing on binary executables for the purposes of the malicious code detection in COTS components. By operating directly on binary ...
J. Bergeron, Mourad Debbabi, M. M. Erhioui, B&eacu...
PEPM
1993
ACM
15 years 1 months ago
Binding-Time Analysis and the Taming of C Pointers
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
Lars Ole Andersen
APLAS
2006
ACM
15 years 3 months ago
XML Validation for Context-Free Grammars
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
Yasuhiko Minamide, Akihiko Tozawa
SIGARCH
2008
152views more  SIGARCH 2008»
14 years 9 months ago
OpenDF: a dataflow toolset for reconfigurable hardware and multicore systems
This paper presents the OpenDF framework and recalls that dataflow programming was once invented to address the problem of parallel computing. We discuss the problems with an impe...
Shuvra S. Bhattacharyya, Gordon J. Brebner, Jö...