Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4951825 | Science of Computer Programming | 2016 | 15 Pages |
Abstract
We present a new proof obligation for anticipated events that does not have this defect and prove it correct. The proof is fairly intricate due to the nondeterminism of the simulations that link refinements. An informal soundness argument suggests using a lexicographic product in the soundness proof. However, it turns out that a weaker order is required which we call quasi-lexicographic product.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Stefan Hallerstede,