.png){kind=icon}
.png){kind=icon}
Return
A Programming Language for Feasible Solutions
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-07106-4_4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Runtime efficiency and termination are crucial properties in the studies of program verification. Instead of dealing with these issues in an ad hoc manner, it would be useful to develop a robust framework in which such properties are guaranteed by design. This paper introduces a new imperative programming language whose design is grounded in a static type system that ensures the following equivalence property: All definable programs are guaranteed to run in polynomial time; Conversely, all problems solvable in polynomial time can be solved by some programs of the language. The contribution of this work is twofold. On the theoretical side, the foundational equivalence property is established, and the proof of the equivalence theorem is non-trivial. On the practical side, a programming approach is proposed that can streamline program analysis and verification for feasible computations. An interpreter for the language has been implemented, demonstrating the feasibility of the approach in practice.
Keywords:
Feasible Computation
Polynomial Time
Imperative Programming Language
Static Type System
Efficient Verification
Journal
S
IF:
0
Papers:
14
Citations:
0