Sciweavers

4469 search results - page 244 / 894
» Dynamic Program Slicing
Sort
View
IWPC
2010
IEEE
13 years 6 months ago
SVS, BORS, SVSi: Three Strategies to Relate Problem and Program Domains
— Program Comprehension is improved if: i) the Problem and Program Domains can be related, and ii) this relation is shown in a suitable way to the programmer. Currently, there ar...
Mario M. Beron, Maria João Varanda Pereira,...

Publication
226views
15 years 6 months ago
A Gentle Introduction to Multi-stage Programming
Multi-stage programming (MSP) is a paradigm for developing generic software that does not pay a runtime penalty for this generality. This is achieved through concise, carefully-des...
Walid Taha
ATVA
2007
Springer
77views Hardware» more  ATVA 2007»
14 years 2 months ago
Proving Termination of Tree Manipulating Programs
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tom&...
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
14 years 2 months ago
A hybrid evolutionary programming algorithm for spread spectrum radar polyphase codes design
This paper presents a hybrid evolutionary programming algorithm to solve the spread spectrum radar polyphase code design problem. The proposed algorithm uses an Evolutionary Progr...
Ángel M. Pérez-Bellido, Sancho Salce...
ICNS
2006
IEEE
14 years 2 months ago
Building Distributed Access Control System Using Service-Oriented Programming Model
– Service-Oriented Programming Model is a new methodology for building service-oriented applications. In the Service-Oriented Programming Model, an application is assembled from ...
Ivan Zuzak, Sinisa Srbljic, Ivan Benc