Access driven filtering

Data processing: software development – installation – and managem – Software program development tool – Testing or debugging

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07444622

ABSTRACT:
A test domain configuration module generates graphical user interfaces for identifying information about desired tests such as data types and domain configurations, and collects information used by other modules to generate tests. The identified information may include, for example, an abstract syntax, a static semantic, max counts on instances of data types, or costs of field accesses or data types for max path costs or max expression costs. A test input generator, generates test input for the identified and configured data types. In one case, the generated test inputs are generated as tree data structures. A predicate determines whether a generated test input follows semantic conditions. A test input evaluator counts instances of data types in, sums paths through, or sums total costs of, the generated test inputs. A test acceptance module saves test inputs acceptable to the predicate and the test input evaluator.

REFERENCES:
patent: 5771474 (1998-06-01), Matt et al.
patent: 5781720 (1998-07-01), Parker et al.
patent: 6083276 (2000-07-01), Davidson et al.
patent: 6539503 (2003-03-01), Walker
patent: 6697751 (2004-02-01), Skingsley et al.
patent: 7017148 (2006-03-01), Kumar et al.
patent: 2003/0126136 (2003-07-01), Omoigui
patent: 2005/0050519 (2005-03-01), Schulte et al.
patent: 2005/0114771 (2005-05-01), Piehler et al.
patent: 2005/0120276 (2005-06-01), Kolawa et al.
patent: 2006/0179383 (2006-08-01), Blass et al.
Börger et al., “A Mathematical Definition of Full Prolog,” In Science of Computer Programming, vol. 24, 35 pages, 1994.
Börger et al., “Correctness of compiling Occam to Transputer code,” Computer Journal, vol. 36, No. 5, 43 pages, 1993.
Gaul et al., “Practical Construction of Correct Compiler Implementations by Runtime Result Verification,” In Proceedings of SCI'2000, International Conference on Information Systems Analysis and Synthesis, 6 pages, 2000.
Goodenough, “Ada Compiler Validation: An Example of Software Testing Theory and Practice,” In A.N. Haberman and U. Montinari, editors, System Development and Ada, vol. 275 of Lecture Notes in Computer Science, pp. 195-232, Springer-Verlag, 1986.
Gurevich, “Evolving Algebras 1993: Lipari Guide,” In Egon Boerger, editor, Specification and Validation Methods, Oxford Press, 26 pages, 1995.
Hunter, et al., “Combining RDF and XML Schemas to Enhance Interoperability Between Metadata Application Profiles,” ACM 1-58113-348, pp. 457-466, 2001.
Kahan et al., “Annotea: An Open RDF Infrastructure for Shared Web Annotations,” ACM 1-58113-348, pp. 623-632, 2001.
Le Métayer et al., “Verification by Testing for Recursive Program Schemes,” In LOPSTR'99 (International Workshop on Logic Program Synthesis and Transformation), Lecture Notes in Computer Science, 18 pages, Springer, 1999.
Muchnick, “Advanced Compiler Design and Implementation,” Morgan Kaufmann, San Francisco, 2000.
Pnueli et al., “The Code Validation Tool (CVT),” Software Tools for Technology, 10 pages, 1999.
“TinyLanguage, a Tutorial on generating test cases using Access Driven Filtering (ADF),” white paper, 19 pages, undated.
Wasserman et al., “Software Reliability via Run-Time Result-Checking,” Journal of the ACM, 44(6):826-849, 24 pages, 1997.
Wolfgang Grieskamp, Yuri Gurevich, Wolfram Schulte and Margus Veanes; “Generating Finite State Machines from Abstract State Machines”; © 2002 ACM; pp. 112-122.
Chandrasekhar Boyapati, Surfraz Khurshid, and Darko Marinov; “Korat: Automated Testing Based on Java Predicates”; International Symposium on Software Testing and Analysis, Rome, Italy, Jul. 23, 2002; 14 pages.
Darko Marinov and Sarfraz Khurshid; “TestEra: A Novel Framework for Automated Testing of Java Programs”; 16thIEEE Conference on Automated Software Engineering (ASE 2001), San Diego, CA; pp. 22-31.
Kim et al., “Design and Implementation of Home Network Systems Using UPnP Middleware for Networked Applicances,” IEEE Transactions on Consumer Electronics. vol. 48, Issue 4, Nov. 2002, pp. 963-972.
UPnP Implementers Corporation, “UPnP Device Certification Process Document,” Version 1.0, 2001, 31 pages.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Access driven filtering does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Access driven filtering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Access driven filtering will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3990710

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.