PhD Viva Success

Many congratulations to Yue Li for passing his PhD Viva today with minor corrections. The title of his thesis is:

“A Proof-Theoretic Approach to Coinduction in Horn Clause Logic” 

Yue was supervised by Katya Komendantskaya and Mark Lawson. His External Examiner was John Power (University of Bath). 

Success of LAIV MSc student Pierre Le Hen

Many congratulations to LAIV MSc student Pierre Le Hen who secured a place to do a Masters specialising in Management of Systems Information at ESSEC:

The positions are highly competitive, so well done Pierre and hope you have a great career ahead of you!

Big Proof Conference in Edinburgh

The Second Big Proof event has started today in Edinburgh, following its first edition at Cambridge in 2017. A number of LAIV members are participating, Katya is giving a talk on LAIV’s experience in Neural net verification.

First Scottish Summer School on Programming Languages and Verification

First Scottish Summer School on Programming Languages and Verification is now announced. LAIV supported this initiative in a number of ways: Katya Komendantskaya serves in the steering committee as one of the main organisers, and Rob Stewart is going to give a course on Domain Specific Languages. This school is highly recommended to all PhD students, as well as strong MSc students and Early Career researchers. Industrial participants and sponsors are very welcome.

LAIV students start a reading group on Software Foundations

LAIV students start a reading group on Software Foundations in Coq, The reading and programming sessions will take place every Tuesday at 10.00. Check-out the schedule and room changes at or email Daniel Kienitz directly.

Franta Farka is giving a DREAM talk in Edinburgh University

Franta Farka is giving a talk for the DREAM group at Edinburgh University.

Title: Proof-Relevant Resolution for Constructive Automation.

Venue and time: 23 April, 11:00 , Informatics Forum, room 2.33.

Abstract: In this talk, we introduce proof-relevant resolution, a framework for constructive proof automation. The intended application of the framework is verifiable proof automation in strongly typed programming languages. We motivate the framework by two use-cases that show its strengths. First, we show a proof-relevant approach to type inference and term synthesis. Secondly, we demonstrate the use of the framework for the purpose of study semantical properties of programming languages, namely soundness of type-class elaboration. In the talk, we describe the key features of big-step and small-step operational semantics and show soundness of the small-step w.r.t. the big-step semantics. We briefly outline the proof as it requires a use of logical relation.

Message Input