Ueda, K., klint --- Static Analyzer for KL1 Programs. Available from http://www.icot.or.jp/AITEC/FGCS/funding/itaku-H9-index-E.html, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Error-correcting Source Code - Yasuhiro Ajiro Kazunori (1998) (1 citation) Self-citation (Ueda) (Correct)
....information of the toplevel predicate and unification goals is omitted. F 1 , F n is somewhat arbitrary. This is why moding is more fundamental than typing in concurrent logic programming. Mode and type analyses have been implemented as part of klint, a static analyzer for KL1 programs [11]. # # (HBF# ) #(p) F i , for a function symbol occurring at p in h or B. HBV# ) # p = # p # , for a variable occurring both at p and p # in h or B. GV# ) #(pq) #(p # q) for a variable occurring both at p in h and at p # in G. BU# ) # #=k , 1# = # #=k , 2#, for a unification ....
Ueda, K., klint --- Static Analyzer for KL1 Programs. Available from http://www.icot.or.jp/AITEC/FGCS/funding/itaku-H9-index-E.html, 1998.
Resource-Passing Concurrent Programming - Ueda (2 citations) Self-citation (Ueda) (Correct)
....has a node, under the arc labeled #. 1#, that expresses no constraints at all. It was created to express binary constraints, but all its parent nodes were later merged into a single node by other constraints. All these ideas have been implemented in the mode analyzer for KL1 program, klint v2 [44], which can output a text version of the mode graph as in Fig. 5. As another example, consider a program that simply unifies its arguments: p(X,Y) X = Y. The program forms a mode graph shown in Fig. 6. This graph can be viewed as the principal mode of the predicate p, which represents many ....
Ueda, K., klint --- Static Analyzer for KL1 Programs. Available from http:// www.icot.or.jp/ARCHIVE/Museum/FUNDING/funding-98-E.html, 1998.
Linearity Analysis of Concurrent Logic Programs - Ueda (1999) (2 citations) Self-citation (Ueda) (Correct)
....the analysis of the amount of storage needed to execute a program. We believe that declarative programming with resource analysis will be a realistic tool for embedded and hard real time applications. 8 Implementation klint v2 A static analyzer for KL1 programs called klint v2 [11] features both mode and linearity analyses. This section outlines the implementation of klint v2. Basically, mode and linearity analyses are constraint satisfaction problems that can be solved using very similar techniques. In klint v2, a set of mode 12 Kazunori UEDA constraints is represented ....
Ueda, K., klint --- Static Analyzer for KL1 Programs. Available from http://www.icot.or.jp/ARCHIVE/Museum/FUNDING/funding-98-E.html, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC