共 50 条
- [41] A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs INTEGRATED FORMAL METHODS, 2010, 6396 : 121 - 135
- [43] Efficient Conversion of Boolean Circuits to Nondeterministic Branching Programs 2019 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2019, : 655 - 662
- [46] Reachability games and game semantics: comparing nondeterministic programs TWENTY-THIRD ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2008, : 353 - 363