Static Monotonicity Analysis for lambda-definable Functions over Lattices

Authors:
Andrzej S. Murawski;Kwangkeun Yi
Affiliations:
-;-
Venue:
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Year:
2002

Citing 13
Cited 1

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Automatic generation and management of interprocedural program analyses

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Experimental evaluation of a generic abstract interpretation algorithm for PROLOG

ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementation of the typed call-by-value λ-calculus using a stack of regions

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Necessary and Sufficient Criterion for the Monotonicity of Boolean Functions with Deterministic and Stochastic Applications

IEEE Transactions on Computers
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A cost-effective estimation of uncaught exceptions in standard ML programs

Theoretical Computer Science
Towards a Cost-Effective Estimation of Uncaught Exceptions in SML Programs

SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Compositional and Inductive Semantic Definitions in Fixpoint, Equational, Constraint, Closure-condition, Rule-based and Game-Theoretic Form

Proceedings of the 7th International Conference on Computer Aided Verification
On the Complexity of the Monotonicity Verification

COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
Testing Monotonicity

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Universal Top-Down Fixpoint Algorithm

A Universal Top-Down Fixpoint Algorithm

Static extensivity analysis for λ-definable functions over lattices

New Generation Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We employ static analysis to examine monotonicity of functions defined over lattices in a 驴-calculus augmented with constants, branching, meets, joins and recursive definitions. The need for such a verification procedure has recently arisen in our work on a static analyzer generator called Zoo, in which the specification of static analysis (input to Zoo) consists of finite-height lattice definitions and function definitions over the lattices. Once monotonicity of the functions is ascertained, the generated analyzer is guaranteed to terminate.