Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
Higher Order Generalization And Its Application In Program Verification, Jianguo Lu, John Mylopoulos, Masateru Harao, Masami Hagiya
Higher Order Generalization And Its Application In Program Verification, Jianguo Lu, John Mylopoulos, Masateru Harao, Masami Hagiya
Computer Science Publications
Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti–unification) is well understood, its various extensions are often needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2 [1]. Based on the application ordering, we prove that least general generalization exists for any two terms and is unique up to renaming. An algorithm to compute the least general generalization is also presented. To illustrate its usefulness, we propose a program verification system based on higher order generalization that can reuse the proofs of similar programs.
P-Buffer: Hidden-Line Rendering With A Dynamic P-Buffer, Xiaobu Yuan, Sun Hanqiu
P-Buffer: Hidden-Line Rendering With A Dynamic P-Buffer, Xiaobu Yuan, Sun Hanqiu
Computer Science Publications
Despite the emergence of highly realistic computer-generated images, line-drawing images are still a common practice in showing the shapes and movements of three-dimensional objects. It is especially true when rendering time is critical in interactive applications such as the modeling and testing stage of computer aided design/manufacturing, computer animation, and virtual reality. Hence much effort has been devoted to provide sufficient information of the displayed objects with the least amount of time. While the techniques that determine visible surfaces in an image-space have the advantages on rendering speed and processable shapes, those that decide visible lines or line segments in …