共 50 条
- [41] Quantifier elimination for counting extensions of Presburger arithmetic FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2022), 2022, 13242 : 225 - 243
- [43] Detection of infeasible paths using presburger arithmetic TWENTIETH ANNUAL INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE (COMPSAC'96), PROCEEDINGS, 1996, 20 : 461 - 469
- [45] Bounding quantification in parametric expansions of Presburger arithmetic Archive for Mathematical Logic, 2018, 57 : 577 - 591
- [47] Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy PROCEEDINGS OF THE JOINT MEETING OF THE TWENTY-THIRD EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC (CSL) AND THE TWENTY-NINTH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2014,
- [48] FPL: Fast Presburger Arithmetic through Transprecision PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2021, 5 (OOPSLA):
- [50] Multiple counters automata, safety analysis and presburger arithmetic COMPUTER AIDED VERIFICATION, 1998, 1427 : 268 - 279