‹Programming› 2019
Mon 1 - Thu 4 April 2019 Genoa, Italy
Wed 3 Apr 2019 12:30 - 14:30 at Second floor hall - Poster Session

There are different ways to check whether a program is “cor- rect”, including dynamic testing and static type checking. Unfortunately, testing only checks a certain (finite) set of inputs and types may be too imprecise to express complex correctness properties. For example, correctness of a sort- ing routine requires that the output is both sorted and con- tains the same elements as the input. Program verification aims to prove such correctness properties for all possible in- puts based on annotations such as pre-, postconditions, as- sertions and invariants. However, the verification process for these annotations can become complex. Therefore, sim- ple error messages may not be sufficient to help the pro- grammer understand and resolve verification issues.

Wed 3 Apr

programming-2019-Posters
12:30 - 14:30: Posters - Poster Session at Second floor hall
programming-2019-Posters12:30 - 14:30
Poster
programming-2019-Posters12:30 - 14:30
Talk
Pascal WeisenburgerTechnische Universität Darmstadt, Guido SalvaneschiTU Darmstadt
programming-2019-Posters12:30 - 14:30
Poster
Jan ChristiansenFlensburg University of Applied Sciences, Germany, Sandra DylusUniversity of Kiel, Germany
programming-2019-Posters12:30 - 14:30
Poster
Christopher SchusterUniversity of California, Santa Cruz, Cormac FlanaganUniversity of California, Santa Cruz