Why Just Boogie?

Ameri, Michael; Furia, Carlo A.

doi:10.1007/978-3-319-33693-0_6

Cited by 10 publications

(4 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Similarly, but with less extensive reuse, the WhyML intermediate verification language is used in the verification systems Frama-C [80] and Krakatoa [47]. Recently, a translation from Boogie to WhyML was presented [5] that links both strands. The state-ofart on tool integration in the model checking domain is discussed in the article Software Architecture of Modern Model-Checkers in this issue.…”

Section: Integrationmentioning

confidence: 99%

Deductive Software Verification: From Pen-and-Paper Proofs to Industrial Tools

Hähnle

Huisman

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Deductive software verification aims at formally verifying that all possible behaviors of a given program satisfy formally defined, possibly complex properties, where the verification process is based on logical inference. We follow the trajectory of the field from its inception in the late 1960s via its current state to its promises for the future, from pen-and-paper proofs for programs written in small, idealized languages to highly automated proofs of complex library or system code written in mainstream languages. We take stock of the state-of-art and give a list of the most important challenges for the further development of the field of deductive software verification.

show abstract

Section: Integrationmentioning

confidence: 99%

Deductive Software Verification: From Pen-and-Paper Proofs to Industrial Tools

Hähnle

Huisman

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…These are implemented in our translator program, called Wy2B. 1 Whilst, in some cases, this process is straightforward, there are a number of subtle issues to be addressed, such as the representation of Whiley types in Boogie.…”

Section: Modeling Whiley In Boogiementioning

confidence: 99%

“…Research on intermediate verification languages has often encountered impedance mismatch. Ameri and Furia present a translation from Boogie to WhyML which, although largely successful, did expose some important mismatches between them [1]. The structured nature of WhyML presented some problems in handling Boogie's unstructured branching, and aspects of Boogie's polymorphic maps and bitvectors were problematic.…”

Section: Related Workmentioning

confidence: 99%

Making Whiley Boogie!

Utting

Pearce

Groves

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The quest to develop increasingly sophisticated verification systems continues unabated. Tools such as Dafny, Spec#, ESC/Java, SPARK Ada, and Whiley attempt to seamlessly integrate specification and verification into a programming language, in a similar way to type checking. A common integration approach is to generate verification conditions that are handed off to an automated theorem prover. This provides a nice separation of concerns, and allows different theorem provers to be used interchangeably. However, generating verification conditions is still a difficult undertaking and the use of more "high-level" intermediate verification languages has become common-place. In particular, Boogie provides a widely used and understood intermediate verification language. A common difficulty is the potential for an impedance mismatch between the source language and the intermediate verification language. In this paper, we explore the use of Boogie as an intermediate verification language for verifying programs in Whiley. This is noteworthy because the Whiley language has (amongst other things) a rich type system with considerable potential for an impedance mismatch. We report that, whilst a naive translation to Boogie is unsatisfactory, a more abstract encoding is surprisingly effective.

show abstract

“…Наиболее [140] распространенными промежуточными языками верификации яв ляются Boogie [35,40,141] и WhyML [56,84,132]. К примеру, следующие си стемы используют Boogie [179]: AutoProof [87,177] для верификации Eiffel-про грамм [159,163], VCC [59,60,152,153] для верификации C-программ, Spec# [41,42] для верификации C#-программ и система [137,139] верификации Dafny-про грамм.…”

Section: Introductionunclassified

Методы Комплексного Подхода К Автоматизации Дедуктивной Верификации Программ С Финитными Итерациями

Кондратьев¹

View full text Add to dashboard Cite

Why Just Boogie?

Cited by 10 publications

References 20 publications

Deductive Software Verification: From Pen-and-Paper Proofs to Industrial Tools

Deductive Software Verification: From Pen-and-Paper Proofs to Industrial Tools

Making Whiley Boogie!

Методы Комплексного Подхода К Автоматизации Дедуктивной Верификации Программ С Финитными Итерациями

Contact Info

Product

Resources

About