Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Leslie E. Shader

dblp:38/5062 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1983
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Software testing · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software testing › test input generation
test data selection
0.011983
On the Selection of Test Data for Vector-Valued Recursive Subroutines · SIAM J. Comput. 1983
Software testing
test input generation
0.011983
On the Selection of Test Data for Vector-Valued Recursive Subroutines · SIAM J. Comput. 1983

Methods — techniques the papers use, named apart from their topics

rational function analysis · 0.0linear difference equations · 0.0
YearPublicationVenuePosition
1983 On the Selection of Test Data for Vector-Valued Recursive Subroutines
abstract
This investigation deals with the selection of test data for vector-valued sequences which can be generated by a linear first order system of difference equations with rational coefficients of limited degree. Let $\mathcal{F}(\nu,k,l,m)$ be the class of v-dimensional sequences y which satisfy an equation of the form $P(n)y(n + 1) = A(n)y(n) + R(n)$ where $A,P$, and R are polynomial matrices of degree $ \leqq k,\, l$, and m, respectively, and P is diagonal. It is shown that there is a finite sample which uniquely identifies members of $\mathcal{F}(\nu,k,l,m)$. A finite sample also exists for the case where y is considered to be a function of its initial value. If y satisfies two distinct equations of the above type, then there is a transformation under which certain coordinates must eventually be rational functions, or even polynomials if P is the identity.
John H. Rowland, Leslie E. Shader
SIAM J. Comput.2