Common use of Checking the Programmer’s Code Clause in Contracts

Checking the Programmer’s Code. For a given program, we first check that each template referred from the program is also mentioned in the contract directory, corresponding to §4. The remaining checks require the construction of summary graphs for each expression in show statements. These are obtained by constructing the dummy template directory T (C), as described in Section 4.3, and then running the JWIG analyzer on this structure. For every statement of the form: show H as P ; this provides a summary graph GH . To check §5, we inspect that P occurs as a page in the contract, construct a summary graph GP,C,T (C) as in Section 5.2 but using the dummy templates, and then check that GH ⊆ GP,C,T (C) Inclusion on summary graphs is determined on the set of edges, where po- tentially open gaps are viewed as edges to a special “ε” template, and nodes representing string sets are compared by set inclusion. Finally, the check of fields in receive expressions, §6, is simply performed by the JWIG analyzer using the algorithm described in [9].

Checking the Programmer’s Code. For a given program, we first check that each template referred from the program is also mentioned in the contract directory, corresponding to §4. The remaining checks require the construction of summary graphs for each expression in show statements. These are obtained by constructing the dummy template directory T (C), as described in Section 4.3, and then running the JWIG analyzer on this structure. For every statement of the form: show H as P ; this provides a summary graph GH . To check §5, we inspect that P occurs as a page in the contract, construct a summary graph GP,C,T (C) as in Section 5.2 but using the dummy templates, and then check that GH ⊆ GP,C,T (C) Inclusion on summary graphs is determined on the set of edges, where po- tentially potentially open gaps are viewed as edges to a special “ε” template, and nodes representing string sets are compared by set inclusion. Finally, the check of fields in receive expressions, §6, is simply performed by the JWIG analyzer using the algorithm described in [9].

Checking the Programmer’s Code. For a given program, we first check that each template referred from the program is also mentioned in the contract directory, corresponding to §4. The remaining checks require the construction of summary graphs for each expression in show statements. These are obtained by constructing the dummy template directory T (C), as described in Section 4.3, and then running the JWIG analyzer on this structure. For every statement of the form: show H as P ; this provides a summary graph GH . To check §5, we inspect that P occurs as a page in the contract, construct a summary graph GP,C,T (C) as in Section 5.2 but using the dummy templates, and then check that GH ⊆ GP,C,T (C) Inclusion on summary graphs is determined on the set of edges, where po- tentially potentially open gaps are viewed as edges to a special “ε” template, and nodes representing string sets are compared by set inclusion. § Finally, the check of fields in receive expressions, §6, is simply performed by the JWIG analyzer using the algorithm described in [9].

Checking the Programmer’s Code. ‌ § For a given program, we first check that each template referred from the program is also mentioned in the contract directory, corresponding to §4. The remaining checks require the construction of summary graphs for each expression in show statements. These are obtained by constructing the dummy template directory T (C), as described in Section 4.3, and then running the JWIG analyzer on this structure. For every statement of the form: show H as P ; § this provides a summary graph GH . To check §5, we inspect that P occurs as a page in the contract, construct a summary graph GP,C,T (C) as in Section 5.2 but using the dummy templates, and then check that GH ⊆ GP,C,T (C) Inclusion on summary graphs is determined on the set of edges, where po- tentially open gaps are viewed as edges to a special “ε” template, and nodes representing string sets are compared by set inclusion. § Finally, the check of fields in receive expressions, §6, is simply performed by the JWIG analyzer using the algorithm described in [9].