- D-CON - lists.rwth-aachen.de

CFP Europe4an Symposium on Programming, 2012
by Helmut Seidl 30 Sep '11

30 Sep '11

CFP: European Symposium on Programming - ESOP 2012 2012, 24 March - 1 April. Tallinn, Estonia. http://www2.in.tum.de/esop2012/ ESOP is an annual conference devoted to fundamental issues in the specification, design, analysis, and implementation of programming languages and systems. ESOP 2012 is the twenty second edition in this series and seeks contributions on all aspects of programming language research including, but not limited to, the following areas: Programming paradigms and styles: functional programming, aspect-oriented programming, object-oriented programming, logic programming, constraint programming, extensible programming languages, domain-specific languages, biologically-inspired languages, synchronous and real-time programming languages. Methods and tools to write, reason about, and specify languages and programs: module systems, programming techniques, meta programming, type systems, logical foundations, denotational semantics, operational semantics, program verification, static analysis, testing, language-based security. Methods and tools for reasoning about programs: type systems, abstract interpretation, program verification, testing; Methods and tools for implementation: rewriting systems, program transformations, partial evaluation, experimental evaluations, virtual machines, intermediate languages, run-time environments. Concurrency and distribution: parallel programming, process algebras, concurrency theory, service-oriented computing, distributed and mobile languages. ESOP is a member conference of the European Joint Conferences on Theory and Practice of Software (ETAPS), which is the primary European forum for academic and industrial researchers working on topics relating to Software Science. ETAPS 2012 is the 15th joint conference in this series. Submission Guidelines Papers must be written in English, unpublished and not submitted for publication elsewhere. The proceedings will be published in the Springer-Verlag Lecture Notes in Computer Science series. Final papers will be in the format specified by Springer-Verlag in this page. Submissions must be in PDF format, formatted in the LNCS style and be at most 20 pages long. Additional material, that is not to be included in the final version, but may help assessing the merits of the submission - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices, and papers must be understandable without them. Papers can be sumitted via the following submission page: https://www.easychair.org/account/signin.cgi?conf=esop2012 Important Dates Important Dates 7 October 2011 (23:59 Apria, Samoa time): Submission deadline for abstracts (strict) 14 October 2011 (23:59 Apia, Samoa time): Submission deadline for full papers (strict) 6/7 December 2011: Rebuttal phase 16 December 2011: Notification of acceptance 6 January 2012: Camera-ready versions due 24 March - 1 April, 2012: Conference The submission deadline for papers is strict (site will close at 23:59 Samoan time). Submission of an abstract implies no obligation to submit a full version; abstracts with no corresponding full versions by the full paper deadline will be considered as withdrawn. Invited Speaker Bjarne Stroustroup, Texas A&M Univ (USA) Programme Committee Chair: Helmut Seidl, TU München (Germany) Andreas Abel (Ludwig Maximilian Univ. of München, Germany) Chandra Boyapati (Univ. of Michigan, USA) Witold Charatonik (Wroclaw Univ., Poland) Kostas Chatzikokolakis (Ecole Polytechnique, CNRS, France) Dave Clarke (Catholic Univ. of Leuven, Belgium) Philippa Gardner (Imperial College, UK) Sebastian Hack (Univ. of Saarland, Germany) Suresh Jagannathan (Purdue Univ., USA) Somesh Jha (Univ. of Wisconsin, USA) Patrick Lam (Univ. of Waterloo, Canada) Isabella Mastroeni (Univ. of Verona, Italy) Matthew Might (Univ. of Utah, USA) David Monniaux (Verimag, France) Anders Møller (Univ. of Aarhus, Denmark) Flemming Nielson (Technical Univ. of Denmark) German Puebla (Polytechn. Univ. of Madrid, Spain) Sylvie Putot (CEA, France) Sriram Rajamani (Microsoft Research, India) Noam Rinetzky (Queen Mary, Univ. of London, USA) Xavier Rival (ENS, France) Christian Schallhart (Univ. of Oxford, UK) David A. Schmidt (Kansas State Univ., USA) Harald Sondergaard (Univ. of Melbourne, Australia) Ian Stark (Univ. of Edinburgh, UK) Elena Zucca (Univ. of Genova, Italy) Best wishes, Helmut Seidl

