3 citations · 6 across the 9 of their papers we have counts for
9 papers
Simplifying Negative Goals Using Typed Existence Properties
Lunjin Lu, John G. Cleary
A method for extracting positive information from negative goals is proposed. It makes use of typed existence properties between arguments of a predicate to rewrite negative goals…
Parametrizing Program Analysis by Lifting to Cardinal Power Domains
Lunjin Lu
A parametric analysis is an analysis whose input and output are parametrized with a number of parameters which can be instantiated to abstract properties after analysis is complete…
Required Behavior of Sequence Diagrams: Semantics and Conformance
Lunjin Lu, Dae-kyoo Kim
Sequence diagrams are a widely used design notation for describing software behaviors. Many reusable software artifacts such as design patterns and design aspects make use of seque…
Improving Precision of Type Analysis Using Non-Discriminative Union
Lunjin Lu
This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type…
A Backward Analysis for Constraint Logic Programs
Andy King, Lunjin Lu
One recurring problem in program development is that of understanding how to re-use code developed by a third party. In the context of (constraint) logic programming, part of this…
An Emptiness Algorithm for Regular Types with Set Operators
Lunjin Lu, John G. Cleary
An algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterised type definitions is presented. The algorithm can also be used to d…