Return Graph varies from Call Graph?

[Dr Richard J. Reid]

Do you have any suggestions about how to vary the
return graph of function invocation from the call graph?

This capability would seem to be highly implementation dependent;
however, any suggestions of more universal applicability
than permuting the invocation frames on the stack, would be
especially welcome.

Example:  (For a simple linear graph)

  Given the call sequence:     A -> B -> C -> D

  Can the return sequence be:  A <- C <- B <- D  ?

Thanks,

Dick