896 search results - page 49 / 180 » On completeness of word reversing |
ICSE
2001
IEEE-ACM
15 years 5 months ago
2001
IEEE-ACM
It has long been accepted that requirements analysis should precede architectural design and implementation, but in software evolution and reverse engineering this concern with bl...
93
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
128
Voted
TCS
1998
15 years 11 days ago
1998
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
131
click to vote
CANPC
1998
Springer
15 years 5 months ago
1998
Springer
In many parallel processing applications, task times have relatively little variability. Accordingly, many nodes will complete a task at approximately the same time. If the applica...
105
Voted
JUCS
2002
15 years 11 days ago
2002
Abstract: In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the inputs of the component tree automata are operational symbols in whic...