Non-Strict Independence-Based Program Parallelization Using Sharing and Freeness Information.

The current ubiquity of multi-core processors has brought renewed interest in program parallelization. Logic programs allow studying the parallelization of programs with complex, dynamic data structures with (declarative) pointers in a comparatively simple semantic setting. In this context, automatic parallelizers which exploit and-parallelism rely on notions of independence in order to ensure certain efficiency properties. “Non-strict” independence is a more relaxed notion than the traditional notion of “strict” independence which still ensures the relevant efficiency properties and can allow considerable more parallelism. Non-strict independence cannot be determined solely at run-time (“a priori”) and thus global analysis is a requirement. However, extracting non-strict independence information from available analyses and domains is non-trivial. This paper provides on one hand an extended presentation of our classic techniques for compile-time detection of non-strict independence based on extracting information from (abstract interpretation-based) analyses using the now well understood and popular Sharing + Freeness domain. This includes algorithms for combined compile-time/run-time detection which involve special run-time checks for this type of parallelism. In addition, we propose herein novel annotation (parallelization) algorithms, URLP and CRLP, which are specially suited to non-strict independence. We also propose new ways of using the Sharing + Freeness information to optimize how the run-time environments of goals are kept apart during parallel execution. Finally, we also describe the implementation of these techniques in our parallelizing compiler and recall some early performance results. We provide as well an extended description of our pictorial representation of sharing and freeness information

Transfinite Extension of the Mu-Calculus

In [1] Bradfield found a link between finite differences formed by Sigma(2)(0) sets and the mu-arithmetic introduced by Lubarski [7]. We extend this approach into the transfinite: in allowing countable disjunctions we show that this kind of extended mu-calculus matches neatly to the transfinite difference hierarchy of E-2(0) sets. The difference hierarchy is intimately related to parity games. When passing to infinitely many priorities, it might not longer be true that there is a positional winning strategy. However, if such games are derived from the difference hierarchy, this property still holds true

Complex and Adaptive Dynamical Systems: A Primer

