共 41 条
- [32] Parametric Model Checking Timed Automata Under Non-Zenoness Assumption NASA FORMAL METHODS (NFM 2017), 2017, 10227 : 35 - 51
- [33] Disproving Termination of Non-erasing Sole Combinatory Calculus with Tree Automata IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2024, 2024, 15015 : 261 - 275
- [37] EQBENCH: A Dataset of Equivalent and Non-equivalent Program Pairs 2021 IEEE/ACM 18TH INTERNATIONAL CONFERENCE ON MINING SOFTWARE REPOSITORIES (MSR 2021), 2021, : 610 - 614
- [38] Enforcement FSMs - Specification and Verification of Non-Functional Properties of Program Executions on MPSoCs 2021 19TH ACM-IEEE INTERNATIONAL CONFERENCE ON FORMAL METHODS AND MODELS FOR SYSTEM DESIGN (MEMOCODE), 2022, : 21 - 31
- [40] Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation PROCEEDINGS OF THE 21ST INTERNATIONAL SYMPOSIUM ON PRINCIPLES AND PRACTICE OF DECLARATIVE PROGRAMMING (PPDP 2019), 2019,