Resource Control Graphs

Jean-Yves Moyen (1)

1 LIPN - Laboratoire d'Informatique de Paris-Nord

Resource Control Graphs can be seen as an abstract representation of programs. Each state of the program is abstracted as its size, and each instruction is abstracted as the effects it has on the size whenever it is executed. The Control Flow Graph of the programs gives indications on how the instructions might be combined during an execution. Termination proofs usually work by finding a decrease in some well-founded order. Here, the sizes of states are ordered and such kind of decrease is also found. This allows to build termination proofs similar to the ones in Size Change Termination. But the size of states can also be used to represent the space used by the program at each point. This leads to an alternate characterisation of the Non Size Increasing programs, that is the ones that can compute without allocating new memory. This new tool is able to encompass several existing analysis and similarities with other studies hint that even more analysis might be expressable in this framework thus giving hopes for a generic tool for studying programs.

Mots clés: Abstraction; implicit complexity; non-size increasing; program analysis; size change termination; termination

Domaines: Logique en informatique [cs.LO]; Complexité [cs.CC]

Jean-Yves Moyen. Resource Control Graphs. ACM Transactions on Computational Logic, 2009, 10 (4), ⟨10.1145/1555746.1555753⟩. ⟨hal-00107145v3⟩