Abstract
Checking value-sensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in combination with other techniques, a previous method for checking value-insensitive data structures in log space can be extended for checking the more complicated value-sensitive data structures, using log space as well. We present the theoretical model of checking data structures and discuss the types of invasions a checker might bring to the data structure server. We also provide our idea of designing sublinear space checkers for value-sensitive data structures and give a concrete example – a log space checker for the search data structures (SDS).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amato, N.M., Loui, M.C.: Checking linked data structures. In: FTCS-24: 24th International Symposium on Fault Tolerant Computing, Austin, Texas, pp. 164–175. IEEE Computer Society Press, Los Alamitos (1994)
Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proc. of the 2002 ACM Symp. on Principles of Database Systems (PODS 2002) (2002)
Blum, M., Evans, W., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. Algorithmica 12, 225–244 (1994)
Bright, J.D., Sullivan, G.: Checking mergeable priority queues. In: Digest of the 24th Symposium on Fault-Tolerant Computing, 1994, pp. 144–153. IEEE Computer Society Press, Los Alamitos (1994)
Bright, J.D., Sullivan, G.: On-line error monitoring for several data structures. In: Digest of the 25th Symposium on Fault-Tolerant Computing, 1995, pp. 392–401. IEEE Computer Society Press, Los Alamitos (1995)
Bright, J.D., Sullivan, G., Masson, G.M.: Checking the integrity of trees. In: Digest of the 25th Symposium on Fault-Tolerant Computing, 1995, pp. 402–411. IEEE Computer Society Press, Los Alamitos (1995)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT & McGraw-Hill (2001)
Devanbu, P., Stubblebine, S.: Stack and queue integrity on hostile platforms. IEEE Tran. Software Engineering 28(1), 100–108 (2002)
Finkler, U., Mehlhorn, K.: Checking priority queues. In: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, Baltimore, Maryland, pp. 901–902 (1999)
Goodrich, M.T., Tamassia, R.: Data Structures and Algorithms in Java, 2nd edn. Wiley, Chichester (2001)
Kratsch, D., McConnell, R., Mehlhorn, K., Spinrad, J.: Certifying algorithms for recognizing interval graphs. In: SODA 2003, pp. 158–167 (2003)
Mehlhorn, K., Näher, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)
Muthukrishnan, S.: Data streams: algorithms and applications. Technical report, Rutger (2003)
Naor, J., Naor, M.: Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput. 22(4), 838–856 (1993)
Sullivan, G., Wilson, D., Masson, G.: Certification trails for data structures. In: Proceedings of the 21st Annual Symposium on Fault-Tolerant Computing, pp. 240–247 (1991)
Sullivan, G., Wilson, D., Masson, G.M.: Certification of computational results. IEEE Transactions on Computers 44(7), 833–847 (1995)
Wasserman, H., Blum, M.: Software reliability via run-time result-checking. Journal of the ACM 44(6), 826–849 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goodrich, M.T., Sun, J.Z. (2007). Checking Value-Sensitive Data Structures in Sublinear Space. In: Tokuyama, T. (eds) Algorithms and Computation. ISAAC 2007. Lecture Notes in Computer Science, vol 4835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77120-3_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-77120-3_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77118-0
Online ISBN: 978-3-540-77120-3
eBook Packages: Computer ScienceComputer Science (R0)