LabVIEW application with embedded Lua scripting for a laser based measuring machine

Published ArticleThis paper presents the work on the development of software for an industrial laser based measuring machine. The goal being not only for a working application, but also to optimise the development process and ease future maintenance of the software. LabVIEW with its graphical method of programming allows engineers to easily create large software applications to control industrial processes and machines. This software if not properly designed can lead to stability and maintenance problems. The experience gained from developing, maintaining and improving a LabVIEW application for a laser measuring machine, results in the integration of the Lua scripting language into LabVIEW. It is shown how the embedded Lua allows the LabVIEW software application for the machine to be structured for simpler development and maintenance

The Use of Generic Scripting in Certain Application Development Projects

This article discusses generic scripting, a useful scripting technology for developing applications. In its simplest use, generic scripting can be used as a documentation tool to replace flowcharting or pseudocode. in certain situations, generic scripting can lead directly to a working application without the need to write, compile and test a new program. Generic scripting is discussed as a tool which can be used in logical design, detailed design and implementation of a new application. An example is presented to show how generic scripting can be used by non-programmers to simplify the development of applications. This example is used to teach business processes at the authors’ university

Parameterized Construction of Program Representations for Sparse Dataflow Analyses

Data-flow analyses usually associate information with control flow regions. Informally, if these regions are too small, like a point between two consecutive statements, we call the analysis dense. On the other hand, if these regions include many such points, then we call it sparse. This paper presents a systematic method to build program representations that support sparse analyses. To pave the way to this framework we clarify the bibliography about well-known intermediate program representations. We show that our approach, up to parameter choice, subsumes many of these representations, such as the SSA, SSI and e-SSA forms. In particular, our algorithms are faster, simpler and more frugal than the previous techniques used to construct SSI - Static Single Information - form programs. We produce intermediate representations isomorphic to Choi et al.'s Sparse Evaluation Graphs (SEG) for the family of data-flow problems that can be partitioned per variables. However, contrary to SEGs, we can handle - sparsely - problems that are not in this family