Accepted papers

Montre: A Tool for Monitoring Timed Regular ExpressionsDogan Ulus
Automated Recurrence Analysis for Almost-Linear Expected-Runtime BoundsKrishnendu ChatterjeeHongfei FuAniket Murhekar
A Storm is Coming: A Modern Probabilistic Model CheckerChristian DehnertSebastian JungesJoost-Pieter KatoenMatthias Volk
On Multiphase-Linear Ranking FunctionsAmir M. Ben-AmramSamir Genaim
Runtime Monitoring with Recovery of the SENT Communication ProtocolKonstantin SelyuninStefan JaksicThang NguyenChristian ReidlUdo HafnerEzio BartocciDejan NickovicRadu Grosu
BoSy: An experimentation framework for Bounded SynthesisPeter FaymonvilleBernd FinkbeinerLeander Tentrup
Non-polynomial Worst-case Analysis of Recursive ProgramsKrishnendu ChatterjeeHongfei FuAmir Kafshdar Goharshady
Proving linearizability using forward simulationsAhmed BouajjaniMichael EmmiConstantin EneaSuha Orhun Mutluergil
A Correct-by-Decision Solution for Simultaneous Place and RouteAlexander Nadel
Pithya: A Parallel Tool for Parameter Synthesis of Piecewise Multi-Affine Dynamical SystemsNikola BenešLuboš BrimMartin DemkoSamuel PastvaDavid Šafránek
MightyL: A Compositional Translation from MITL to Timed AutomataThomas BrihayeGilles GeeraertsHsi-Ming HoBenjamin Monmege
Markov Automata with Multiple ObjectivesTim QuatmannSebastian JungesJoost-Pieter Katoen
Quantitative Assume Guarantee SynthesisShaull AlmagorOrna KupfermanJan Oliver RingertYaron Velner
Automated Resource Analysis with Coq Proof ObjectsQuentin CarbonneauxJan HoffmannThomas RepsZhong Shao
Towards Verifying Nonlinear Integer ArithmeticVincent LiewPaul Beame
A Decidable Fragment in Separation Logic with Inductive Predicates and ArithmeticQuang Loc LeTatsuta MakotoJun SunWei-Ngan Chin
Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systemsMarie FortinAnca MuschollIgor Walukiewicz
Context-Sensitive Dynamic Partial Order ReductionElvira AlbertPuri ArenasMaria Garcia de la BandaMiguel Gomez-ZamalloaPeter Stuckey
Cutoff Bounds for Consensus AlgorithmsOgnjen MaricChristoph SprengerDavid Basin
Ensuring the Reliability of Your Model Checker: Interval Iteration for Markov Decision ProcessesChristel BaierJoachim KleinLinda LeuschnerDavid ParkerSascha Wunderlich
Efficient Parallel Strategy Improvement for Parity GamesJohn Fearnley
Syntax-Guided Optimal Synthesis for Chemical Reaction NetworksLuca CardelliMilan CeskaMartin FranzleMarta KwiatkowskaLuca LaurentiNicola PaolettiMax Whitby
Verified compilation of space-efficient reversible circuitsMatthew AmyMartin RoettelerKrysta Svore
Lightweight Concurrency Verification With ViewsMatthew WindsorMike DoddsMatthew J ParkinsonBen Simner
Synchronization Synthesis for Network ProgramsJedidiah McClurgHossein HojjatPavol Cerny
SMTCoq: A plug-in for integrating SMT solvers into CoqBurak EkiciAlain MebsoutCesare TinelliChantal KellerGuy KatzAndrew ReynoldsClark Barrett
STLInspector: STL Validation with GuaranteesHendrik RöhmThomas HeinzEva Charlotte Mayer
Lagrangian ReachabililtyJacek CyrankaMd Ariful IslamGreg ByrnePaul L. JonesScott A. SmolkaRadu Grosu
DryVR: Data-driven verification and compositional reasoning for automotive systemsChuchu FanBolun QiSayan MitraMahesh Viswanathan
GPUDrano: Detecting Uncoalesced Accesses in GPU ProgramsRajeev AlurJoseph DeviettiOmar Navarro LeijaNimit Singhania
Ascertaining Uncertainty for Efficient Exact Cache AnalysisClaire MaizaDavid MonniauxJan ReinekeValentin Touzeau
Simulation-Equivalent Reachability of Large Linear Systems with InputsStanley BakParasara Sridhar Duggirala
Classification and coverage-based falsification for embedded control systemsArvind S AdimoolamThao DangAlexandre DonzeJames KapinskiXiaoqing Jin
Program Repair under UncertaintyAws AlbarghouthiLoris D’AntoniSamuel Drews
Reluplex: An Efficient SMT Solver for Verifying Deep Neural NetworksGuy KatzClark BarrettDavid DillKyle JulianMykel Kochenderfer
EAHyper: Satisfiability, Implication, and Equivalence Checking of HyperpropertiesBernd FinkbeinerChristopher HahnMarvin Stenger
Compositional Model Checking with Incremental Counter-Example ConstructionAnton WijsThomas Neele
Scaling Up DPLL(T) String Solvers using Context-Dependent RewritingAndrew ReynoldsMaverick WooClark BarrettDavid BrumleyTianyi LiangCesare Tinelli
Look for the Proof to Find the Program: Decorated-Component-Based Program SynthesisAdria GasconAshish TiwariBrent CarmerUmang Mathur
Logic-based Clustering and Learning for Time-Series DataMarcell Vazquez-ChanlatteJyotirmoy DeshmukhXiaoqing JinSanjit A. Seshia
Abstract Interpretation with UnfoldingsMarcelo SousaCésar RodríguezVijay D’SilvaDaniel Kroening
On Expansion and Resolution in CEGAR based QBF solvingLeander Tentrup
Data-Driven Synthesis of Full Probabilistic ProgramsSarah ChasinsPhitchaya Mangpo Phothilimthana
Automating Induction for Solving Horn ClausesHiroshi UnnoSho ToriiHiroki Sakamoto
Runtime Verification of Temporal Properties over Out-of-order Data StreamsDavid BasinFelix KlaedtkeEugen Zalinescu
Verifying Equivalence of Spark ProgramsShelly GrossmanSara CohenShachar ItzhakyNoam RinetzkyMooly Sagiv
A Three-tier Strategy for Reasoning about Floating-Point Numbers in SMTSylvain ConchonMohamed IguernlalaKailiang JiGuillaume MelquiondClément Fumex
Minimization of Symbolic TransducersOlli SaarikiviMargus Veanes
Value Iteration for Long-run Average Reward in Markov Decision ProcessesPranav AshokKrishnendu ChatterjeePrzemyslaw DacaJan KřetínskýTobias Meggendorfer
Finding Fix Locations for CFL-Reachability Analyses via Minimum CutsAndrei Marian DanManu SridharanSatish ChandraJean-Baptiste JeanninMartin Vechev
Automated Formal Synthesis of Digital Controllers for State-Space Physical PlantsAlessandro AbateIury BessaDario CattaruzzaLucas CordeiroCristina DavidPascal KesseliDaniel KroeningElizabeth Polgreen
Network-wide Configuration SynthesisAhmed El-HassanyPetar TsankovLaurent VanbeverMartin Vechev
Electrical Bug Localization During Post-Silicon Validation Enabled by Formal MethodsEshan SinghClark BarrettSubhasish Mitra
Model Counting for Recursively-Defined StringsMinh-Thai TrinhDuc-Hiep ChuJoxan Jaffar
Learning a Static Analyzer from DataPavol BielikVeselin RaychevMartin Vechev
Synthesis with Abstract ExamplesDana Drachsler CohenSharon ShohamEran Yahav
Bounded Synthesis for Streett, Rabin, and CTL*Ayrat KhalimovRoderick Bloem

