1686 search results - page 25 / 338 » Programs as polygraphs: computability and complexity |
58
Voted
TCS
2010
14 years 8 months ago
2010
We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Wei...
77
Voted
ENTCS
2002
14 years 9 months ago
2002
This paper extends the well-known technique of slicing to synchronous reactive programs. Synchronous languages exemplified by Esterel, Lustre, Signal and Argos, novel model of exe...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
Computational biology research is now faced with the burgeoning number of genome data. The rigorous postprocessing of this data requires an increased role for high performance com...
AADEBUG
1993
Springer
15 years 1 months ago
1993
Springer
Program slicing is a program transformation that is useful in program debugging, program maintenance, and other applications that involve understanding program behavior. Given a p...