  We propose a light-weight client-server model of communication between
existing implementations of different program analyses. The communication is
on-line and anonymous which means that all analyses simultaneously analyse the
same program and an analysis does not know what other analyses participate in
the communication. The anonymity and model's strong emphasis on independence of
analyses allow to preserve almost everything in existing implementations. An
analysis only has to add an implementation of a proposed communication
protocol, determine places in its code where information from others would
help, and then check whether there is no communication scenario, which would
corrupt its result. We demonstrate functionality and effectiveness of the
proposed communication model in a detailed case study with three analyses: two
abstract interpreters and the classic symbolic execution. Results of the
evaluation on SV-COMP benchmarks show impressive improvements in computed
invariants and increased counts of successfully analysed benchmarks.
