Many modern program verifiers translate the program to be verified and its specification into a simple intermediate representation and then compute verification conditions on ...
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
We propose to search for common abstractions for different concurrency models to enable high-level language virtual machines to support a wide range of different concurrency model...
Asynchronous exception propagation is a useful alternative form of communication among threads, especially if timely propagation is ensured. However, timely propagation is impossi...
We present HML, a type inference system that supports full firstclass polymorphism where few annotations are needed: only function parameters with a polymorphic type need to be an...