Sciweavers

1805 search results - page 3 / 361
» Functional programming with structured graphs
Sort
View
LISP
2008
96views more  LISP 2008»
13 years 5 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
GECCO
2004
Springer
155views Optimization» more  GECCO 2004»
13 years 11 months ago
Genetic Network Programming with Reinforcement Learning and Its Performance Evaluation
A new graph-based evolutionary algorithm named “Genetic Network Programming, GNP” has been proposed. GNP represents its solutions as directed graph structures, which can improv...
Shingo Mabu, Kotaro Hirasawa, Jinglu Hu
JUCS
2006
92views more  JUCS 2006»
13 years 5 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
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
13 years 11 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet
TSE
2010
148views more  TSE 2010»
13 years 4 months ago
Program Behavior Discovery and Verification: A Graph Grammar Approach
—Discovering program behaviors and functionalities can ease program comprehension and verification. Existing program analysis approaches have used text mining algorithms to infer...
Chunying Zhao, Jun Kong, Kang Zhang