University of Cambridge > > Semantics Lunch (Computer Laboratory) > Virtue of certified programming with decision procedures

Virtue of certified programming with decision procedures

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

  • UserVladimir Komendantsky (St Andrews)
  • ClockFriday 25 May 2012, 11:00-12:00
  • HouseFW26.

If you have a question about this talk, please contact Peter Sewell.

NB: unusual day/time

In this moderately technical talk, I will discuss explicit termination of computations certified in Coq, and recall the importance of correct decision procedures for constructive understanding of computational problems. I will refer to examples of first-order definable relations on finite-state transition systems to show how logical analysis can underpin different degrees of type dependencies.

This talk is part of the Semantics Lunch (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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