Paper Info
Title
Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures
Abstract
A class of nondeterministic flowchart programs with recursive procedures is defined. Their semantics is studied algebraically, in particular the notion of unfoldment. An extension of the inductive assertion method is introduced and shown to be sound and complete with a finite number of assertions.
Year
DOI
Venue
1978
10.1007/3-540-08860-1_19
ICALP
Keywords
Field
DocType
nondeterministic flowchart programs,recursive procedures
Finite set,Programming language,Nondeterministic algorithm,Computer science,Assertion,Correctness,Theoretical computer science,Flowchart,Semantics,Recursion
Conference
ISBN
Citations 
PageRank 
3-540-08860-1
4
0.71
References 
Authors
16
1
Name
Order
Citations
PageRank
Jean H. Gallier1749111.86