{"id":528,"date":"2021-06-08T11:35:29","date_gmt":"2021-06-08T10:35:29","guid":{"rendered":"http:\/\/www.macs.hw.ac.uk\/splv\/?page_id=528"},"modified":"2021-08-12T12:16:44","modified_gmt":"2021-08-12T11:16:44","slug":"splv-2021","status":"publish","type":"page","link":"https:\/\/www.macs.hw.ac.uk\/splv\/splv-2021\/","title":{"rendered":"SPLV 2021"},"content":{"rendered":"\n

This year, the Scottish Programming Languages and Verification Summer School returns to Glasgow (at least, virtually). The online event is organized by the School of Computing Science<\/a> at the University of Glasgow\"[University<\/a>.<\/p>\n

SPLV 2021 is scheduled across two consecutive weeks: Monday 9 August – Friday 13 August<\/strong>, then Monday 16 August – Wednesday 18 August<\/strong>, with 1-2 hours commitment most days.\u00a0 Lectures will run live via Zoom, with follow-up Q+A facilitated on the SPLV Slack<\/a> and\/or SPLS Zulip<\/a>. Participation is free since the event is entirely virtual. Please register<\/strong> for SPLV participation by completing this registration form<\/a>.<\/p>\n

Courses<\/h3>\n

Simon Peyton Jones<\/a> (Microsoft Research<\/a>) –\u00a0 Hashing Modulo Alpha Equivalence<\/h4>\n
\"[Simon

photo CC BY-SA 4.0
(based on original version by Duncan.Hull)<\/p><\/div>\n

In many applications, one wants to identify identical subtrees of a program syntax tree. This identification should ideally be robust to alpha-renaming of the program, but no existing technique has been shown to achieve this with good efficiency (better than O(n^2) in expression size). We present a new, asymptotically efficient way to hash modulo alpha-equivalence. A key insight of our method is to use a weak (commutative) hash combiner at exactly one point in the construction, which admits an algorithm with O(n*(log n)^2) time complexity. We prove that the use of the commutative combiner nevertheless yields a strong hash with low collision probability.<\/p>\n

Guy Katz<\/a> (Hebrew University of Jerusalem<\/a>) – \"[GuySafety in AI Systems: SMT-Based Verification of Neural Networks<\/h4>\n

Guy’s research focuses on applying formal methods to enable the creation of reliable and correct software. He is particularly interested in formally verifying systems that feature machine-learned components, such as neural networks. For instance, the Marabou<\/a> framework for verifying deep neural networks is an SMT-based tool that can answer queries about a network\u2019s properties by transforming these queries into constraint satisfaction problems.<\/p>\n

Jennifer Allanson<\/a> (Tuplespace<\/a>) – How to present your research online\"[Jen<\/h4>\n
The world has changed. Online networking and relationship building has become an important part of professional academic practice.\u00a0Presenting your work online in a manner which is engaging and informative will create valuable opportunities.\u00a0In this workshop we will think about different audiences for our work, identify ways to make what we do interesting to people with different backgrounds and specialisms, and think about how to create and tell memorable stories about our work, considering ways to encourage interactivity and question asking.<\/div>\n
\u00a0<\/div>\n

Ilyena Hirskyj-Douglas<\/a> (University of Glasgow<\/a>) – \"[IlyenaStories of Programming Computers for Animals<\/h4>\n
In this talk, Ilyena Hirskyj-Douglas will go over examples of novel systems she has created for dogs and monkeys, telling stories of both failures and successes, also speculating on the future of computer systems for animals.<\/div>\n
\u00a0<\/div>\n

Provisional Schedule<\/h3>\n

All times are UK BST<\/a> (UTC+1)<\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n
Mon 9 Aug, 1000-1130<\/td>\nGuy Katz (Safety in AI Systems – part 1<\/em>)<\/a><\/td>\n<\/tr>\n
Mon 9 Aug, 1400-1530<\/td>\nSimon Peyton Jones (Hashing Modulo Alpha Equivalence)<\/a><\/td>\n<\/tr>\n
Tue 10 Aug, 1000-1130<\/td>\nGuy Katz (Safety in AI Systems – part 2<\/em>)<\/a><\/td>\n<\/tr>\n
Wed 11 Aug, 1000-1130<\/td>\nGuy Katz (Safety in AI Systems – part 3<\/em>)<\/a><\/td>\n<\/tr>\n
Thu 12 Aug, 1000-1130<\/td>\nGuy Katz (Safety in AI Systems – part 4<\/em>)<\/a><\/td>\n<\/tr>\n
Fri 13 Aug, 1000-1200<\/td>\nJennifer Allanson (How to present your research online)<\/td>\n<\/tr>\n
Fri 13 Aug, 1400-1530<\/td>\nVirtual expedition (details to follow)<\/td>\n<\/tr>\n
Mon 16 Aug, 1000-1130<\/strong> 1400-1530<\/del><\/td>\nIlyena Hirskyj-Douglas (Programming Computers for Animals)<\/td>\n<\/tr>\n
Tue 17 Aug, 1400-1530<\/td>\nVirtual poster session 1<\/td>\n<\/tr>\n
Wed 18 Aug, 1400-1530<\/td>\nVirtual poster session 2<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

Organizers<\/h3>\n

SPLV 2021 is being organized by:<\/p>\n