SAMPLE SETL2 PROGRAMS

The following are some SETL2 programs with sample inputs. All programs below have no warranties, and should be used at one's own risk.

To run SETL2 at NYU, see the following instructions. Anyone who wants to run the program at a site that doesn't have SETL2 can install SETL2 easily by following the instructions found here.

Selected Programs

• Very high level Setl2 programs are given for graph reachability, cycle testing, and CFG nullability.
• Medium level Setl2 programs are given for graph reachability, cycle testing, topological sorting, tree center finding, and maximal independent set.
• A lower level SETL2 program is given for cycle testing.
• Sample inputs are given for the SETL2 programs above that compute graph reachability, cycle testing, topological sorting, tree center, CFG nullability, and maximal independent set.
• This lower level prototype SETL2 program computes the maximum ready simulation relation between two finite transition processes. A derivation of this program may be found in the paper by Bloom and Paige. Two examples of input found here and here correspond to problem instances shown in Figure 1.a of that paper.