Konferenzen  >  Informatik  >  Informationstheorie und Grundlagen der Informatik  >  Deutschland

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Automated synthesis of systems from specifications has been a longstanding goal of computer science. This problem has been studied by theoreticians and practitioners over decades as witnessed by an extensive and continued stream of articles related to synthesis in top-tier conferences in the field of formal methods. Despite a lot of recent progress, scalability in practical applications is still a concern. Recent advances in SAT/SMT solvers, decision tree learners, and other computational engines present an opportunity for a breakthrough in scalability. These advances have already led to powerful tools in the subarea of functional synthesis, which focuses on the synthesis of functions from relational specifications. However, much work is left to be done in order to translate these successes into scalable algorithms for more comprehensive synthesis problems, such as reactive synthesis, which aims at the automatic construction of circuits, embedded controllers, and other reactive software with complex temporal requirements. This Dagstuhl Seminar seeks to build on the recent momentum in these communities, and aims to bring together researchers in functional synthesis, reactive synthesis, and sister communities to chart the way forward. There are three broad objectives of the seminar.

Entwickler.de Akademie

Das DevOps Training für Kubernetes bietet einen praktischen und klar verständlichen Einstieg in die Open-Source-Technologie Kubernetes. Wer schon mit Docker arbeitet, wird auch Container orchestrieren – erlauben Orchestrierungslösungen doch die eigenen Container über mehrere Rechner hinweg hochverfügbar und skalierbar auszurollen und zu verwalten. Dazu gehört auch das Service Discovery (nicht nur für Microservices interessant) der Container, egal wo sie gestartet sind. Solch ein Orchestrierungsframework bietet die Konfiguration des Loadbalancers, die Möglichkeit sowohl die Rechner als auch die Container automatisch zu skalieren und vieles mehr. In diesem Intensivtraining steht Kubernetes im Mittelpunkt, denn schon jetzt kann man sagen, dass Kubernetes der Industriestandard für Orchestrierungsframeworks ist. Wo Docker Swarm Mode (behandelt im Docker Camp) nicht mehr ausreicht, findet das komplexere Kubernetes seine Verwendung. In diesem DevOps Training wird zunächst der Aufbau von Kubernetes erklärt, der Fokus liegt jedoch auf der praktischen Verwendung, dem Ausrollen von Containern in und mit Kubernetes. Dabei erhält jeder Teilnehmende Zugriff auf einen eigenen Kubernetescluster mit mindestens 3 Knoten.

DevOps Training, Kubernetes, Open-Source-Technologie, Docker, Container, Service Discovery, Loadbalancers

Softwareentwicklung,    Informatik Ausbildung, Lehrgänge

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

This Dagstuhl Seminar intends to foster discussion between researchers in computing education, builders of teaching support systems for formal foundations of computer science, as well as instructors of these foundations with the goal of facilitating more robust research and development of such systems.

Computergestütztes Lernen,    Didaktik in der Wissenschaft

Hausdorff Research Institute for Mathematics (HIM)

The trimester program aims to bring together experts, postdocs, and students in computer science and certain areas in mathematics (analysis, probability, and combinatorics) in order to learn about some challenging open problems recently raised in computer science, to use and invent necessary new tools and techniques in mathematics to solve these challenging problems, and vice versa to learn and further extend methods developed in computer science to develop new directions in mathematics motivated by questions in computer science. The core topics of the trimester program would be: learning theory, complexity of classical and quantum algorithms, vector valued functions on the hypercube, complex Hypercontractivity, polynomial inequalities on the hypercube, and discrete approximation theory on the hamming cube.

Analysis,    Kurse und Veranstaltungen für Studenten der Mathematik

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Computational Complexity is concerned with the resources that are required for algorithms to detect properties of combinatorial objects and structures. It has often proven true that the best way to argue about these combinatorial objects is by establishing a connection (perhaps approximate) to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic proof techniques.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

The problem of deciding whether a propositional formula is satisfiable (SAT) is one of the most fundamental problems in computer science, both theoretically and practically. Due to its practical implications, intensive research has been performed on how to solve SAT problems in an automated fashion, and SAT solving is now a ubiquitous tool to solve many hard problems, both from industry and mathematics. SAT is also increasingly being applied in logics that are not decidable, particularly in the context of first-order theorem proving. Here, fast SAT solvers are used for reasoning sub-tasks and for guiding the theorem provers. The main aim of this Dagstuhl Seminar is to bring together researchers from different areas of activity on SAT and researchers that work in the field of first-order theorem proving so that they can communicate state-of-the-art advances and embark on a systematic interaction that will enhance the synergy between the different areas.

Hausdorff Research Institute for Mathematics (HIM)

This workshop brings together leading experts in Boolean analysis, information theory, and lattices to explore the forefront of these disciplines through the talks and discussions about intriguing open problems, recent resolutions, and the evolution of innovative ideas, approaches, and techniques.

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Graphentheorie und Kombinatorik,    Statistik, Spieltheorie