2015
DOI: 10.1007/978-3-319-27436-2_15
|View full text |Cite
|
Sign up to set email alerts
|

Combining Top-Down and Bottom-Up Techniques in Program Derivation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…Ref. [11] divided the post-assertion into multiple specifications based on the weakest predicate method and then formed a loop invariant for derivation [12] . Refs.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Ref. [11] divided the post-assertion into multiple specifications based on the weakest predicate method and then formed a loop invariant for derivation [12] . Refs.…”
Section: Related Workmentioning
confidence: 99%
“…Refs. [11,12] are based on the decomposition of post-assertions. However, in the face of more complex program specifications, finding sub-specifications becomes difficult, and the derivation process becomes more complex as the number of sub-specifications increases.…”
Section: Related Workmentioning
confidence: 99%