Weiss, M.A.: Data Structures and Algorithm Analysis in Java. Addison Wesley Longman (1999) Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Automatic Generation and Checking of Program Specifications - Nimmer (2001) (2 citations) (Correct)
....that the results are effective for the task of verifying absence of runtime errors. This section presents the programs studied and the data analyzed. 4.2.1 Programs and test suites We analyzed the programs listed in Figure 4.1. DisjSets, StackAr, and QueueAr come from a data structures textbook [Wei99] Vector is part of the Java standard library; and the remaining seven programs are solutions to assignments in a programming course at MIT [MIT01] Figure 4.2 shows relative sizes of the test suites and programs used in this experiment. Test suites for the smaller programs were larger in ....
....ESC Java. Most missing invariants were beyond the scope of Daikon. Verification required certain complicated predicates or element type annotations for non List collections, which Daikon does not currently provide. 4.3. 2 StackAr: array based stack StackAr is an array based stack implementation [Wei99] The source contains 50 non comment lines of code in 8 methods, along with comments that describe the behavior of the class but do not mention its representation invariant. It is similar to the example of Chapter 3, but contains more methods. The Daikon invariant detector reported 25 ....
[Article contains additional citation context not shown here]
Mark Allen Weiss. Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, 1999.
Dynamically Discovering Program Invariants Involving.. - Ernst, Griswold.. (2000) (1 citation) (Correct)
....we will pursue the more complicated ones. 5 Assessment To assess our techniques for inferring invariants over programs that use pointer based collections, we analyzed the the quality of Daikon s output for two sets of programs. The first set consists of programs from a data structures textbook [Wei99] Because these programs are small, described in the textbook, and implement well understood data structures, we were able to determine a gold standard of invariants that should be reported by an ideal invariant detector. The second set of programs were written (to a single specification) by ....
.... of their formal specifications, and be class relevant implied irrelevant relevant LinkedList 317 11 1 96 OrderedList 201 5 5 95 StackLi 184 8 1 95 StackAr 159 0 0 100 QueueAr 500 0 0 100 ListNode 46 1 1 95 LinkedListItr 185 8 0 95 Figure 2: Invariants computed over data structures [Wei99] ListNode and LinkedListItr are used internally by the first three data structures. The relevant column lists the number of reported invariants that were relevant. The implied column counts the number of invariants that were implied by other invariants (a simple test could eliminate these ....
[Article contains additional citation context not shown here]
Mark Allen Weiss. Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, 1999. 10
Quickly Detecting Relevant Program Invariants - Ernst, Czeisler, Griswold.. (1999) (26 citations) (Correct)
....types. In particular, fields specific to the annotated type can be accessed and provided to the invariant detector. This technique adds invariants over quantities that would not be accessible otherwise. We assessed this technique on the first five Java programs from a data structures text [Wei99]. The data structures include polymorphic linked lists, stacks and queues (implemented using both linked lists and arrays) and trees. The test cases provided with the programs manipulate sorted collections of MyInteger objects. MyInteger implements the Comparable interface, whereas Java 1.1 s ....
Mark Allen Weiss. Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, 1999.
Quickly Detecting Relevant Program Invariants - Ernst, Griswold, Notkin (1999) (26 citations) (Correct)
....annotated type can be accessed and provided to the inference engine. The effect of this technique is to add to the output of our system invariants over quantities that would not be accessible otherwise. To assess our technique, we ran it on a number of Java programs from a data structures text [Wei99]. The data structures include polymorphic linked lists, trees, and more. The test cases provided with the programs manipulate sorted collections of MyInteger objects. MyInteger implements the Comparable interface, whereas Java 1.1 s Integer does not. The first pass of our system was unable to ....
Mark Allen Weiss. Data structures and algorithm analysis in Java. Addison Wesley Longman, 1999. 10
Dynamically Discovering Pointer-Based Program Invariants - Ernst, Griswold, Kataoka.. (1999) (4 citations) (Correct)
....invariants should be reported, and few relevant invariants should be omitted from the reported invariants. To determine the effectiveness of Daikon in these dimensions, we performed the following steps: 1. We selected the first five data structures presented in a data structures textbook [Wei99] linked lists, ordered lists, stacks represented by lists, stacks represented by arrays, and queues represented by arrays. The text s implementation of these data structures comprises 7 classes. Because the provided test cases are minimal, we augmented them with our own (also very small) cases. ....
Mark Allen Weiss. Data structures and algorithm analysis in Java. Addison Wesley Longman, 1999.
Fast Node Overlap Removal in Graph Layout - Adjustment Tim Dwyer (2005) (Correct)
No context found.
Weiss, M.A.: Data Structures and Algorithm Analysis in Java. Addison Wesley Longman (1999)
Fast Node Overlap Removal - Addendum - Dwyer, Marriott, Stuckey (2006) (Correct)
No context found.
Weiss, M.A.: Data Structures and Algorithm Analysis in Java. Addison Wesley Longman (1999) 9
Fast Node Overlap Removal in Graph Layout Adjustment - Dwyer, Marriott, Stuckey (2005) (Correct)
No context found.
Weiss, M.A.: Data Structures and Algorithm Analysis in Java. Addison Wesley Longman (1999)
Number Theoretic Transform-Based Block Motion Estimation - Toivonen (2002) (Correct)
No context found.
Weiss M. A. (1999) Data Structures and Algorithm Analysis in Java. AddisonWesley, 576 pp.
Selecting, Refining, and Evaluating Predicates for Program.. - Dodoo, Lin, Ernst (2003) (Correct)
No context found.
Mark Allen Weiss. Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, 1999. 12
Invariant Inference for Static Checking: An Empirical Evaluation - Nimmer, Ernst (2002) (1 citation) (Correct)
No context found.
Mark Allen Weiss. Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, 1999.
Static verification of dynamically detected program.. - Nimmer, Ernst (2001) (11 citations) (Correct)
No context found.
Mark Allen Weiss. Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, 1999. 22
Dynamically Discovering Likely Program Invariants - Ernst (2000) (108 citations) (Correct)
No context found.
Mark Allen Weiss. Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, 1999.
Tool-Assisted Unit Test Selection Based on Operational Violations - Xie, Notkin (2003) (5 citations) (Correct)
No context found.
M. A. Weiss, Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, 1999. Proceedings of the 18th IEEE International Conference on Automated Software Engineering (ASE'03)
Selecting Predicates for Implications in Program Analysis - Dodoo, Donovan, Lin, Ernst (2002) (6 citations) (Correct)
No context found.
Mark Allen Weiss. Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, 1999. 11
Improving Generation of Object-Oriented Test Suites by.. - Xie, Marinov, Notkin (2004) (Correct)
No context found.
M. A. Weiss. Data Structures and Algorithm Analysis in Java. Addison Wesley, 1999.
Algorithm Selection for Sorting and Probabilistic Inference: A.. - Guo (2003) (Correct)
No context found.
M. A. Weiss. Data Structures and Algorithms Analysis in JAVA. AddisonWesley, 1999.
Invariant Inference for Static Checking: An Empirical Evaluation - Nimmer, Ernst (2002) (1 citation) (Correct)
No context found.
Mark Allen Weiss. Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, 1999.
Dynamically Discovering Likely Program Invariants - Ernst (2000) (108 citations) (Correct)
No context found.
Mark Allen Weiss. Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, 1999.
Simulating Critical Software Engineering - Evans, Peck (2004) (Correct)
No context found.
Mark Allen Weiss. Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, 1999.
Tool-Assisted Unit Test Selection Based on Operational Violations - Xie, Notkin (2003) (5 citations) (Correct)
No context found.
M. A. Weiss, Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, 1999.
Lecture Note on Data Structures - Kwon (2000) (Correct)
No context found.
Mark Allen Weiss, Data Structures and Algorithm Analysis in Java, Addison-Wesley, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC