AbstractIn this paper, we propose a new static analysis method which is applicable for a classical linear logic programming language.Andreoli et al. proposed a static analysis method for the classical linear logic programming language LO, but their method did not cover multiplicative connectives which are important for a resource-sensitive feature of linear logic.Our method, in contrast, covers multiplicative conjunction in addition to multiplicative disjunction and linear implication. An abstract proof graph, an AND-OR graph representing all possible sequent proofs, is constructed from a given program and goal sequent. The graph can be repeatedly refined by propagating information to eliminate unprovable nodes from the graph.We applied our prototype analyzer for a sorting program written in Forum. The sorting program was improved about 1000 times faster than the ordinary program without analysis, for sorting 6 elements by using the analysis result.