We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
We present a model checker for verifying distributed programs written in the Erlang programming language. Providing a model checker for Erlang is especially rewarding since the la...
Research in formal description of programming languages over the past four decades has led to some significant achievements. These include formal syntax and semantics for complete...
This paper introduces TurTan, a tangible programming language for creative exploration inspired by Logo, which uses a tabletop interface with tangible objects. The aim of this pro...
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...