"tested for compatibility" is a correct and commonly used phrase in written English.
It is typically used when talking about testing a product or system to ensure that it works well with other products or systems. Example: Before releasing the new software update, it was extensively tested for compatibility with various operating systems and devices.
"Although Mai has an older brother, when he was tested for compatibility it was found out that he isn't compatible". Unfortunately, a sibling has only a 25-30 perchancehance to be compatible.
Recently, all of the couple's children had their blood tested for compatibility with their mother's.
The initial composition predicted by simple cosmological theory can then be tested for compatibility with present observations.
Appel said Mourning would need a transplant soon, and his relatives and friends are being tested for compatibility for a transplant.
The validity of proposed target stoichiometries can then be tested for compatibility with this stoichiometric space.
Multiple biological fluids (i.e. human saliva, urine and rat blood and serum) were successfully tested for compatibility with the device and actuation mechanism, demonstrating low slip angles and high contact angles.
The display is able to "test for compatibility of networked media devices with Intel Viiv technology-based PCs while sharing content over a home network".
"For this release, we wanted to focus on giving developers time to test for compatibility, explore new features and send feedback which will help make Android O a great platform," a Google spokesperson told me when I asked why the company wasn't releasing this version in the Android Beta channel.
Immediately before transfusion, a cross-match test was done to test for compatibility.
The execution time of the GPU-accelerated MCML program (named GPU-MCML) was measured on a variety of NVIDIA graphics card to test for compatibility across different generations.
Testing for compatibility is an NP-complete problem; however, the problem is solvable in polynomial time when the number of input trees is fixed.