CAV 2017: Call for Papers

CAV 2017: 29th International Conference on Computer-Aided Verification

Important Dates

All deadlines are AOE (Anywhere on Earth).

Papers:

Paper submission: January 24, 2017 (Tuesday)
Author response period: March 20-22, 2017 (Monday – Wednesday)
Author notification: April 12, 2017 (Wednesday)
Final version: May 5, 2017 (Friday)

Conference:

Workshops July 22-23, 2017
Main conference July 24-28, 2017

Submission URL

http://cav2017.mpi-sws.org/

Scope

CAV 2017 is the 29th in a series dedicated to the advancement of the theory and practice of computer-aided formal analysis and synthesis methods for hardware and software systems.  CAV considers it vital to continue spurring advances in hardware and software verification while expanding to domains such as cyber-physical, social, and biological systems.  The conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical verification tools and the algorithms and techniques that are needed for their implementation. The proceedings of the conference will be published in the Springer LNCS series. A selection of papers will be invited to a special issue of Formal Methods in System Design and the Journal of the ACM.

Topics of interest include but are not limited to:

  • Algorithms and tools for verifying models and implementations
  • Algorithms and tools for system synthesis
  • Mathematical and logical foundations of verification and synthesis
  • Specifications and correctness criteria for programs and systems
  • Deductive verification using proof assistants
  • Hardware verification techniques
  • Program analysis and software verification
  • Software synthesis
  • Hybrid systems and embedded systems verification
  • Compositional and abstraction-based techniques for verification
  • Probabilistic and statistical approaches to verification
  • Verification methods for parallel and concurrent systems
  • Testing and run-time analysis based on verification technology
  • Decision procedures and solvers for verification and synthesis
  • Applications and case studies in verification and synthesis
  • Verification in industrial practice
  • New application areas for algorithmic verification and synthesis
  • Formal models and methods for security
  • Formal models and methods for biological systems

