4940 search results - page 242 / 988 » On the Complexity of Universal Programs |
178
click to vote
ENTCS
2002
15 years 6 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...
184
click to vote
ICSM
2006
IEEE
16 years 17 days ago
2006
IEEE
Software Engineers frequently need to locate and understand the code that implements a specific user feature of a large system. This paper reports on a study by Motorola Inc. and ...
183
click to vote
IJFCS
2007
15 years 6 months ago
2007
Ranking Abstraction Ittai Balaban Computer Science Department, New York University, 251 Mercer St., New York, New York 10012, United States and Amir Pnueli Computer Science Departm...
165
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis...
142
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...