Kunsten at vejlede et konstruktionsprojekt

I denne artikel beskriver vi nogle af de faldgruber ved konstruktionsprojekter, vi har observeret, studerende oftest falder i. Ved at beskrive ofte forekommende problemer er det vores håb, at både vejledere og studerende bedre kan blive opmærksomme på dem og imødekomme dem

A MuDDy Experience-ML Bindings To A BDD Library

Abstract. Binary Decision Diagrams (BDDs) are a data structure used to efficiently represent boolean expressions on canonical form. BDDs are often the core data structure in model checkers. MuDDy is an ML interface (both for Standard ML and Objective Caml) to the BDD package BuDDy that is written in C. This combination of an ML interface to a high-performance C library is surprisingly fruitful. ML allows you to quickly experiment with high-level symbolic algorithms before handing over the grunt work to the C library. I show how, with a relatively little effort, you can make a domain specific language for concurrent finite state-machines embedded in Standard ML and then write various custom model-checking algorithms for this domain specific embedded language (DSEL)

Generic multiset programming for language-integrated querying

This paper demonstrates how relational algebraic programming based on efficient symbolic representations of multisets and operations on them can be applied to the query sublanguage of SQL in a type-safe fashion. In essence, it provides a library for naïve programming with multisets in a generalized SQL-style fashion, but avoids many cases of asymptotically inefficient nested iteration through cross-products.

Abstract Incremental Execution of Transformation Specifications

We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-trivial program analysis to check their applicability, and it is prohibitively expensive to re-run such analyses after each transformation. It is desirable, therefore, that the analysis information is incrementally updated. We achieve this by drawing on two pieces of previous work: first, Bernhard Steffen’s proposal to use model checking for certain analysis problems, and second, John Conway’s theory of language factors. The first allows the neat specification of transformations, while the second opens the way for an incremental implementation. The two ideas are linked by using regular patterns instead of Steffen’s modal logic: these patterns can be viewed as queries on the set of program paths. Categories and Subject Descriptors: D.3.4 [Processors]: Optimization, Incremental compilers, Translator writing systems an