Paper Submission

NEW this year:

  1. There is no separate registration deadline. Full papers should be uploaded by the submission deadline.
  2. Tool papers require a concurrent artifact submission together with the paper submission. Artifact evaluation occurs concurrently with the review process and the PC gets access to the artifact evaluation during the PC discussions.

Submissions on a wide range of topics are sought, particularly ones that identify new research directions.  CAV 2017 is not limited to topics discussed in previous instances of the conference.  Authors concerned about the appropriateness of a topic may communicate with the conference chairs prior to submission.

As explained below, CAV 2017 will follow a lightweight double-blind review process.  Submissions that are not “blinded” will be rejected without review.  Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed.  The review process will include a feedback/rebuttal period where authors will have the option to respond to reviewer comments.  The PC chairs may solicit further reviews after the rebuttal period.

Papers must be submitted in PDF format here

Submissions will be in two categories: Regular Papers and Tool Papers.

Regular Papers

Regular Papers should not exceed 16 pages in LNCS format, not counting references and appendices.  Authors can include a clearly marked appendix at the end of their submissions, that is exempt from the page limit restrictions. However, the reviewers are not obliged to read the contents of these appendices.  These papers should contain original research and sufficient detail to assess the merits and relevance of the contribution.  Papers will be evaluated on basis of a combination of correctness, technical depth, significance, novelty, clarity, and elegance. We welcome papers on theory, case studies, and comparisons with existing experimental research, as well as combinations of new theory with experimental evaluation.  A strong theoretical paper is not required to have an experimental component.  On the other hand, strong papers reproducing and comparing existing results experimentally do not require new theoretical insights.

We encourage authors to provide any supplementary material that is required to support the claims made in the paper, such as detailed proofs or experimental data.  These materials should be uploaded at submission time, as a single pdf or a tarball, not via a URL.  It will be made available to reviewers only after they have submitted their first-draft reviews and hence need not be anonymized.  Reviewers are under no obligation to look at the supplementary material but may refer to it if they have questions about the material in the body of the paper.

Tool Papers

Tool Papers should not exceed 6 pages, not counting references.  These papers should describe system and implementation aspects of a tool with a large (potential) user base (experiments not required, rehash of theory strongly discouraged).  Papers describing tools that have already been presented (in any conference) will be accepted only if significant and clear enhancements to the tool are reported and implemented.  Note that tool papers require the submission of an artifact for evaluation by the submission deadline.  Artifacts will be evaluated concurrently with the review process and the program committee will have access to the artifact evaluation while making their decision.  In special cases, where an artifact cannot be submitted, the authors should contact the program chairs to find alternate modes of artifact evaluation.

Lightweight Double-Blind Reviewing Process

CAV 2017 will employ a lightweight double-blind reviewing process. This means that committee members will not have access to authors’ names or affiliations as they review a paper; however, authors’ names will be revealed once reviews have been submitted.

To facilitate this, submitted papers must adhere to two rules:
Author names and institutions must be omitted, and references to authors’ own related work should be in the third person (e.g., not “We build on our previous work…” but rather “We build on the work of …”).

The purpose of this process is to help the PC and external reviewers come to an initial judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try.  Nothing should be done in the name of anonymity that weakens the submission, makes the job of reviewing the paper more difficult, or interferes with the process of disseminating new ideas. For example, important background references should *not* be omitted or anonymized, even if they are written by the same authors and share common ideas, techniques, or infrastructure.  Authors should feel free to disseminate their ideas or draft versions of their paper as they normally would.  For instance, authors may post drafts of their papers on the web or give talks on their research ideas.

Artifact Submission and Evaluation

