University of Cambridge > Talks.cam > Computer Laboratory Automated Reasoning Group Lunches > Explicit vs. symbolic algorithms for solving ALFP constraints

Explicit vs. symbolic algorithms for solving ALFP constraints

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact William Denman.

ALFP , Alternation-free Least Fixed Point logic, has successfully been used as an intermediate language in the implementation of static analysis and model checking problems. Clearly different analysis problems may give rise to ALFP clauses with different characteristics. There are also different approaches to solving ALFP clauses and some of those are better suited for certain kinds of clauses than others. The aim of this talk is to present two algorithms, one that is based on differential worklists and one based on BDD ’s, and experiment with them.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity