SwePub
Sök i LIBRIS databas

  Utökad sökning

L773:0098 5589 OR L773:1939 3520
 

Sökning: L773:0098 5589 OR L773:1939 3520 > Self-Supervised Lea...

  • Kommrusch, SteveColorado State Univ, Ft Collins, CO 80523 USA. (författare)

Self-Supervised Learning to Prove Equivalence Between Straight-Line Programs via Rewrite Rules

  • Artikel/kapitelEngelska2023

Förlag, utgivningsår, omfång ...

  • Institute of Electrical and Electronics Engineers (IEEE),2023
  • printrdacarrier

Nummerbeteckningar

  • LIBRIS-ID:oai:DiVA.org:kth-334711
  • https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-334711URI
  • https://doi.org/10.1109/TSE.2023.3271065DOI

Kompletterande språkuppgifter

  • Språk:engelska
  • Sammanfattning på:engelska

Ingår i deldatabas

Klassifikation

  • Ämneskategori:ref swepub-contenttype
  • Ämneskategori:art swepub-publicationtype

Anmärkningar

  • QC 20231127
  • We target the problem of automatically synthesizing proofs of semantic equivalence between two programs made of sequences of statements. We represent programs using abstract syntax trees (AST), where a given set of semantics-preserving rewrite rules can be applied on a specific AST pattern to generate a transformed and semantically equivalent program. In our system, two programs are equivalent if there exists a sequence of application of these rewrite rules that leads to rewriting one program into the other. We propose a neural network architecture based on a transformer model to generate proofs of equivalence between program pairs. The system outputs a sequence of rewrites, and the validity of the sequence is simply checked by verifying it can be applied. If no valid sequence is produced by the neural network, the system reports the programs as non-equivalent, ensuring by design no programs may be incorrectly reported as equivalent. Our system is fully implemented for one single grammar which can represent straight-line programs with function calls and multiple types. To efficiently train the system to generate such sequences, we develop an original incremental training technique, named self-supervised sample selection. We extensively study the effectiveness of this novel training approach on proofs of increasing complexity and length. Our system,S4Eq, achieves 97% proof success on a curated dataset of 10,000 pairs of equivalent programs.

Ämnesord och genrebeteckningar

Biuppslag (personer, institutioner, konferenser, titlar ...)

  • Monperrus, MartinKTH,Teoretisk datalogi, TCS(Swepub:kth)u13jhcyf (författare)
  • Pouchet, Louis-NoelColorado State Univ, Ft Collins, CO 80523 USA. (författare)
  • Colorado State Univ, Ft Collins, CO 80523 USA.Teoretisk datalogi, TCS (creator_code:org_t)

Sammanhörande titlar

  • Ingår i:IEEE Transactions on Software Engineering: Institute of Electrical and Electronics Engineers (IEEE)49:7, s. 3771-37920098-55891939-3520

Internetlänk

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy