University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Layered Fixed Point Logic

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Layered Fixed Point Logic

Download to your calendar using vCal

If you have a question about this talk, please contact Bjarki Holm .

We present a logic for the specification of static analysis problems that goes beyond the logics traditionally used. Its most prominent feature is the direct support for both inductive computations of behaviors as well as co-inductive specifications of properties. Two main theoretical contributions are a Moore Family result and a parametrized worst case time complexity result. We show that the logic and the associated solver can be used for rapid prototyping and illustrate a wide variety of applications within Static Analysis, Constraint Satisfaction Problems and Model Checking. In all cases the complexity result specializes to the worst case time complexity of the classical methods.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Sir William Hardy Building, HB101 Online (link to be shared in email) Room 9, Faculty of Asian & Middle Eastern Studies, Sidgwick Avenue

Other talks

Polar Oceans Seminar Talk Using numerical simulations for solving spectral geometry problems The Magic of Magnetism Illegal trade in the North Atlantic Advances in Label-Free High-Resolution Molecular Imaging using J Series III Cluster SIMS Cambridge RNA Club - IN PERSON
 

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