DocumentCode
2345607
Title
DEAL-a language for depicting algorithms
Author
Erwig, Martin
Author_Institution
Praktisch Inf. IV, Fern Univ., Hagen, Germany
fYear
1994
fDate
4-7 Oct 1994
Firstpage
184
Lastpage
185
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;
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.363620
Filename
363620
Link To Document