References for TCS proof techniques Are there any references (online or in book form) that organize and discuss TCS theorems by proof technique?  Garey and Johnson do this for the various kinds of widget constructions needed for NP-completeness proofs (particularly in chapter 3 of their book), but I'm wondering if there's anything that treats proof techniques in TCS more broadly.  

So for example, topics might include diagonalization, broken down further by the type of construction used; proofs by computation histories; tableau constructions; incompressibility arguments, etc.  I suppose I could just chop up a standard theory of computation text and rearrange the sections, but it would be great if there is something out there that also provides some additional commentary and shows where there are commonalities between the techniques being used.

Just to be clear, since any text is going to use proofs, what I'm really interested in finding is a reference where the proof techniques themselves are the actual subject matter.

In addition to chapter 3 of Garey and Johnson, here's another partial example that just occurred to me: in Li and Vitanyi, in chapter 6 they discuss the incompressibility method and give examples of how to apply the technique.
The Complexity Theory Companion by Hemaspaandra and Ogihara.  It's not exhaustive in terms of techniques (I imagine no such book is), but I think it qualifies as an answer to your question.  Here are the titles of the chapters:


The Self-Reducibility Technique. 
The One-Way Function Technique. 
The Tournament Divide and Conquer Technique. 
The Isolation Technique. 
The Witness Reduction Technique. 
The Polynomial Interpolation Technique. 
The Nonsolvable Group Technique. 
The Random Restriction Technique. 
The Polynomial Technique.