1 0

TACAS 2012 Call for Papers
by Cormac Flanagan 07 Sep '11

07 Sep '11

TACAS 2012: 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems http://www.etaps.org/2012/tacas TACAS is a forum for researchers, developers and users interested in rigorously based tools and algorithms for the construction and analysis of systems. The conference serves to bridge the gaps between different communities that share common interests in, and techniques for, tool development and its algorithmic foundations. The research areas covered by such communities include but are not limited to formal methods, software and hardware verification, static analysis, programming languages, software engineering, real-time systems, communications protocols, and biological systems. The TACAS forum provides a venue for such communities at which common problems, heuristics, algorithms, data structures and methodologies can be discussed and explored. In doing so, TACAS aims to support researchers in their quest to improve the utility, reliability, flexibility and efficiency of tools and algorithms for building systems. Tool descriptions and case studies with a conceptual message, as well as theoretical papers with clear relevance for tool construction are all encouraged. The specific topics covered by the conference include, but are not limited to, the following: Specification and verification techniques for finite and infinite-state systems; Software and hardware verification; Theorem-proving and model-checking; System construction and transformation techniques, Static and run-time analysis; Abstraction techniques for modeling and validation; Compositional and refinement-based methodologies; Testing and test-case generation; Analytical techniques for safety, security, or dependability; Analytical techniques for real-time, hybrid, or stochastic systems; Integration of formal methods and static analysis in high-level hardware design or software environments; Tool environments and tool architectures; SAT and SMT solvers; Applications and case studies. Competition on Software Verification ------------------------------------ Associated with TACAS '12 there will be a competition on software verification. TACAS '12 hosts the first such competition event with the goal to evaluate the technology transfer and compare state-of-the-art software verifiers with respect to effectiveness and efficiency. The competition is performed and presented by the TACAS Competition Chair Dirk Beyer. Successful competition candidates are granted a demonstration slot for their tool in the TACAS program, and their contribution paper will be included in the TACAS conference proceedings. Important dates and submission See the common call for papers of ETAPS 2012 at http://www.etaps.org/2012/call-for-papers. Submit your paper via the TACAS 2012 author interface of Easychair. Submission guidelines --------------------- TACAS will accept the following kinds of submissions: * Research papers cover one or more of the topics above, including tool development and case studies from a perspective of scientific research. They have a maximum of 15 pages. * Case study papers report on case studies (preferably in a "real life" setting) are also welcome. They should focus on providing sufficiently detailed information about the following aspects: the system being studied and why it is of interest, the goals of the study, the challenges the system poses to automated analysis, research methodologies and the approach used, the degree to which goals were attained, and how the results can be generalized to other problems and domains. Case study papers have a maximum of 15 pages. * Regular tool papers present a new tool, a new tool component, or novel extensions to an existing tool. They focus primarily on engineering aspects, with special emphasis on important design and implementation concerns. A thorough discussion of theoretical foundations is not required, although the paper should provide with a summary of such, with relevant citations. A tool paper should describe the tool's software architecture and core data structures and algorithms, and also give a clear account of its functionality. The paper should discuss the tool's practical capabilities with reference to the type and size of problems it can handle, and experience with realistic case studies. Papers that present extensions to existing tools should clearly focus on the improvements or extensions with respect to previously published versions of the tool, preferably substantiated by data on enhancements in terms of resources and capabilities. Tool papers are evaluated by the TACAS Tool Chair with the help of the Programme Committee. Tool papers have a maximum of 15 pages. * Tool demonstration papers present tools based on aforementioned technologies (e.g., theorem-proving, model-checking, static analysis, or other formal methods) or falling into relevant application areas (e.g., system construction and transformation, testing, analysis of real-time, hybrid or biological systems, etc.) and focus on the usage aspects of the tool. Tool demonstration papers are evaluated by the TACAS Tool Chair with the help of the Programme Committee. Tools presented in tool demonstration papers must be publicly available. Tool demo papers have a maximum of 6 pages. Submitted papers in all categories must: * be in English, * present original research which is unpublished and not submitted elsewhere (conferences or journals) - in particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden, * use the Springer LNCS style, * fit within the page limit, including figures and bibliography (papers may include an optional appendix containing ancillary material such as proofs, but TACAS referees are at liberty to ignore appendices, and * be submitted electronically in pdf via the TACAS 2012 Easychair author interface. Invited speaker --------------- Holger Hermanns (Univ. of Saarland, Germany) Programme chairs ---------------- Cormac Flanagan (Univ. of California at Santa Cruz, USA) Barbara König (Univ. of Duisburg-Essen,Germany) Programme committee ------------------- Rajeev Alur (Univ. of Pennsylvania, USA) Armin Biere ( Johannes Kepler Univ., Austria) Alessandro Cimatti (FBK-irst, Italy) (Tool chair) Rance Cleaveland (Univ. of Maryland and Fraunhofer USA, USA) Giorgio Delzanno (Univ. of Genova, Italy) Javier Esparza (Techn. Univ. of Munich, Germany) Patrice Godefroid (Microsoft Research, Redmond, USA) Susanne Graf (Verimag, France) Orna Grumberg (Technion, Israel) Aarti Gupta (NEC Labs, USA) Michael Huth (Imperial College London, UK) Ranjit Jhala (Univ. of California at San Diego, USA) Vineet Kahlon (Univ. of Texas at Austin, USA) Daniel Kroening (Univ. of Oxford, UK) Marta Kwiatkowska (Univ. of Oxford, UK) Kim G. Larsen (Aalborg Univ., Denmark) Rustan Leino (Microsoft Research, Redmond, USA) Matteo Maffei (Univ. of Saarland, Germany) Ken McMillan (Cadence Berkeley Labs, USA) Doron Peled (Bar Ilan University, Israel) Anna Philippou (Univ. of Cyprus) Arend Rensink (Univ. of Twente, Netherlands) Andrey Rybalchenko (Techn. Univ. of Munich, Germany) Stefan Schwoon (ENS Cachan, France) Bernhard Steffen (Techn. Univ. of Dortmund, Germany) Serdar Tasiran (Koc University, Turkey) Lenore Zuck (Univ. of Illinois at Chicago, USA)

