Skip to main content
SpringerLink
Log in

Static extensivity analysis for λ-definable functions over lattices

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

We employ a static analysis to examine the extensivity (∀x:x≤f(x)) of functions defined over lattices in a λ-calculus augmented with lattice operations. The need for such a verification procedure has arisen in our work on a generator system (called Zoo) of static program-analyzers. The input to Zoo is a static analysis specification that consists of lattice definitions and function definitions over the lattices. Once the extensivity of the functions is ascertained, the generated analyzer is guaranteed to terminate when the lattices have finite-heights. The extensivity analysis consists of a sound syntax-driven deductive rules whose satisfiability check is done by a constraint solving procedure.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aiken, A. and Wimmers, E. L., “Type Inclusion Constraints and Type Inference,” inProc. of Functional Programming Languages and Computer Architecture, pp. 31–41, 1993.

  2. Cousot, P. and Cousot R., “Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints,” inProc. of The ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 238–252, 1977.

  3. Cousot, P. and Cousot R., “Systematic Design of Program Analysis Frame-works,” inProc. of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 269–282, 1979.

  4. Cousot, P. and Cousot R., “Comparing the Galois Connection and Widening/ Narrowing Approaches to Abstract Interpretation,”Technical Report LIX/RR/92/09, Ecole Polytechnique, 1992.

  5. Cousot, P. and Cousot R., “Compositional and Inductive Semantic Definitions in Fixpoint, Equational, Constraint, Closure-condition, Rule-based and Game-theoretic Form,” inProc. of the 7th International Conference on Computer-Aided Verification, LNCS, 939, pp. 293–308, Springer-Verlag, 1995.

  6. Dodis, Y., Goldreich, O., Lehman, E., Raskhodnikova, S., Ron, D. and Samorodnitsky, A., “Improved Testing Algorithms for Monotonicity, Number Report TR99-107,” inElectronic Colloquium on Computational Compleity, June 1999.

  7. Goldreich, O., Goldwasser, S., Lehman, E. and Ron D., “Testing Monotonicity,” inProc. of the 39th Annual Symposium on Foundations of Computer Science, 1998.

  8. Jung, Y., Kim, J., Shin, J. and Yi, K. “AIRAC: Static Analzyer for Automatic Verification of Array Index Ranges in C Programs,” 2005. http://ropas.snu.ac.kr/airac

  9. Le Charlier, B. and Hentenryck, P. Van, “A Universal Top-down Fixpoint Algorithm,”Technical Report TR-CS-92-25, Brown University, Dept. of Computer Science, May, 1992. (also as atechnical report of Institute of Computer Science, University of Namur).

  10. Le Charlier, B. and Hentenryck, P. Van, “Experimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog,”ACM Transactions on Programming Languages and Systems, 16, 1, pp. 35–101, Jan., 1994.

    Article  Google Scholar 

  11. Martin, F., “PAG — An Efficient Program Analyzer Generator,”International Journal on Software Tools for Technology Transfer, 2, 1, pp. 46–67, 1998.

    Article  MATH  Google Scholar 

  12. Murawski, A. and Yi, K., “Static Monotonicity Analysis for Lambdadefinable Functions Over Llattices,” inThe Proceedings of the 3rd International Workshop on Verification, Model Checking and Abstract Interpretation, 2294, LNCS, pp. 139–153, Jan., 2002.

  13. Rutherford, D. E.,Introduction to Lattice Theory, Hafner Publishing Company, New York, 1965.

    MATH  Google Scholar 

  14. Schneeweiss, W. G., “A Necessary and Sufficient Criterion for the Monotonicity of Boolean Functions with Deterministic and Stochastic,”IEEE Transactions on Computers, 45, 11, pp. 1300–1302, Nov., 1996.

    Article  MATH  MathSciNet  Google Scholar 

  15. Voronenko, A., “On the Complexity of the Monotonicity Verification,” inProc. of the 15th Annual IEEE Conference on Computational Complexity, pp. 4–7, July, 2000.

  16. Yi, K.,Program Analysis System Zoo, Research on Program Analysis: National Creative Research Center, KAIST, July, 2001. http://ropas.kaist.ac.kr/zoo/doc/rabbit-e.ps

Download references

Author information

Authors and Affiliations

  1. Division of Computer Science, Korea Advanced Institute of Science and Technology, 373-1 Guseong-dong Yuseong-gu, 305-701, Daejeon, Korea

    Hyunjun EO & Kwang-Moo Choe

  2. School of Computer Science and Engineering, Seoul National University, San 56-1 Sillim-dong Gwanak-gu, 151-742, Seoul, Korea

    Kwangkeun YI

Authors
  1. Hyunjun EO
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kwangkeun YI
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kwang-Moo Choe
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Hyunjun Eo: He is a Ph.D. candidate of Computer Science Dept. at KAIST (Korea Advanced Institute of Science and Technology). He received his B.S. and M.S. in Computer Science from KAIST in 1996 and 1998, respectively. For 1998–2003, he was a research assistant of the National Creative Research Initiative Center for Research On Program Analysis System. His research interest has been on static program analysis, program logics, and higher-order and typed languages. He is currently working on developing a tool for automatic generation of program analyzers.

Kwangkeun Yi, Ph.D.: His research interest has been on semantic-based program analysis and systems application of language technologies. After his Ph.D. from University of Illinois at Urbana-Champaign he joined the Software Principles Research Department at Bell Laboratories, where he worked on various static analysis approaches for higher-order and typed programming languages. For 1995–2003, he was a faculty member in the Department of Computer Science, Korea Advanced Institute of Science and Technology. Since Fall 2003, he has been a faculty member in the School of Computer Science and Engineering, Seoul National University.

Kwang-Moo Choe, Ph.D.: He is a professor of Computer Science at Korea Advanced Institute of Science and Technology. He received his B.S. from Seoul National University in 1976, and his M.S. and Ph.D. from Korea Advanced Institute of Science and Technology in 1978 and 1984, respectively. For 1985–1986, he was a technical staff of AT&T Bell Labs at Murray Hill. His research interest is formal language theory, parallel evaluation of logic programs, and optimizing compilers.

About this article

Cite this article

EO, H., YI, K. & Choe, KM. Static extensivity analysis for λ-definable functions over lattices. New Gener Comput 24, 53–78 (2006). https://doi.org/10.1007/BF03037293

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037293

Keywords

Search

Navigation