Title :
DEAL-a language for depicting algorithms
Author_Institution :
Praktisch Inf. IV, Fern Univ., Hagen, Germany
Abstract :
We describe a visual language for the specification of algorithms that mimics illustrations of data structures and algorithms widely used. By combining illustration “folklore” with elements of modern functional languages we achieve highly compact specifications, e.g. Quicksort can be defined by a single rule. The formal definition of the language is given by mapping geometric relationships directly to semantic concepts
Keywords :
algorithm theory; formal specification; visual languages; DEAL; algorithms; data structures; formal definition; functional languages; geometric relationships; highly compact specifications; semantic concepts; specification of algorithms; visual language; Buildings; Data structures; Joining processes; Microwave integrated circuits; Modems; Pattern matching; Tree data structures;
Conference_Titel :
Visual Languages, 1994. Proceedings., IEEE Symposium on
Conference_Location :
St. Louis, MO
Print_ISBN :
0-8186-6660-9
DOI :
10.1109/VL.1994.363620