1 0

D-CON 2012 am 08. und 09. März 2012 in Kaiserslautern
by Roland Meyer 15 Aug '11

15 Aug '11

Liebe Kollegen, vielen Dank für die rege Teilnahme am D-CON-Doodle, die Abstimmung ergibt einen fast eindeutigen Termin. Die D-CON wird am 08. und 09. März 2012 an der TU Kaiserslautern (Gottlieb-Daimler Straße) stattfinden. Wie auch im letzten Jahr möchten wir schon am Donnerstagmorgen starten, bitte plant ggf. eine Anreise am Vortag ein. Der Workshop wird am frühen Freitagnachmittag enden. Für die nähere Planung melden wir uns zu einem späteren Zeitpunkt noch einmal bei Euch. Beste Grüße und einen schönen Abend Roland -- Roland Meyer University of Kaiserslautern Concurrency Theory Group Office: 34/428 Phone: +49 (0)631 205 26 34 Fax: +49 (0)631 205 34 20 Web: http://concurrency.cs.uni-kl.de

1 0

Terminfindung D-CON 2012 in Kaiserslautern
by Roland Meyer 22 Jul '11

22 Jul '11

Liebe Kollegen, wie beim Treffen in Münster besprochen, werden wir die nächste D-CON in Kaiserslautern ausrichten. Der Workshop soll wieder zwei Tage dauern und in der vorlesungsfreien Zeit des Wintersemesters (aber noch vor den ETAPS- Konferenzen vom 24. März bis zum 01. April 2012) stattfinden. Um einen geeigneten Termin zu finden, haben wir unter http://www.doodle.com/vf8tnhbzrvfxv39g eine Doodle-Umfrage erstellt. Bitte tragt dort bis zum 08. August die für Euch passenden Zeiten ein. Wir legen dann einen Termin fest und melden uns wieder bei Euch. Wir freuen uns auf Euren Besuch in Kaiserslautern! Beste Grüße und ein schönes Wochenende Roland -- Roland Meyer University of Kaiserslautern Concurrency Theory Group Office: 34/428 Phone: +49 (0)631 205 26 34 Fax: +49 (0)631 205 34 20 Web: http://concurrency.cs.uni-kl.de

