Fully Abstract Normal Form Bisimulation for Call-by-Value PCF ; 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Fully Abstract Normal Form Bisimulation for Call-by-Value PCF ; 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Συγγραφείς: Koutavas, Vasileios, Lin Hou, Yu
Συνεισφορές: Science Foundation Ireland (SFI), 13/RC/2094_2
Στοιχεία εκδότη: IEEE
Έτος έκδοσης: 2023
Συλλογή: The University of Dublin, Trinity College: TARA (Trinity's Access to Research Archive)
Θεματικοί όροι: PCF, Biosimulation, Computer Programming Languages, Formal (i.e. mathematical) Methods In Computer Science, Formal Methods, Formal Semantics, Program Equivalence, Program Verification
Περιγραφή: PUBLISHED ; Boston, MA, USA ; We present the first fully abstract normal form bisimulation for call-by-value PCF (PCFv). Our model is based on a labelled transition system (LTS) that combines elements from applicative bisimulation, environmental bisimulation and game semantics. In order to obtain completeness while avoiding the use of semantic quotiening, the LTS constructs traces corresponding to interactions with possible functional contexts. The model gives rise to a sound and complete technique for checking of PCFv program equivalence, which we implement in a bounded bisimulation checking tool. We test our tool on known equivalences from the literature and new examples.
Τύπος εγγράφου: conference object
Περιγραφή αρχείου: application/pdf
Γλώσσα: English
Relation: Y; http://hdl.handle.net/2262/103829; http://people.tcd.ie/vkoutav; http://people.tcd.ie/linhouy; 258371; http://dx.doi.org/10.1109/LICS56636.2023.10175778
DOI: 10.1109/LICS56636.2023.10175778
Διαθεσιμότητα: http://hdl.handle.net/2262/103829
http://people.tcd.ie/vkoutav
http://people.tcd.ie/linhouy
https://doi.org/10.1109/LICS56636.2023.10175778
Rights: Y ; openAccess
Αριθμός Καταχώρησης: edsbas.E9B78955
Βάση Δεδομένων: BASE
Περιγραφή
DOI:10.1109/LICS56636.2023.10175778