Authors of accepted regular papers will be invited to submit (but are not required to submit) the relevant artifact for evaluation by the artifact evaluation committee.

Authors of all tool papers are required to submit their artifact to the artifact evaluation committee at the paper submission time. Unlike regular papers, the results of the artifact evaluation for tool papers will be available to the program committee during the online discussions.

To submit an artifact, please prepare a virtual machine (VM) image of your artifact and keep it accessible through an HTTP link throughout the evaluation process. As the basis of the VM image, please choose commonly used OS versions that have been tested with the virtual machine software and that evaluators are likely to be accustomed to. We encourage you to use https://www.virtualbox.org and save the VM image as an Open Virtual Appliance (OVA) file. Please include the prepared link in the appropriate field of the paper submission form.

In addition, please supply at submission time a link to a short plain-text file describing the OS and parameters of the image, as well as the host platform on which you prepared and tested your virtual machine image (OS, RAM, number of cores, CPU frequency). Please describe how to proceed after booting the image, including the instructions for locating the full documentation for evaluating the artifact.

If you are not in a position to prepare the artifact as above, please contact PC chairs for an alternative arrangement.

It is to the advantage of authors to prepare an artifact that is easy to evaluate by the artifact evaluation committee and that yields expected results. We next provide some guidelines.  Document in detail how to reproduce most of the experimental results of the paper using the artifact; keep this process simple through easy-to-use scripts and provide detailed documentation assuming minimum expertise of users. Ensure the artifact is in the state ready to run. It should work without a network connection. It should not require the user to install additional software before running. It should use reasonably modest resources (RAM, number of cores), so that the results can be reproduced on various hardware platforms including laptops. The evaluation should take reasonable amount of time to complete. When possible include source code within your virtual machine image and point to the most relevant and interesting parts of the source code tree.

Members of the artifact evaluation committee and the program committee are asked to use submitted artifact for the sole purpose of evaluating the contribution associated with the artifact.

CAV Award

CAV Award

The CAV award is given annually at the CAV conference for fundamental contributions to the field of Computer-Aided Verification. The award comes with a cash prize of US$10,000 shared equally among recipients.

Call for Nominations for the 2017 CAV Award

Anyone can submit a nomination. The Award Committee can originate a nomination. Anyone, with the exception of members of the Award Committee, is eligible to receive the Award. A nomination must state clearly the contribution(s), explain why the contribution is fundamental or the series of contributions is outstanding, and be accompanied by supporting letters and other evidence of worthiness. The deadline for nominations for the 2017 award is 10 February 2017.

Nominations should include a proposed citation (up to 25 words), a succinct (100-250 words) description of the contribution(s), and a detailed statement to justify the nomination. The cited contribution(s) must have been made not more recently than five years ago and not over twenty years ago. In addition, the contribution(s) should not yet have received recognition via a major award, such as the ACM Turing or Kanellakis Awards. The nominee may have received such an award for other contributions.

Nominations should be submitted by e-mail to a member of the committee.

For previous winners of the award, please see the main CAV award page .

Award Committee

Invited talks

Chris Hawblitzel, Microsoft Research:Chris Hawblitzel, Microsoft Research
Fast verification of fast cryptography for secure sockets

 

 

 

 

 


Marta Kwiatkowska, OxfordMarta Kwiatkowska, Oxford

 

 

 

 

 


Invited Tutorial Speakers

Loris D’Antoni, University of Wisconsin-MadisonLoris D'Antoni, University of Wisconsin-Madison
The power of symbolic automata and transducers

 

 

 

 

 

 


Mayur Naik, University of PennsylvaniaMayur Naik, University of Pennsylvania
Maximum Satisfiability in Software Analysis: Applications and Techniques

Verification Mentoring Workshop

July 23, 2017

The purpose of the Verification Mentoring Workshop (VMW) is to provide mentoring and career advice to early-stage graduate students, to attract them to pursue research careers in the area of computer-aided verification. The workshop will particularly encourage participation of women and under-represented minorities.

The workshop program will include a number of talks and interactive sessions. The talks will give an overview of the field along with brief introductions to the varied topics highlighted at CAV. Other talks will provide mentoring and career advice, from academia and industry.

Program

Session 1: Research in verification

Session 2: Verification in industry

  • Liana Hadarean, Synopsis
  • Jens Oehlerking, Bosch
  • Jules Villard, Facebook
  • Neha Rungta, Amazon

Session 3: Career prospects

CAV Buddy

