Talk:Predicate abstraction

This article is within the scope of WikiProject Philosophy, a collaborative effort to improve the coverage of content related to philosophy on Wikipedia. If you would like to support the project, please visit the project page, where you can get more details on how you can help, and where you can join the general discussion about philosophy content on Wikipedia.PhilosophyWikipedia:WikiProject PhilosophyTemplate:WikiProject PhilosophyPhilosophy

Mid

This article has been rated as Mid-importance on the project's importance scale.

Associated task forces:
/
	Logic

Predicate Abstraction in Computer Science

Latest comment: 13 years ago1 comment1 person in discussion

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)Reply

This page was redesigned at the edge.

A page that knows where it met you.

Talk:Predicate abstraction

Predicate Abstraction in Computer Science