Talk:Predicate abstraction

Predicate Abstraction in Computer Science
In computer science, predicate abstraction means something quite different.

It is a form of Abstract interpretation where the possible states of a computer program are managed as formulas over a set of predicates. This can be used to prove safety properties of computer programs. For example, the SLAM project uses this to verify that Windows device drivers do not crash.

Would it make sense to split this article into Predicate abstraction (Logic) and Predicate abstraction (Computer science)? I admit that I know nothing about predicate abstraction in logic, but could help with the CS part. --Jonas Wagner (talk) 09:29, 16 August 2012 (UTC)