Along with the workshop, there will be a CAV buddy program throughout the conference to connect the new and experienced students together.

Funding

We provide travel scholarships for graduate and undergraduate (Seniors only) students to attend the workshop and CAV.

Application form (Google Form)

Important Dates

  • Deadline for submission of applications: May 7, 2017
  • Notification of travel grants: May 19, 2017
  • VMW Workshop: July 23, 2017
  • CAV Conference: July 24 – 28, 2017

Organizers

Dates

Paper submission

24 January 2017: Full papers due
20-22 March 2017: Author response period
12 April 2017: Notification of acceptance/rejection decisions

Conference in Heidelberg, Germany

22-28 July 2017: Workshops, tutorials, and the main conference

Organization

Conference co-chairs

Viktor Kuncak, EPFL, Switzerland
Rupak Majumdar, Max Planck Institute for Software Systems, Germany

Workshop Chair

Eva Darulová, Max Planck Institute for Software Systems, Germany

Sponsorship Chair

Barbara Jobstmann, EPFL and Cadence

CAV Fellowship Chair

Thomas Wahl, Northeastern University

Publicity Chair

Mikaël Mayer, EPFL

CAV Award Committee

Tom Ball  (Chair), Microsoft research
Kim G. Larsen, Aalborg University
Natarajan Shankar, SRI International
Pierre Wolper, Liege University

Program Committee

Aws Albarghouthi, University of Wisconsin
Christel Baier, TU Dresden
Per Bjesse, Synopsys
Jasmin Blanchette, Inria Nancy – Grand Est
Sergiy Bogomolov, Australian National University
Ahmed Bouajjani, IRIF, Paris Diderot University
Rohit Chadha, University of Missouri
Bor-Yuh Evan Chang, University of Colorado Boulder
Swarat Chaudhuri, Rice University
Wei-Ngan Chin, National University of Singapore
Hana Chockler, King’s College London
Alessandro Cimatti, Fondazione Bruno Kessler
Isil Dilig, University of Texas at Austin
Dino Distefano, Facebook and Queen Mary University of London
Cezara Dragoi, INRIA Paris, ENS
Michael Emmi, Nokia Bell Labs
Javier Esparza, TU Munich
Georgios Fainekos, Arizona State University
Azadeh Farzan, University of Toronto
Aarti Gupta, Princeton University
Gerard Holzmann, Nimble Research
Marieke Huisman, University of Twente
Radu Iosif, Verimag
Franjo Ivancic, Google
Stefan Kiefer, Oxford University
Zachary Kincaid, Princeton University
Barbara König, University of Duisburg-Essen
Daniel Kröning, Oxford University
Viktor Kuncak (Co-chair), EPFL
Rustan Leino, Microsoft Research
Rupak Majumdar (Co-chair), MPI-SWS
Kenneth McMillan, Microsoft Research
Alexander Nadel, Intel
Madhusudan Parthasarathy, University of Illinois at Urbana-Champaign
Corina Pasareanu, NASA Ames
Nadia Polikarpova, MIT
Pavithra Prabhakar, Kansas State University
Arjun Radhakrishna, University of Pennsylvania
Zvonimir Rakamaric, University of Utah
Andrey Rybalchenko, Microsoft Research
Roopsha Samanta, Purdue University
Rahul Sharma, Microsoft Research
Anna Slobodova, Centaur Technology
Ana Sokolova, University of Salzburg
Zhendong Su, University of California at Davis
Serdar Tasiran, Amazon Web Services
Emina Torlak, University of Washington
Willem Visser, Stellenbosch University
Mahesh Viswanathan, University of Illinois at Urbana Champaign
Yakir Vizel, Princeton University
Tomas Vojnar, Brno University of Technology
Thomas Wahl, Northeastern University
Bow-Yaw Wang, Academia Sinica
Georg Weissenbacher, Vienna University of Technology
Verena Wolf, Saarland University
Lenore Zuck, University of Illinois at Chicago
Damien Zufferey, MPI-SWS

Steering Committee

Orna Grumberg, Technion, Israel
Aarti Gupta, Princeton University, USA
Daniel Kroening, University of Oxford, UK
Kenneth McMillan, Microsoft Research, USA

Artifact Evaluation Committee

