DocumentCode
2346000
Title
Applicability checking in visual programming languages
Author
Wang, Guijun ; Ambler, Allen
Author_Institution
Dept. of Electr. & Comput. Eng., Kansas Univ., Lawrence, KS, USA
fYear
1994
fDate
4-7 Oct 1994
Firstpage
31
Lastpage
38
Abstract
The notion of applicability checking attempts to determine the limits of applicability of a general programming language expression and to automatically make necessary adjustments to accommodate various irregularities, including boundary conditions. This paper presents an approach to applicability checking. A set of rules are supplied for determining applicability, developing applicable regions, and coercing structures automatically. Examples are presented to demonstrate the application of these rules
Keywords
visual languages; visual programming; applicability checking; applicable regions; boundary conditions; visual programming languages; Boundary conditions; Computer languages; Equations; Functional programming; Joining processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Visual Languages, 1994. Proceedings., IEEE Symposium on
Conference_Location
St. Louis, MO
Print_ISBN
0-8186-6660-9
Type
conf
DOI
10.1109/VL.1994.363643
Filename
363643
Link To Document