Edinburgh Day One

Nov 12, 2007 17:46

Achieved:

  • Volunteered to give a Dream Talk on Friday
  • Printed out and read my papers on Program Slicing which I said I'd talk about in the Dream Talk
  • Long talk with LD about proof specification languages and control rules. Sent him draft paper on control rules by myself MJa and MP.

To Do:

  • Write an abstract to go with the title for my Dream Talk, ( Read more... )

theorem proving:systems:isaplanner, computer science:verification:induction, edinburgh, theorem proving:tptp thf, academia:groups:dream, theorem proving:proof planning, theorem proving:systems:proof general, theorem proving:theory slicing

Leave a comment

Comments 5

bunn November 13 2007, 10:59:56 UTC
This posting is rendered more than usually baffling by the password on the Dream Talk link :-D It sounds vaguely Australian Aborigine... :-P

Reply

louisedennis November 13 2007, 13:11:36 UTC
The group I'm associated with in Edinburgh is prosaically referred to as the MRG (Mathematical Reasoning Group) but when feeling more fanciful we get referred to as the DReaM group (Discovery and Reasoning in Mathematics).

The Dream talk is a weekly hour-and-a-half work in progress talk, in which the use of slides and projection equipment is frowned upon (but handouts are tolerated) and audience participation is encouraged. AB also has a gong which, at least when I was a regular member of the group, he used to sound just before the Dream talk thus removing the perennial excuse that you were involved in something and had therefore forgotten that the talk was taking place.

Reply


king_pellinor November 13 2007, 13:00:07 UTC
I like the way that you're going to do a title and an abstract before you've decided what you're going to say :-)

And that you're going to decide what to say and prepare a handout on it before you try to remember anything about the subject :-D

Reply

louisedennis November 13 2007, 13:14:18 UTC
You mean most people don't prepare talks like this?

I now have a title and abstract:

Program Slicing for Proof Theories

Program Slicing is a technique used in automated debugging to narrow the search for a bug to one portion of the code base. In this Dream talk I intend to look at ways that proof can be used to perform program slicing. Leading on from that I'll also discuss how programs can be patched by removing faulty slices and then performing synthesis proofs to produce a correct slice.

Reply

king_pellinor November 13 2007, 13:37:32 UTC
Well, I'd normally at least hope to do it in largely the reverse order :-)

Although the last talk I gave consisted of someone else doing a load of slides, which I then stood in front of (and occasionally referred to) while I delivered a lively and amusing discourse on tax, how to account for it, and why HMRC thinks each member of my audience is a liar.

Reply


Leave a comment

Up