메뉴 건너뛰기




Volumn , Issue , 1994, Pages 382-392

Program result-checking: A theory of testing meets a test of theory

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM DEBUGGING; RANDOM PROCESSES; REAL TIME SYSTEMS; SOFTWARE TESTING;

EID: 33745992295     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1994.365678     Document Type: Conference Paper
Times cited : (21)

References (43)
  • 2
    • 0027206124 scopus 로고
    • Checking approximate computations over the reals
    • Extends checking methodologies to computations on limited-accuracy real numbers. Examples: matrix multiplication, inversion, and determinant; solving systems of linear equations
    • S. Ar, M. Blum, B. Codenotti, and P. Gemmell, "Checking approximate computations over the reals," Proc. 25th ACM STOC, pp. 786-795, 1993. Extends checking methodologies to computations on limited-accuracy real numbers. Examples: matrix multiplication, inversion, and determinant; solving systems of linear equations.
    • (1993) Proc. 25th ACM STOC , pp. 786-795
    • Ar, S.1    Blum, M.2    Codenotti, B.3    Gemmell, P.4
  • 3
    • 84968014854 scopus 로고
    • Probabilistic checking of proofs; a new characterization of NP
    • Equates NP languages with those in interactive-proof class PCPlogn, logn
    • S. Arora and S. Safra, "Probabilistic checking of proofs; a new characterization of NP," Proc. 33rd IEEE FOCS, pp. 2-13, 1992. Equates NP languages with those in interactive-proof class PCP(logn, logn).
    • (1992) Proc. 33rd IEEE FOCS , pp. 2-13
    • Arora, S.1    Safra, S.2
  • 4
    • 0002771903 scopus 로고
    • Non-deterministic exponential time has two-prover interactive protocols
    • Proves that NEXP = 2IP, and hence that NEXP-complete problems have complex checkers
    • L. Babai, L. Fortnow, and C. Lund, "Non-deterministic exponential time has two-prover interactive protocols," Computational Complexity, Vol. 1, pp. 3-40, 1991. Proves that NEXP = 2IP, and hence that NEXP-complete problems have complex checkers.
    • (1991) Computational Complexity , vol.1 , pp. 3-40
    • Babai, L.1    Fortnow, L.2    Lund, C.3
  • 5
    • 0002234652 scopus 로고
    • Arithmetization: A new method in structural complexity theory
    • L. Babai and L. Fortnow, "Arithmetization: a new method in structural complexity theory," Computational Complexity, Vol. 1, pp. 41-46, 1991.
    • (1991) Computational Complexity , vol.1 , pp. 41-46
    • Babai, L.1    Fortnow, L.2
  • 6
    • 85117105572 scopus 로고
    • Preliminary version: A characterization of #P by arithmetic straight line programs
    • Further develops a technique from 4 of translating Boolean formulae into multivariate polynomials
    • Preliminary version: "A characterization of #P by arithmetic straight line programs," Proc. 31st IEEE FOCS, pp. 26-34, 1990. Further develops a technique from [4] of translating Boolean formulae into multivariate polynomials.
    • (1990) Proc. 31st IEEE FOCS , pp. 26-34
  • 7
    • 85028539051 scopus 로고
    • Checking computations in polylogarithmic time
    • A variant of 4 with lower time-bounds, this paper introduces an unusual sort of very fast checker for NP computations. Such checkers could be regarded as hardware checkers," in that they ensure that the hardware follows instructions correctly, but don't ensure that the software is correct
    • L. Babai, L. Fortnow, L. Levin, and M. Szegedy, "Checking computations in polylogarithmic time," Proc. 23rd ACM STOC, pp. 21-31, 1991. A variant of [4] with lower time-bounds, this paper introduces an unusual sort of very fast checker for NP computations. Such checkers could be regarded as "hardware checkers," in that they ensure that the hardware follows instructions correctly, but don't ensure that the software is correct.
    • (1991) Proc. 23rd ACM STOC , pp. 21-31
    • Babai, L.1    Fortnow, L.2    Levin, L.3    Szegedy, M.4
  • 10
    • 0003228498 scopus 로고
    • On being incoherent without being very hard
    • Response to questions of 13, 41, including a proof that all NP-complete languages are coherent
    • R. Beigel and J. Feigenbaum, "On being incoherent without being very hard," Computational Complexity, Vol. 2, pp. 1-17, 1992. Response to questions of [13, 41], including a proof that all NP-complete languages are coherent.
    • (1992) Computational Complexity , vol.2 , pp. 1-17
    • Beigel, R.1    Feigenbaum, J.2
  • 12
    • 85117158556 scopus 로고    scopus 로고
    • Avrim Blum, personal communication
    • Avrim Blum, personal communication.
  • 13
    • 5244241001 scopus 로고
    • Designing programs to check their work
    • Introduces result-checking
    • M. Blum, "Designing programs to check their work," ICSI Technical Report TR-88-009, 1988. Introduces result-checking.
    • (1988) ICSI Technical Report TR-88-009
    • Blum, M.1
  • 14
    • 0024867752 scopus 로고
    • Designing programs that check their work
    • M. Blum and S. Kannan, "Designing programs that check their work," Proc. 21st ACM STOC, pp. 86-97, 1989.
    • (1989) Proc. 21st ACM STOC , pp. 86-97
    • Blum, M.1    Kannan, S.2
  • 15
    • 0000619172 scopus 로고
    • Self-testing/correcting with applications to numerical problems
    • M. Blum, M. Luby, and R. Rubinfeld, "Self-testing/correcting with applications to numerical problems," Journal of Computer & System Sciences, Vol. 47, pp. 549-95,1993.
    • (1993) Journal of Computer & System Sciences , vol.47 , pp. 549-595
    • Blum, M.1    Luby, M.2    Rubinfeld, R.3
  • 16
    • 23844554379 scopus 로고
    • Preliminary version
    • Introduces self-testers and self-correctors
    • Preliminary version: Proc. 22nd ACM STOC, pp. 73-83, 1990. Introduces self-testers and self-correctors.
    • (1990) Proc. 22nd ACM STOC , pp. 73-83
  • 17
    • 0028482823 scopus 로고
    • Checking the correctness of memories
    • Demonstrates that, given a small, secure data base, one may check the correctness of a large, adversarial data base
    • M. Blum, W. Evans, P. Gemmell, S. Kannan, and M. Naor, "Checking the correctness of memories," Algorithmica, Vol. 12, pp. 225-244, 1994. Demonstrates that, given a small, secure data base, one may check the correctness of a large, adversarial data base.
    • (1994) Algorithmica , vol.12 , pp. 225-244
    • Blum, M.1    Evans, W.2    Gemmell, P.3    Kannan, S.4    Naor, M.5
  • 18
    • 33745992295 scopus 로고    scopus 로고
    • Program result-checking: A theory of testing meets a test of theory
    • Suggests modifications to standard checking definitions for greater utility in real-time, real-number computer systems; in particular, suggests that run-time checks be allowed to repeatedly use stored random bits. With this modification, specifies a simple checker and a fast self-corrector for any linear transformation
    • M. Blum and H. Wasserman, "Program result-checking: a theory of testing meets a test of theory," Proc. 35th IEEE FOCS, 1994. Advocates the use of result-checking as a software-debugging tool. Suggests modifications to standard checking definitions for greater utility in real-time, real-number computer systems; in particular, suggests that run-time checks be allowed to repeatedly use stored random bits. With this modification, specifies a simple checker and a fast self-corrector for any linear transformation.
    • Proc. 35th IEEE FOCS, 1994. Advocates the Use of Result-Checking as a Software-Debugging Tool
    • Blum, M.1    Wasserman, H.2
  • 19
    • 0027306938 scopus 로고
    • The infeasibility of quantifying the reliability of life-critical real-time software
    • Proves inherent limitations of conventional software testing and of the attempt to assure reliability by running several versions of a program
    • R. Butler and G. Finelli, "The infeasibility of quantifying the reliability of life-critical real-time software," IEEE Transactions on Software Engineering, Vol. 19, pp. 3-12, 1993. Proves inherent limitations of conventional software testing and of the attempt to assure reliability by running several versions of a program.
    • (1993) IEEE Transactions on Software Engineering , vol.19 , pp. 3-12
    • Butler, R.1    Finelli, G.2
  • 20
    • 0342959327 scopus 로고
    • A note on self-testing/correcting methods for trigonometric functions
    • R. Cleve and M. Luby, "A note on self-testing/correcting methods for trigonometric functions," ICSI Technical Report 90-032, 1990.
    • (1990) ICSI Technical Report 90-032
    • Cleve, R.1    Luby, M.2
  • 21
    • 85117131601 scopus 로고
    • manuscript, Department of Computer Science, Cornell University, Specifies self-testers for functions including the Fourier Transform
    • Funda Ergün, "Testing multivariate linear functions: overcoming the generator bottleneck," manuscript, Department of Computer Science, Cornell University, 1994. Specifies self-testers for functions including the Fourier Transform.
    • (1994) Testing Multivariate Linear Functions: Overcoming the Generator Bottleneck
    • Ergün, F.1
  • 22
    • 0024057387 scopus 로고
    • Are there interactive protocols for co-NP languages?
    • Suggests that co-NP may not be contained in IP. 36 later proved the contrary
    • L. Fortnow and M. Sipser, "Are there interactive protocols for co-NP languages?" Information Processing Letters, Vol. 28, pp. 249-251, 1988. Suggests that co-NP may not be contained in IP. [36] later proved the contrary.
    • (1988) Information Processing Letters , vol.28 , pp. 249-251
    • Fortnow, L.1    Sipser, M.2
  • 24
    • 0001975984 scopus 로고
    • Self-testing/correcting for polynomials and for approximate functions
    • Commences the extension of traditional checking methodologies to computations on limited-accuracy reals
    • P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson, "Self-testing/correcting for polynomials and for approximate functions," Proc. 23rd ACM STOC, pp. 32-42, 1991. Commences the extension of traditional checking methodologies to computations on limited-accuracy reals.
    • (1991) Proc. 23rd ACM STOC , pp. 32-42
    • Gemmell, P.1    Lipton, R.2    Rubinfeld, R.3    Sudan, M.4    Wigderson, A.5
  • 25
    • 0000377057 scopus 로고
    • Highly resilient correctors for polynomials
    • Gives near-optimal self-correctors for programs supposed to compute multivariate polynomials. As long as a program is correct on a 1/2+δfraction of inputs (for δ∈ R+), self-correcting is possible
    • +), self-correcting is possible.
    • (1992) Information Processing Letters , vol.43 , pp. 169-174
    • Gemmell, P.1    Sudan, M.2
  • 26
    • 1542665168 scopus 로고
    • Ph.D. thesis, Department of Computer Science, University of California, Berkeley, Includes checkers for several hard group-theoretic problems
    • S. Kannan, Program Result-Checking with Applications, Ph.D. thesis, Department of Computer Science, University of California, Berkeley, 1990. Includes checkers for several hard group-theoretic problems.
    • (1990) Program Result-Checking with Applications
    • Kannan, S.1
  • 28
    • 0003013846 scopus 로고
    • New directions in testing, distributed computing and cryptography
    • Proves that #-complete problems have checker/correctors
    • R. Lipton, "New directions in testing, distributed computing and cryptography," DIM ACS Series on Discrete Mathematics and Theoretical Computer Science, Vol. 2, pp. 191-202, 1991. Proves that #P-complete problems have checker/correctors.
    • (1991) DIM ACS Series on Discrete Mathematics and Theoretical Computer Science , vol.2 , pp. 191-202
    • Lipton, R.1
  • 30
    • 85117079200 scopus 로고
    • Computer science proofs and error-detecting computation
    • MIT Lab for Computer Science Technical Report TM-510, Gives result-checkers for NP-complete problems, subject to the assumptions that we have available a random oracle which can serve as a cryptographically-secure hash-function, and that the program being checked has insufficient time to find collisions in this hash-function
    • S. Micali, "Computer science proofs and error-detecting computation," MIT Lab for Computer Science Technical Report, 1992, and "Computer science proofs," MIT Lab for Computer Science Technical Report TM-510, 1994. Gives result-checkers for NP-complete problems, subject to the assumptions that we have available a random oracle which can serve as a cryptographically-secure hash-function, and that the program being checked has insufficient time to find collisions in this hash-function.
    • (1994) MIT Lab for Computer Science Technical Report, 1992, and "Computer Science Proofs
    • Micali, S.1
  • 31
    • 85117076904 scopus 로고
    • Co-SAT has multi-prover interactive proofs
    • e-mail message, 4
    • N. Nisan, "Co-SAT has multi-prover interactive proofs," e-mail message, 1989. Initiated events leading to [36, 4].
    • (1989) Initiated Events Leading to , vol.36
    • Nisan, N.1
  • 32
    • 0012785603 scopus 로고
    • Ph.D. thesis, Department of Computer Science, University of California, Berkeley, Incorporates efficient random testing into the run-time checking/correcting process
    • R. Rubinfeld, A Mathematical Theory of Self-Checking, Self-Testing, and Self-Correcting Programs, Ph.D. thesis, Department of Computer Science, University of California, Berkeley, 1990. Incorporates efficient random testing into the run-time checking/correcting process.
    • (1990) A Mathematical Theory of Self-Checking, Self-Testing, and Self-Correcting Programs
    • Rubinfeld, R.1
  • 33
    • 0026869838 scopus 로고
    • Batch checking with applications to linear functions
    • R. Rubinfeld, "Batch checking with applications to linear functions," Information Processing Letters, Vol. 42, pp. 77-80, 1992.
    • (1992) Information Processing Letters , vol.42 , pp. 77-80
    • Rubinfeld, R.1
  • 34
    • 85029508009 scopus 로고
    • Self-testing polynomial functions efficiently and over rational domains
    • Extends checking methodologies from finite fields to integer and rational domains
    • R. Rubinfeld and M. Sudan, "Self-testing polynomial functions efficiently and over rational domains," Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms, pp. 23-32, 1992. Extends checking methodologies from finite fields to integer and rational domains.
    • (1992) Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms , pp. 23-32
    • Rubinfeld, R.1    Sudan, M.2
  • 37
    • 84976779342 scopus 로고
    • Fast probabilistic algorithms for verification of polynomial identities
    • A fundamental result: to determine (with high probability) whether two polynomials are identical, it generally suffices to check their equality at a random location. Applications include: testing multiset equality; proving that two straight-line arithmetic programs compute the same function
    • J. Schwartz, "Fast probabilistic algorithms for verification of polynomial identities," Journal of the ACM, Vol. 27, pp. 701-717, 1980. A fundamental result: to determine (with high probability) whether two polynomials are identical, it generally suffices to check their equality at a random location. Applications include: testing multiset equality; proving that two straight-line arithmetic programs compute the same function.
    • (1980) Journal of the ACM , vol.27 , pp. 701-717
    • Schwartz, J.1
  • 38
    • 0002750721 scopus 로고
    • IP = pspace
    • It follows from this result that all PSPACE-complete problems have complex checkers
    • A. Shamir, "IP = PSPACE," Proc. 31st IEEE FOCS, pp. 11-15, 1990. It follows from this result that all PSPACE-complete problems have complex checkers.
    • (1990) Proc. 31st IEEE FOCS , pp. 11-15
    • Shamir, A.1
  • 40
    • 0008962903 scopus 로고
    • Ph.D. thesis, EECS Department, Boston University, Uses the theory of algebraic and transcendental fields to design partial complex checkers for rational functions constructed from x, ex, sin(ax + b), and cos(ax + 6) using operators + x/and fractional exponentiation
    • x, sin(ax + b), and cos(ax + 6) using operators + - x/and fractional exponentiation.
    • (1993) Algebraic Methods in Hardware/Software Testing
    • Vainstein, F.1
  • 41
    • 49249151236 scopus 로고
    • The complexity of computing the permanent
    • Defines #-completeness and proves that computing the permanent of a matrix is #-complete. Also 26
    • L. Valiant, "The complexity of computing the permanent," Theoretical Computer Science, Vol. 8, pp. 189-201, 1979. Defines #P-completeness and proves that computing the permanent of a matrix is #P-complete. Also see [26].
    • (1979) Theoretical Computer Science , vol.8 , pp. 189-201
    • Valiant, L.1
  • 42
    • 0019572642 scopus 로고
    • New hash functions and their use in authentication and set equality
    • Includes an idea for a simple check of multiset equality completed in 12
    • M. Wegman and J. Carter, "New hash functions and their use in authentication and set equality," Journal of Computer & System Sciences, Vol. 22, pp. 265-279, 1981. Includes an idea for a simple check of multiset equality (completed in [12]).
    • (1981) Journal of Computer & System Sciences , vol.22 , pp. 265-279
    • Wegman, M.1    Carter, J.2
  • 43
    • 0024984430 scopus 로고
    • Coherent functions and program checkers
    • Function f is coherent iff on input (x, y) one can determine whether or not f(x) = y via a BPP; algorithm which is not allowed to query f at x. Author proves the existence of incoherent (and thus uncheckable) functions in EXP. also 9
    • ; algorithm which is not allowed to query f at x. Author proves the existence of incoherent (and thus uncheckable) functions in EXP. See also [9].
    • (1990) Proc. 22nd ACM STOC , pp. 84-94
    • Yao, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.