Symbol elimination for automated generation of program properties
Paper i proceeding, 2014

Automatic understanding of the intended meaning of computer programs is a very hard problem, requiring intelligence and reasoning. In this talk we describe applications of our symbol elimination methods in automated proram analysis. Symbol elimination uses first-order theorem proving techniques in conjunction with symbolic computation methods, and derives nontrivial program properties, such as loop invariants and loop bounds, in a fully automatic way. Moreover, symbol elimination can be used as an alternative to interpolation for software verification.

Program analysis

Automated reasoning

Interpolation

Symbolic computation

Invariant generation

Författare

Laura Kovacs

Chalmers, Data- och informationsteknik, Programvaruteknik

Electronic Communications of the EASST

1863-2122 (eISSN)

Vol. 70

14th International Workshop onAutomated Verification of Critical Systems (AVoCS 2014)
Twente, Netherlands,

Ämneskategorier

Inbäddad systemteknik

Datavetenskap (datalogi)

Datorsystem

DOI

10.14279/tuj.eceasst.70.974.952

Mer information

Senast uppdaterat

2021-07-12