Chalmers Tekniska Hogskola

Approximation of Alternating Fixpoints: Short Cuts (2007)

A. Mader, M. Weichert, Chalmers Tekniska Hogskola

Many verification algorithms for finite transition systems are based on fixpoint approximation. This technique was introduced for model checking by Emerson and Lei [EmL86]. It was applied by Andersen...

A self-applicable partial evaluator for a subset of Haskell (2007)

Silvano Dal-Zilio, Director John Hughes, Chalmers Tekniska Hogskola

Partial evaluation is becoming very promising as a programming tool, as its practice is now well developed. But the theorical foundation are not equally well understood. In this paper, we report on...

The Relevance of Proof-Irrelevance A Meta-Theoretical Study of Generalised Calculi of Constructions (2007)

Gilles Barthe, Chalmers Tekniska Hogskola

Abstract. We propose a general technique, inspired from proof-irrelevance, to prove strong normalisation and consistency for extensions of the Calculus of Constructions. 1

The chemistry of plutonium solubility / (2004)

Nilsson, Hans., Chalmers Tekniska Hogskola.

Thesis (Ph. D.)--Chalmers University of Technology, 2004.

Computer modeling of HCCI combustion / (2004)

Ogink, Roy., Chalmers Tekniska Hogskola.

Thesis (Ph. D.)--Chalmers University of Technology, 2004.

Four proposals for enterprise modeling / (2004)

Eriksson, Darek M., Chalmers Tekniska Hogskola.

Thesis (Ph. D.)--Chalmers University of Technology, 2004.

Flow and mixing of pulp suspensions / (2004)

Pettersson, Johan., Chalmers Tekniska Hogskola.

Thesis (Ph. D.)--Chalmers University of Technology, 2003.

How to prove properties of recursively defined circuits using Stalmarck's method (1998)

Mary Sheeran, Arne Borälv, Chalmers Tekniska Hogskola

. We present a technique for proving properties of recursively defined circuits using Stalmarck's method. We consider instances of circuits defined according to a particular inductive scheme and...

Mixed Volumes and Slices of the Cube (1998)

R. Ehrenborg, M. Readdy, Chalmers Tekniska Hogskola

ent of the Eulerian numbers. The Minkowski sum of two subsets K and L of R is the set K+L=[x+y : x # K, y # L]. For * a real number, the dilation of K by * is the set * } K=[* } x: x#K]. A convex...

Experimental Validation of a Fault-Tolerant System Using Physical Fault Injection,” Licenciate of Eng (1996)

Peter Folkesson, Peter Folkesson, Chalmers Tekniska Hogskola

This thesis describes and compares three physical fault injection techniques—heavy-ion radiation, pin-level fault injection and electromagnetic interference—and their use in the validation of the...

Playing Nim on a simplicial complex (1996)

Richard Ehrenborg, Chalmers Tekniska Hogskola

We introduce a generalization of the classical game of Nim by placing the piles on the vertices of a simplicial complex and allowing a move to affect the piles on any set of vertices that forms a...

Playing Nim on a simplicial complex (1996)

Richard Ehrenborg, Einar Steingrimsson, Chalmers Tekniska Hogskola

We introduce a generalization of the classical game of Nim by placing the piles on the vertices of a simplicial complex and allowing a move to affect the piles on any set of vertices that forms a...

Experimental Validation of a Fault-Tolerant System Using Physical Fault Injection,” Licenciate of Eng (1996)

Peter Folkesson, Peter Folkesson, Chalmers Tekniska Hogskola

This thesis describes and compares three physical fault injection techniques—heavy-ion radiation, pin-level fault injection and electromagnetic interference—and their use in the validation of the...

Multi-rate performance in DS/CDMA systems (1995)

Tony Ottosson, Arne Svensson, Chalmers Tekniska Hogskola

Different modulation schemes supporting multiple data rates in a Direct Sequence Code Division Multiple Access (DS/CDMA) system are studied. Both AWGN and multipath Rayleigh fading channels are...

Quadratic Convexity (1993)

Jörgen Boo, Chalmers Tekniska Hogskola

. We define quadratically convex sets in C n to be those, whose complement is a union of quadratic hypersurfaces. Some geometric properties of quadratically convex sets are investigated; in...

A Certain Loss of Identity (1992)

Geraint Jones, Mary Sheeran, Chalmers Tekniska Hogskola

For pragmatic reasons it is useful to exclude the identity relation from the `implementable subset' of Ruby. However there are many expressions in the relational calculus whose natural meaning...

A Loop-detecting Interpreter for Lazy, Higher-order Programs (1992)

John Hughes, Chalmers Tekniska Hogskola, Alex Ferguson

Interpreters that detect some forms of non-termination have a variety of applications, from abstract interpretation to partial evaluation. A simple and often used strategy is to test for a repeated...