Sciweavers

4757 search results - page 490 / 952
» Monads for Functional Programming
Sort
View
AAAI
2008
15 years 9 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...
209
Voted
AADEBUG
2005
Springer
15 years 8 months ago
Random testing of C calling conventions
In a C compiler, function calls are difficult to implement correctly because they must respect a platform-specific calling convention. But they are governed by a simple invariant...
Christian Lindig
ATMOS
2007
114views Optimization» more  ATMOS 2007»
15 years 8 months ago
Fast Approaches to Robust Railway Timetabling
The Train Timetabling Problem (TTP) consists in finding a train schedule on a railway network that satisfies some operational constraints and maximizes a profit function which c...
Matteo Fischetti, Arrigo Zanette, Domenico Salvagn...
174
Voted
APPINF
2003
15 years 8 months ago
Comparing the Optimal Performance of Multiprocessor Architectures
Consider a parallel program with n processes and a synchronization granularity z. Consider also two multiprocessors: a multiprocessor with q processors and run-time reallocation o...
Lars Lundberg, Kamilla Klonowska, Magnus Broberg, ...
ENTCS
2006
113views more  ENTCS 2006»
15 years 6 months ago
Concurrent Java Test Generation as a Search Problem
A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives ...
Yaniv Eytani