共 6 条
- [4] Polynomial Invariant Generation for Non-deterministic Recursive Programs PROCEEDINGS OF THE 41ST ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI '20), 2020, : 672 - 687
- [5] There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations Inf. Process. Lett., 6 (289-293):