English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Automated software verification is a very active field of research which hasmade enormous progress both in theoretical and practical aspects. Recently, animportant amount of research effort has been put into applying these techniqueson top of mainstream programming languages. These languages typically providepowerful features such as reflection, aliasing and polymorphism which are handyfor practitioners but, in contrast, make verification a real challenge. In thiswork we present Pest, a simple experimental, while-style, multiprocedural,imperative programming language which was conceived with verifiability as oneof its main goals. This language forces developers to concurrently think aboutboth the statements needed to implement an algorithm and the assertionsrequired to prove its correctness. In order to aid programmers, we proposeseveral techniques to reduce the number and complexity of annotations requiredto successfully verify their programs. In particular, we show that high-leveliteration constructs may alleviate the need for providing complex loopannotations.

Reducing the Number of Annotations in a Verification-oriented Imperative Language