An thorough introduction is given at an introductory level to the field of quantitative complex system science, with special emphasis on emergence in dynamical systems based on network topologies. Subjects treated include graph theory and small-world networks, a generic introduction to the concepts of dynamical system theory, random Boolean networks, cellular automata and self-organized criticality, the statistical modeling of Darwinian evolution, synchronization phenomena and an introduction to the theory of cognitive systems. It inludes chapter on Graph Theory and Small-World Networks, Chaos, Bifurcations and Diffusion, Complexity and Information Theory, Random Boolean Networks, Cellular Automata and Self-Organized Criticality, Darwinian evolution, Hypercycles and Game Theory, Synchronization Phenomena and Elements of Cognitive System Theory.Comment: unformatted version of the textbook; published in Springer, Complexity Series (2008, second edition 2010

Heterotic target space dualities with line bundle cohomology

Die vorliegende Dissertation befasst sich mit verschiedenen Aspekten und Techniken zur Konstruktion von String-Modellen. In diesem Kontext ist es nötig die Topologie von Calabi-Yau Mannigfaltigkeiten zu verstehen, da diese ausschlaggebend für die Nullmodenstruktur des entsprechenden Differenzialoperators und damit für das Teilchenspektrum der kompaktifizierten Niederenergietheorie ist. Für diejenigen Calabi-Yau Räume, die als Unterräume torischer Varietäten definiert werden, sind alle topologischen Größen in der Kohomololgie von Linienbündeln über der entsprechenden torischen Varietät verschlüsselt. Aus diesem Grund umfasst ein Teil dieser Dissertation die Entwicklung eines effizienten Algorithmus’ für ihre Berechnung. Nach der mathematischen Vorbereitung widmen wir uns der Herleitung und dem Beweis des auf diese Weise entstandenen mathematischen Theorems. Wir untersuchen zudem eine Verallgemeinerung auf Räume, die durch das Herausteilen einer Zn-Symmetrie konstruiert werden. Anschließend demonstrieren wir die zahlreichen Anwendungen dieser Methoden zur Konstruktion von String-Modellen. Außerdem finden wir einen Zusammenhang zwischen Kohomologiegruppen von Linienbündeln und getwisteten Sektoren von Landau-Ginzburg Modellen. Als nächstes nutzen wir die entwickelten Methoden um so genannte Zielraum Dualitäten zwischen heterotischen Modellen zu untersuchen. Diese Modelle weisen eine asymmetrische (0,2)-Weltflächensupersymmetrie auf und können über geeichte lineare Sigma-Modelle formuliert werden, in welchen sie eine Phasenstruktur ausbilden. Es lässt sich nun zeigen, dass die Phasenräume verschiedener physikalischer Modelle durch nicht-geometrische Phasen miteinander verbunden sind, was eine hochgradig nicht-triviale Dualität der entsprechenden Geometrien implizieren könnte. Unser Beitrag ist nun die Untersuchung der hierdurch verbundenen und daher potentiell dualen Modelle. Wir entwickeln ein Verfahren, welches die Konstruktion aller dualer Modelle zu einem beliebigen (0,2) Modell erlaubt und finden Evidenz dafür, dass es sich hierbei um eine echte Dualität und nicht bloß um einen Übergang verschiedener physikalischer Modelle ineinander handelt. In diesem Kontext untersuchen wir verschiedenste Szenarien, u.A. Modelle mit den Eichgruppen E6, SO(10) und SU(5), sowie mit Kompaktifizierungsräumen der Kodimension eins und zwei. In einer Untersuchung der Stringlandschaft werden dazu über 80.000 Räume auf diese Dualität untersucht

Domain walls of gauged supergravity, M-branes, and algebraic curves

We provide an algebraic classification of all supersymmetric domain wall solutions of maximal gauged supergravity in four and seven dimensions, in the presence of non-trivial scalar fields in the coset SL(8,R)/SO(8) and SL(5,R)/SO(5) respectively. These solutions satisfy first-order equations, which can be obtained using the method of Bogomol'nyi. From an eleven-dimensional point of view they correspond to various continuous distributions of M2- and M5-branes. The Christoffel-Schwarz transformation and the uniformization of the associated algebraic curves are used in order to determine the Schrodinger potential for the scalar and graviton fluctuations on the corresponding backgrounds. In many cases we explicitly solve the Schrodinger problem by employing techniques of supersymmetric quantum mechanics. The analysis is parallel to the construction of domain walls of five-dimensional gauged supergravity, with scalar fields in the coset SL(6,R)/SO(6), using algebraic curves or continuous distributions of D3-branes in ten dimensions. In seven dimensions, in particular, our classification of domain walls is complete for the full scalar sector of gauged supergravity. We also discuss some general aspects of D-dimensional gravity coupled to scalar fields in the coset SL(N,R)/SO(N).Comment: 46 pages, latex. v2: typos corrected and some references added. v3: minor corrections and improvements, references added, to appear in ATM

Programmiersprachen und Rechenkonzepte

Seit 1984 veranstaltet die GI-Fachgruppe "Programmiersprachen und Rechenkonzepte" regelmäßig im Frühjahr einen Workshop im Physikzentrum Bad Honnef. Das Treffen dient in erster Linie dem gegenseitigen Kennenlernen, dem Erfahrungsaustausch, der Diskussion und der Vertiefung gegenseitiger Kontakte. In diesem Forum werden Vorträge und Demonstrationen sowohl bereits abgeschlossener als auch noch laufender Arbeiten vorgestellt, unter anderem (aber nicht ausschließlich) zu Themen wie - Sprachen, Sprachparadigmen - Korrektheit von Entwurf und Implementierung - Werkzeuge - Software-/Hardware-Architekturen - Spezifikation, Entwurf - Validierung, Verifikation - Implementierung, Integration - Sicherheit (Safety und Security) - eingebettete Systeme - hardware-nahe Programmierung. In diesem Technischen Bericht sind einige der präsentierten Arbeiten zusammen gestellt

Components as coalgebras

In the tradition of mathematical modelling in physics and chemistry, constructive formal specification methods are based on the notion of a software model, understood as a state-based abstract machine which persists and evolves in time, according to a behavioural model capturing, for example, partiality or (different degrees of) nondeterminism. This can be identified with the more prosaic notion of a software component advocated by the software industry as ‘building block’ of large, often distributed, systems. Such a component typically encapsulates a number of services through a public interface which provides a limited access to a private state space, paying tribute to the nowadays widespread object-oriented programming principles. The tradition of communicating systems formal design, by contrast, has developed the notion of a process as an abstraction of the behavioural patterns of a computing system, deliberately ignoring the data and state aspects of software systems. Both processes and components are among the broad group of computing phenomena which are hardly definable (or simply not definable) algebraically, i.e., in terms of a complete set of constructors. Their semantics is essentially observational, in the sense that all that can be traced of their evolution is their interaction with the environment. Therefore, coalgebras, whose theory has recently witnessed remarkable developments, appear as a suitable modelling tool. The basic observation of category theory that universal constructions always come in pairs, has motivated research on the duality between algebras and coalgebras, which provides a bridge between models of static (constructive, data-oriented) and dynamical (observational, behaviour-oriented) systems. At the programming level, the intuitive symmetry between data and behaviour provides evidence of such a duality, in its canonical initial-final specialisation. This line of thought entails both definitional and proof principles, i.e., a basis for the development of program calculi directly based on (actually driven by) type specifications. Moreover, such properties can be expressed in terms of generic programming combinators which are used, not only to calculate programs, but also to program with. Framed in this context, this thesis addresses the following main themes: The investigation of a semantic model for (state-based) software components. These are regarded as concrete coalgebras for some Set endofunctors, with specified initial conditions, and organise themselves in a bicategorical setting. The model is able to capture both behavioural issues, which are usually left implicit in state-based specification methods, and interaction through structured data, which is usually a minor concern on process calculi. Two basic cases are considered entailing, respectively, a ‘functional’ and an ‘object-oriented’ shape for components. Both cases are parametrized by a model of behaviour, introduced as a strong (usually commutative) monad. The development of corresponding component calculi, also parametric on the behaviour model, which adds to the genericity of the approach. The study of processes and the ‘reconstruction’ of classical (CCS-like) process calculi on top of their representation as inhabitants of (the carriers of) final coalgebras, in an essentially pointfree, calculational style. An overall concern for genericity, in the sense that models and calculi for both components and processes are parametric on the behaviour model and the interaction discipline, respectively. The animation of both processes and components in CHARITY, a functional programming language entirely based on inductive and coinductive categorical data types. In particular this leads to the development of a process calculi interpreter parametric on the interaction discipline.PRAXIS XXI - Projecto LOGCAMP; POO11/IC-PME/II/S -Projecto KARMA; Fundação para a Ciência e Tecnologia; ALGORITMI Research Center