Ayca Balkan, UCLA
Stephanie Balzer, CMU
James Bornholt, University of Washington
Simon Cruanes, INRIA Nancy
Matthias Dangl University of Passau
Marko Doko, MPI-SWS
Chuchu Fan, UIUC
Pietro Ferrara, Julia
Johannes Hoelzl, TU Munich
Lars Hupel, TU Munich
Swen Jacobs, Saarland University
Moa Johansson, Chalmers
Dejan Jovanovic, SRI
Ralf Jung, MPI-SWS
Ivan Kuraj, MIT
Andreas Lochbihler, ETH Zurich
Jose Morales, IMDEA
Van Chan Ngo, CMU
Zvonimir Pavlinovic, NYU
Markus Rabe, UC Berkeley
Mukund Raghothaman, UPenn
Andrew Reynolds, University of Iowa
Nima Roohi, UIUC
Christian Schilling, University of Freiburg
Muralidaran Vijayaraghavan, MIT
Nicolas Voirol, EPFL

About

CAV 2017 is the 29th in a series dedicated to the advancement of the theory and practice of computer-aided formal analysis methods for hardware and software systems.  The conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical verification tools and the algorithms and techniques that are needed for their implementation. CAV considers it vital to continue spurring advances in hardware and software verification while expanding to new domains such as biological systems and computer security. The proceedings of the conference will be published in the Springer-Verlag Lecture Notes in Computer Science series. A selection of papers is expected to be invited to a special issue of Formal Methods in System Design and the Journal of the ACM.

Accommodation

Hotels in Heidelberg for CAV 2017 from 22/07/2017 to 28/07/2017

  1. The Crown Plaza Heidelberg City Centre

Kurfürstenanlage 1
69115 Heidelberg
Tel. +49 6221 917 0
heidelberg@hdbge.crowneplaza.com
www.ihg.com/crowneplaza

50 standard single rooms available at €149.00 per night.
30 executive single rooms available at €199.00 per night.
Please book by June 1st using the keyword CAV2017.

  1. Hotel IBIS Heidelberg Hauptbahnhof

Willy-Brandt-Platz 3
69115 Heidelberg
H1447-RE@accor.com
Ibis.com * accorhotels.com
Tel. +49 6221-9130

20 rooms available for 1 – 2 Persons.
Single room à €82.00 per room/night, including breakfast breakfast.
Double/Twin room à €103.00 per room/night, including breakfast.
The cited rates include breakfast, service and VAT. The rooms have showers, satellite TVs, telephones and radios.
The parking in front of and behind the hotel is free of charge for guests.
Please book by June 9th using the keyword CAV2017.
Guests pay their bills themselves. Only one invoice per room is possible.

  1. Holiday Inn Express Heidelberg City

Kurfürstenanlage 23
69115 Heidelberg
Tel. +49 6221 4284 0
Central Reservation: +800 80800800
Heidelberg@fmhos.com
www.hiexpress.de

20 rooms available.
Price per room: €132, 00 per room per night (Single-/double room)
Incl. Service and V.A.T. (currently 7%). In case of an increase of the V.A.T. all prices will be amended accordingly.
A continental breakfast buffet is offered to all guests free of charge.
Room facilities: Wireless Internet access free of charge, Air-conditioning, complimentary Coffee- & Tee making facilities, Safe deposit box, Telephone, Satellite TV, Shower/WC, Hairdryer.
Please book by June 24th using the keyword CAV2017. There is a minimum stay of two nights.
Payment: Guests pay on Check-in. A valid credit card is needed in order to guarantee the booking.

  1. Qube Hotel Heidelberg

Bergheimerstraße 74, 69115 Heidelberg
Tel. +49 6221 187 990
info@qube-heidelberg.de

15 Superior double rooms for single use for €153 per night excluding breakfast.
The breakfast buffet costs €18.50€ per person/day.
Parking 24h at €19.50 per day.
The hotel can also provide rooms for 2 people at an additional cost of €10 per person. Regarding the invoicing, they can provide each guest (also when there are two in one room) with his own invoice.
Please book by June 30th using the keyword CAV2017.

  1. Leonardo Hotel Heidelberg City Center

Bergheimerstraße 63, 69115 Heidelberg
Tel. +49 6221 508 659
Reservations.heidelberg@leonardo-hotels.com
www.leonardo-hotels.com

10 single rooms at €115 per night, 10 twin rooms at €125 per night.
Breakfast is included in the price.
Room facilities: Wireless Internet access free of charge, Air-conditioning, fridge, complimentary coffee/ tea making facilities, Safe deposit box, telephone,  TV, Shower or bathtub/WC and working desk.
Parking costs €17.00 for 24 hours.
Please book by June 9th using the keyword CAV2017.