2020
DOI: 10.1007/978-3-030-45237-7_26
|View full text |Cite
|
Sign up to set email alerts
|

GACAL: Conjecture-Based Verification

Abstract: GACAL verifies C programs by searching over the space of possible invariants, using traces of the input program to identify potential invariants. GACAL uses the ACL2s theorem prover to verify these potential invariants, using an interface provided by ACL2s for connecting with external tools. GACAL iteratively searches for and proves invariants of increasing complexity until the program is verified.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…The evaluation of IDG shows that it is the most effective invariant discovery game [28]. Quiring and Manolios have recently developed GACAL, a tool that can play the loop-invariant discovery game, outperforming most human players and providing an example of a computational agent that can augment human players [27].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The evaluation of IDG shows that it is the most effective invariant discovery game [28]. Quiring and Manolios have recently developed GACAL, a tool that can play the loop-invariant discovery game, outperforming most human players and providing an example of a computational agent that can augment human players [27].…”
Section: Related Workmentioning
confidence: 99%
“…Finally, we believe that there are many opportunities to develop computational agents that can augment and complement human cognitive abilities. The GACAL system is an early example [27].…”
Section: Future Workmentioning
confidence: 99%