2 citations · 3 across the 6 of their papers we have counts for
5 papers · 1 filter
Solving Interactive Fiction Games via Partial Evaluation and Bounded Model Checking
Martin Mariusz Lester
We present a case study on using program verification tools, specifically model-checkers for C programs, to solve simple interactive fiction games from around 1980. Off-the-shelf m…
What can a 1980s BASIC programming textbook teach us today?
Martin Lester
Elementary Basic, published in 1982, is an introductory programming text with a novel central conceit, namely that the fictional 19th century detective Sherlock Holmes used a compu…
Analysis of MiniJava Programs via Translation to ML
Martin Mariusz Lester
MiniJava is a subset of the object-oriented programming language Java. Standard ML is the canonical representative of the ML family of functional programming languages, which inclu…
Verifying Liveness Properties of ML Programs
M. M. Lester, R. P. Neatherway, C. -H. L. Ong +1
Higher-order recursion schemes are a higher-order analogue of Boolean Programs; they form a natural class of abstractions for functional programs. We present a new, efficient algor…
Information Flow Analysis for a Dynamically Typed Functional Language with Staged Metaprogramming
Martin Lester, Luke Ong, Max Schaefer
Web applications written in JavaScript are regularly used for dealing with sensitive or personal data. Consequently, reasoning about their security properties has become an importa…