1 0

PhD Fellowships in "Program and Model Analysis"
by Helmut Seidl 18 Jun '11

18 Jun '11

PhD Fellowships in the Doctorate Programme: ``Program and Model Analysis'' http://puma.in.tum.de The German Research Council (DFG) funds 12 doctoral fellowships through the new Doctorate Programme (Graduiertenkolleg) ``Program and Model Analysis''. The programme has started in July 2008. Applications for up to 5 positions welcome. Hosting institutions. The programme is hosted by the Technische Universität and Ludwig-Maximilians-Universität München, two of the three universities selected in the first round of the highly competitive Excellence Initiative. Their Computer Science departments are among the oldest and most reputed in Germany. The Professors involved in the programme are: Manfred Broy, Javier Esparza, Martin Hofmann, Alois Knoll, Tobias Nipkow, Andrey Rybalchenko, Helmut Seidl and Martin Wirsing. Objective. The programme will help PhD students to conduct excellent research on methods, algorithms and tools for the analysis of programs and models of information systems. The research topics seek to establish and exploit links between the four leading approaches for this task (theorem proving, model checking, abstract interpretation and type systems) and to apply them to software-intensive systems. PhD students will get excellent supervision, and will participate in a structured programme of courses and seminars offered by world experts. Positions. The doctorate programme offers doctoral fellowships for a period of three years. Retribution is according to Level 13 of the TV-L German salary scale. This amounts to an initial gross salary of 3100 Euro per month, increased to 3450 Euro per month after one year. Doctoral degrees are awarded by the Technische Universität or the Ludwig-Maximilians-Universität. Possible starting dates are negotiable.ligibility. Eligibility. Applicants should be at most 28 years old and hold a MSc (or an equivalent degree) in computer science or related disciplines (typically mathematics, physics, or engineering). Applications from MSc candidates who expect to get their degrees within the next months are also welcome. Fluency in spoken and written English or German is required. Applications. Applications will be considered until all positions are filled. They should contain a full curriculum vitae, a statement on the candidate's scientific interests, names and contact information of 2 references, and should be sent to Graduiertenkolleg PUMA, c/o. Prof. Dr. Helmut Seidl Technische Universität München Institut für Informatik, Boltzmannstraße 3 85748 Garching Email: puma(a)in.tum.de Shortlisted applicants will usually be invited to visit München and give a talk on their Master's Thesis or on a scientific topic to be agreed upon. The decision on admission will be communicated shortly after the talk.

1 0

First Call for Participation CONCUR/QEST/TGC 2011
by Joost-Pieter Katoen 17 Jun '11

17 Jun '11

