LLM-Generated Invariants for Bounded Model Checking Without Loop Unrolling

We investigate a modification of the classical Bounded Model Checking (BMC) procedure that does not handle loops through unrolling but via modifications to the control flow graph (CFG). A portion of the CFG representing a loop is replaced by a node asserting invariants of the loop. We generate these...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE/ACM International Conference on Automated Software Engineering : [proceedings] s. 1395 - 1407
Hlavní autori:	Pirzada, Muhammad A. A., Bhayat, Ahmed, Cordeiro, Lucas C., Reger, Giles
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	ACM 27.10.2024
Predmet:	Benchmark testing Bounded Model Checking Closed box Flow graphs Glass box Invariant Generation Large language models Model checking Program Verification Software engineering Transforms
ISSN:	2643-1572
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!