174 search results - page 19 / 35 » Traces of Term-Automatic Graphs |
ENTCS
2008
14 years 11 months ago
2008
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
98
Voted
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
OOPSLA
1991
Springer
15 years 3 months ago
1991
Springer
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, a...
129
click to vote
SCAM
2002
IEEE
15 years 4 months ago
2002
IEEE
Dynamic program slicing is an effective technique for narrowing the errors to the relevant parts of a program when debugging. Given a slicing criterion, the dynamic slice contains...
116
click to vote
APAQS
2001
IEEE
15 years 3 months ago
2001
IEEE
Code-patterns are statically recurring structure specific to a programming language. It can be parallel to aid in designing software systems for solving particular problems. Contr...