[We apologise for multiple copies.] ================================================================== AACHEN CONCURRENCY AND DEPENDABILITY WEEK CONCUR: 22th Int. Conference on Concurrency Theory QEST: 8th Int. Conference on Quantitative Evaluation of SysTems TGC: 6th Int. Symposium on Trustworthy Global Computing 6 Tutorials + 9 Workshops September 5 - September 10, 2011 Aachen, Germany http://concur2011.rwth-aachen.de First CALL FOR PARTICIPATION Early Registration Opened! ================================================================== ----------------------------------------------------------------------- -- REGISTRATION -- ----------------------------------------------------------------------- Online registration: http://concur2011.rwth-aachen.de/registration Early registration deadline: July 31; Late registration deadline: August 25. ----------------------------------------------------------------------- -- CONCUR/QEST 2011 INVITED SPEAKERS -- ----------------------------------------------------------------------- Parosh Aziz Abdulla (Uppsala University, Sweden) Wil van der Aalst (Technical University Eindhoven, The Netherlands) Ursula Goltz (Technical University Braunschweig, Germany) Rachid Guerraoui (EPFL Lausanne, Switzerland) Geoffrey Smith (Florida International University, USA) Lothar Thiele (ETH Zurich, Switzerland) ----------------------------------------------------------------------- -- QEST 2011 TUTORIAL SPEAKERS -- ----------------------------------------------------------------------- Peter Buchholz (University of Dortmund, Germany) Krishnendu Chatterjee (IST Austria, Vienna, Austria) Kousha Etessami (LFCS University of Edinburgh, UK) Boris Köpf (IMDEA Software, Madrid, Spain) Aad van Moorsel (Newcastle University, UK) Verena Wolf (Saarland University, Germany) ----------------------------------------------------------------------- -- Host City: Aachen, Germany -- ----------------------------------------------------------------------- Aachen is Germany’s most westerly city and is situated directly on the border with Belgium and the Netherlands. It was a royal residence of the emperor Charlemagne, and it served as the principal coronation site of Holy Roman emperors and of German kings from the Middle Ages to the Reformation. The Aachen Cathedral is a UNESCO World Heritage site since 1978. The city has a flair and atmosphere of its own. The attractive layout of the old city center, the important historic monuments, the wells and baths over the hottest natural springs in Europe, the cultural diversity and quality and the many recreational and leisure activities make Aachen an exciting and pleasant place to visit and host a conference. Aachen is conveniently located in an extensive highway network with regard to transport facilities in the direction of Brussels, Paris and Antwerp. The international airports in Frankfurt, Cologne/Bonn, Düsseldorf, Brussels, Eindhoven and Maastricht-Aachen (NL) together with the international railway network ensure a good connectivity. Every two hours, the high-speed train Thalys operates via Aachen between Paris and Cologne and ICE trains run from Frankfurt to Brussels via Aachen. The AACHEN CONCURRENCY AND DEPENDABILITY WEEK is organized by the Software Modeling and Verification Group, Dept. of Computer Science, RWTH Aachen University and will take place in the Super C building in the centre of the town. ----------------------------------------------------------------------- -- Affiliated Workshops -- ----------------------------------------------------------------------- COMPMOD Computational Models for Cell Processes EXPRESS Expressiveness in Concurrency FOCLASA Foundations of Coordination Languages and Software Architectures GASICS Games for Design, Verification and Synthesis LAM Logics, Agents, and Mobility MLQA Models and Logics for Quantitative Analysis SECCO Security Issues in Concurrency SOS Structural Operational Semantics YR-CONCUR Young Researchers on Concurrency Theory ----------------------------------------------------------------------- -- Organization -- ----------------------------------------------------------------------- General Chair: Joost-Pieter Katoen (RWTH Aachen University, Germany) CONCUR PC Chairs: Joost-Pieter Katoen (RWTH Aachen University, Germany) Barbara König (University of Duisburg-Essen, Germany) QEST PC Chairs: Catuscia Palamidessi (INRIA and Ecole Polytechnique, France) Alma Riska (EMC Corporation, USA) TGC PC Chairs: Roberto Bruni (University of Pisa, Italy) Vladimiro Sassone (University of Southhampton, UK) ----------------------------------------------------------------------- -- Contact -- ----------------------------------------------------------------------- See http://concur2011.rwth-aachen.de For further questions, please contact acdw2011(a)cs.rwth-aachen.de

1 0

Postdoc position in Formal Methods at the University of Bamberg, Germany
by Gerald Lüttgen 22 Mar '11

22 Mar '11

