I would not discard the possibility the best most concrete descriptions
of algorithms that you will find will be the programs (e.g.
Mathematica code), and that the reduction of the papers to
the code may involve details not present in the papers.
This opinion is, however, based on general experience and not
a particular examination of FeynCalc.
Good luck in any case..
This archive was generated by hypermail 2b29 : 08/23/17-11:40:01 AM Z CEST