PRoofster: Automated Formal Verification

Guardado en:
Detalles Bibliográficos
Publicado en:The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Conference Proceedings (2023)
Autor principal: Agrawal, Arpan
Otros Autores: First, Emily, Kaufman, Zhanna, Reichel, Tom, Zhang, Shizhuo, Zhou, Timothy, Sanchez-Stern, Alex, Ringer, Talia, Brun, Yuriy
Publicado:
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Materias:
Acceso en línea:Citation/Abstract
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

MARC

LEADER 00000nab a2200000uu 4500
001 2836050428
003 UK-CbPIL
024 7 |a 10.1109/ICSE-Companion58688.2023.00018  |2 doi 
035 |a 2836050428 
045 2 |b d20230101  |b d20231231 
084 |a 228229  |2 nlm 
100 1 |a Agrawal, Arpan  |u University of Illinois,Urbana-Champaign,IL,USA 
245 1 |a PRoofster: Automated Formal Verification 
260 |b The Institute of Electrical and Electronics Engineers, Inc. (IEEE)  |c 2023 
513 |a Conference Proceedings 
520 3 |a Conference Title: 2023 IEEE/ACM 45th International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)Conference Start Date: 2023, May 14 Conference End Date: 2023, May 20 Conference Location: Melbourne, AustraliaFormal verification is an effective but extremely work-intensive method of improving software quality. Verifying the correctness of software systems often requires significantly more effort than implementing them in the first place, despite the existence of proof assistants, such as Coq, aiding the process. Recent work has aimed to fully automate the synthesis of formal verification proofs, but little tool support exists for practitioners. This paper presents oofster, a web-based tool aimed at assisting developers with the formal verification process via proof synthesis. oofster inputs a Coq theorem specifying a property of a software system and attempts to automatically synthesize a formal proof of the correctness of that property. When it is unable to produce a proof, oofster outputs the proof-space search tree its synthesis explored, which can guide the developer to provide a hint to enable oofster to synthesize the proof. oofster runs online at https://proofster.cs.umass.edu/ and a video demonstrating oofster is available at https://youtu.be/xQAi66IRfwI/. 
653 |a Verification 
653 |a Software engineering 
653 |a Automation 
653 |a Synthesis 
700 1 |a First, Emily  |u University of Massachusetts,Amherst,MA,USA 
700 1 |a Kaufman, Zhanna  |u University of Massachusetts,Amherst,MA,USA 
700 1 |a Reichel, Tom  |u University of Illinois,Urbana-Champaign,IL,USA 
700 1 |a Zhang, Shizhuo  |u University of Illinois,Urbana-Champaign,IL,USA 
700 1 |a Zhou, Timothy  |u University of Illinois,Urbana-Champaign,IL,USA 
700 1 |a Sanchez-Stern, Alex  |u University of Massachusetts,Amherst,MA,USA 
700 1 |a Ringer, Talia  |u University of Illinois,Urbana-Champaign,IL,USA 
700 1 |a Brun, Yuriy  |u University of Massachusetts,Amherst,MA,USA 
773 0 |t The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Conference Proceedings  |g (2023) 
786 0 |d ProQuest  |t Science Database 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/2836050428/abstract/embedded/75I98GEZK8WCJMPQ?source=fedsrch