The Software Technologies Research Group ("Lehrstuhl Softwaretechnik und Programmiersprachen") at the University of Bamberg is offering a Postdoc position in Formal Methods. Applicants should have (or shortly expect to receive) a PhD in Computer Science or a closely related field. A strong background in Theoretical Computer Science is expected, and preferrably knowledge in Concurrency Theory and/or Automated Verification. Familiarity with the German language is not required. The position is full-time, initially for one year but likely extensible for up to six years. It is available from the end of April and is paid according to the TV-L scale in Germany, on spine point E13 (starting at approx. 38,000 Euro per year), with teaching duties of 5 hours per week during the semester. Bamberg is a medium-sized city in northern Bavaria, located not far from Nuremberg on the fast train line between Munich and Berlin. Its old part of town is one of the UN World Heritage Sites, and its university has just over 10,000 students. Living costs are very moderate. The research group consists of four researchers who are currently focussing on theories of specification formalisms mixing state machines and temporal logic, and on (parallel) algorithms for state-based software verification. For more details, please feel free to contact: Prof. Dr. Gerald Luettgen Software Technologies Research Group Faculty of Information Systems and Applied Computer Sciences The University of Bamberg, 96045 Bamberg, Germany Email: gerald.luettgen {at} uni-bamberg {dot} de Web: http://www.swt-bamberg.de/ Tel.: +49 951 863-3850 / Fax: +49 951 863-3855

1 0

DCON 2011: Protokoll Business Meeting
by Markus Mueller-Olm 08 Mar '11

08 Mar '11

Liebe Freunde und Kollegen, ich möchte mich noch einmal bei allen für die engagierte Teilnahme am DCON-Treffen in Münster bedanken. Ich hoffe, alle sind wieder wohlbehalten zu Hause angekommen! Unten findet Ihr ein kurzes Protokoll des Business-Meetings am 4.3.2011. Viele Grüße, Markus ----------------------------------------------------------------------- DCON 2012 ========= DCON 2012 wird von Roland Meyer und seiner Gruppe in Kaiserslautern organisiert. Format ====== Das Format von DCON hat sich im Wesentlichen bewährt. Es gibt aber folgende Anregungen: - 45 Minuten als Slots für die Vorträge war z.T. eher knapp. Die Slots sollen also nicht weiter verkürzt werden. (Ergänzung MMO: Ich denke, wenn man 45-Minutenslots vorsieht, sollte man auch wieder Pausenzeit nach den Slots als Puffer und für Diskussionen direkt nach dem Vortrag einplanen.) - Bei drei parallelen Vorträgen besteht prinzipiell die Gefahr, dass einzelne Vorträge wenig Hörer haben. Dies war aber beim Treffen in Münster kein Problem. - Ein eingeladener Vortrag statt zwei wäre genug. - Das DCON-Treffen könnte am zweiten Tag auch noch in den Nachmittag hinein verlängert werden. Scope/Teilnehmerkreis ===================== Es wird diskutiert, ob das DCON-Treffen thematisch in Richtung CAV erweitert werden soll. Dazu gibt es derzeit aber keine Veranlassung. Sprache ======= In Zukunft soll potentiellen Teilnehmern ohne ausreichende Deutschkenntnisse vor dem Treffen ermöglicht werden, einzuschätzen, ob eine Teilnahme sich lohnen wird. Dazu soll beim nächsten Mal wie folgt vorgegangen werden: - Abstracts und Folien sollten auf Englisch sein. - Jeder gibt bei den Abstracts mit an, ob der Vortrag ggf. auch auf Englisch angeboten wird. - Es sollte schon vor dem Treffen bekannt gemacht werden (z.B. im Rahmen der DOODLE-Umfrage), welche Teilnehmer keine ausreichenden Deutschkenntnisse haben, um den Vortragenden zu ermöglichen einzuschätzen, ob der Vortrag auf Englisch oder Deutsch gehalten werden sollte. - Auch nach Englischsprachigen Vorträgen kann die Diskussion auf Deutsch sein. Mailingliste ============ Jeder Interessierte kann sich selbst in die DCON-Mailingliste eintragen: https://mailman.rwth-aachen.de/mailman/listinfo/d-con Concurrency-Lehre ================= Ulla Goltz bericht über den Stand der Arbeit (zusammen mit Barbara, Uwe und Thomas (Noll)) an einem Manifest über Concurrencytheorie in der Lehre. Der Entwurf soll zu gegebener Zeit herumgeschickt werden. Ein SAP-Mitarbeiter konnte als Mitautor gewonnen werden. Eventuell kann Alexander Herz aus der Gruppe von Helmut Seidl einen Kontakt zu einem weiteren potentiellen Mitautor aus der Industrie vermitteln. GI-Arbeitskreis =============== Michael Mendler berichtet über die Struktur der GI. Es wird diskutiert wie "Concurrency-Theorie" dort eingegliedert werden könnte. Es besteht derzeit (im Kreis des DCON-Business-Meetings) keine ausreichende Unterstützung dafür, einen GI-Arbeitskreis zu gründen. -- Prof. Dr. Markus Müller-Olm Westfälische Wilhelms-Universität Münster Institut für Informatik, FB 10 Einsteinstraße 62, D-48149 Münster, Germany Phone: ++49-251-83-33765 Fax: ++49-251-83-33755 E-mail: mmo(a)math.uni-muenster.de

1 0

DCON 2011: Praktische Informationen
by Markus Mueller-Olm 28 Feb '11

28 Feb '11

Liebe Freunde und Kollegen, wir freuen uns, Euch in Kürze hier in Münster beim DCON-Treffen begrüßen zu können. Hier noch einige praktische Informationen. Für Mittwoch abend (2.3.2011) haben wir ab 19:30 Uhr einen Tisch bestellt im "Weinkeller" des Mocca d'or, Rothenburg 14-16, 48143 Münster Der Eingang des Mocca d'or liegt etwas versteckt, es gibt aber an der Strasse ein Hinweisschild. Das Treffen selbst findet statt im Alexander-von-Humboldt-Haus, Hüfferstrasse 61, 48149 Münster und beginnt am Donnerstag, 3.3.2011, um 9:00 Uhr. Die Registrierung ist ab 8:30 Uhr. Wie in der Einladungsmail von Anfang Januar schon geschrieben, ist das Alexander-von-Humboldt-Haus von den vorgeschlagenen Hotels zu Fuß in etwa 15-20 Minuten zu erreichen. Vom Stadthotel und vom Centralhotel gibt es auch eine Busverbindung (Linien 11, 12, 13, 22 von der Haltestelle Aegidiimarkt zur Haltestelle Jungeblodtplatz; Fahrzeit ca. 5 Min; Fahrplanauskunft: http://www.stadtwerke-muenster.de/fahrgaeste.html). Viele Grüße, Markus Müller-Olm -- Prof. Dr. Markus Müller-Olm Westfälische Wilhelms-Universität Münster Institut für Informatik, FB 10 Einsteinstraße 62, D-48149 Münster, Germany Phone: ++49-251-83-33765 Fax: ++49-251-83-33755 E-mail: mmo(a)math.uni-muenster.de

1 0

DCON 2011: Programmentwurf
by Markus Mueller-Olm 17 Feb '11

17 Feb '11

Liebe Freunde und Kollegen, auf Grundlage der Ergebnisse der DOODLE-Umfrage haben wir jetzt einen Entwurf für das Programm von DCON 2011 in MÜnster erarbeitet. Da es diesmal recht viele Themenvorschläge gibt, habe wir die Dauer für die Themensitzungen auf 45 Minuten verkürzt und die Themen geeignet parallelisiert. Den Programmentwurf findet ihr unter: http://cs.uni-muenster.de/sev/dcon11/programmentwurf.pdf Viele Grüße, Markus Müller-Olm und Alexander Wenner -- Prof. Dr. Markus Müller-Olm Westfälische Wilhelms-Universität Münster Institut für Informatik, FB 10 Einsteinstraße 62, D-48149 Münster, Germany Phone: ++49-251-83-33765 Fax: ++49-251-83-33755 E-mail: mmo(a)math.uni-muenster.de

2 1