{"title":"Session details: Semantic models 2","authors":"L. Birkedal","doi":"10.1145/3262959","DOIUrl":"https://doi.org/10.1145/3262959","url":null,"abstract":"","PeriodicalId":20683,"journal":{"name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","volume":"10 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76400968","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Session details: Program analysis 1","authors":"Xavier Rival","doi":"10.1145/3250010","DOIUrl":"https://doi.org/10.1145/3250010","url":null,"abstract":"","PeriodicalId":20683,"journal":{"name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","volume":"65 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77578116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Session details: Program analysis 2","authors":"Thomas Wies","doi":"10.1145/3262954","DOIUrl":"https://doi.org/10.1145/3262954","url":null,"abstract":"","PeriodicalId":20683,"journal":{"name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","volume":"51 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88347518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Session details: Synthesis","authors":"A. Nori","doi":"10.1145/3262964","DOIUrl":"https://doi.org/10.1145/3262964","url":null,"abstract":"","PeriodicalId":20683,"journal":{"name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","volume":"66 8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83423835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Session details: Reasoning","authors":"A. Rybalchenko","doi":"10.1145/3262957","DOIUrl":"https://doi.org/10.1145/3262957","url":null,"abstract":"","PeriodicalId":20683,"journal":{"name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","volume":"15 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85213578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Session details: Semantic models 1","authors":"Nick Benton","doi":"10.1145/3262951","DOIUrl":"https://doi.org/10.1145/3262951","url":null,"abstract":"","PeriodicalId":20683,"journal":{"name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","volume":"51 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79808832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Session details: Verified systems","authors":"Aaron Turon","doi":"10.1145/3262961","DOIUrl":"https://doi.org/10.1145/3262961","url":null,"abstract":"","PeriodicalId":20683,"journal":{"name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","volume":"32 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73486140","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Session details: Probability","authors":"N. Swamy","doi":"10.1145/3262962","DOIUrl":"https://doi.org/10.1145/3262962","url":null,"abstract":"","PeriodicalId":20683,"journal":{"name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79574792","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
It is our great pleasure to welcome you to the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages -- POPL'14, being held in San Diego, CA. POPL was last held here in 1998. We are very pleased that we were able to arrange for a long overdue return, giving an opportunity for our attendees to experience the charm, salubrious weather, and numerous attractions of this vibrant and dynamic city. POPL'14 features the following co-located events: The 15th International Conference on Verification, Model-Checking, and Abstract Interpretation (VMCAI) The 16th International Symposium on Practical Aspects of Declarative Languages (PADL) The Workshop on Partial Evaluation and Program Manipulation (PEPM) The Workshop on Programming Languages meets Program Verification (PLPV) The Workshop on Program Protection and Reverse Engineering (PPREW) The Off the Beaten Track Workshop (OBT) The Programming Language Mentoring Workshop (PLMW) The Principles in Practice Workshop (PiP) - a new event Support from corporate sponsors helped tremendously to keep POPL's registration fees modest, and enabled low-cost access to all conference events for students. We are deeply grateful to all of our sponsors for their support and generosity. The POPL'14 organizing committee deserves special thanks for their tireless efforts in helping to (a) coordinate co-located events with the main conference, (b) handle student activities and tutorials, (c) ensure the conference was widely publicized, and (d) manage budgets and financing. The sage advice of the entire POPL steering committee was also invaluable. We are also grateful to the following professionals for their support and contributions: John Lateulere of Integrated Management Solutions; Carole Mann and her team at Registration Systems Labs; Lisa Tolles of Sheridan Printing, and Ashley Cozzi, Adrienne Griscti, Farrah Khan, Maritza Nichols, Stephanie Sabal, and Debra Venedam of ACM SIG services. Our thanks also to the staff at the US Grant hotel for their help in accommodating POPL at their historic venue. The call for papers attracted 220 submissions. Papers were principally reviewed by a program committee of 27 researchers, who reviewed 21-25 each (typically three PC reviews per paper). The review process did not involve a preselected external review committee. Instead, to try to get the best possible external expert reviews for each paper, reviews were solicited from the community as a whole. One PC member was designated as `guardian' for each paper to take the lead in identifying suitable candidate externals. In all, 273 individials contributed external reviews. The majority of papers (146) received four reviews; 53 received five, 15 received three, and 2 received six (the remaining 4 were withdrawn before the PC meeting). The PC meeting in Cambridge discussed 102 papers over two days, with a first pass in a random order then a second review pass. 51 papers were accepted (23% of the
{"title":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","authors":"S. Jagannathan, Peter Sewell","doi":"10.1145/2535838","DOIUrl":"https://doi.org/10.1145/2535838","url":null,"abstract":"It is our great pleasure to welcome you to the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages -- POPL'14, being held in San Diego, CA. POPL was last held here in 1998. We are very pleased that we were able to arrange for a long overdue return, giving an opportunity for our attendees to experience the charm, salubrious weather, and numerous attractions of this vibrant and dynamic city. \u0000 \u0000POPL'14 features the following co-located events: \u0000The 15th International Conference on Verification, Model-Checking, and Abstract Interpretation (VMCAI) \u0000The 16th International Symposium on Practical Aspects of Declarative Languages (PADL) \u0000The Workshop on Partial Evaluation and Program Manipulation (PEPM) \u0000The Workshop on Programming Languages meets Program Verification (PLPV) \u0000The Workshop on Program Protection and Reverse Engineering (PPREW) \u0000The Off the Beaten Track Workshop (OBT) \u0000The Programming Language Mentoring Workshop (PLMW) \u0000The Principles in Practice Workshop (PiP) - a new event \u0000 \u0000 \u0000 \u0000Support from corporate sponsors helped tremendously to keep POPL's registration fees modest, and enabled low-cost access to all conference events for students. We are deeply grateful to all of our sponsors for their support and generosity. The POPL'14 organizing committee deserves special thanks for their tireless efforts in helping to (a) coordinate co-located events with the main conference, (b) handle student activities and tutorials, (c) ensure the conference was widely publicized, and (d) manage budgets and financing. The sage advice of the entire POPL steering committee was also invaluable. We are also grateful to the following professionals for their support and contributions: John Lateulere of Integrated Management Solutions; Carole Mann and her team at Registration Systems Labs; Lisa Tolles of Sheridan Printing, and Ashley Cozzi, Adrienne Griscti, Farrah Khan, Maritza Nichols, Stephanie Sabal, and Debra Venedam of ACM SIG services. Our thanks also to the staff at the US Grant hotel for their help in accommodating POPL at their historic venue. \u0000 \u0000The call for papers attracted 220 submissions. Papers were principally reviewed by a program committee of 27 researchers, who reviewed 21-25 each (typically three PC reviews per paper). The review process did not involve a preselected external review committee. Instead, to try to get the best possible external expert reviews for each paper, reviews were solicited from the community as a whole. One PC member was designated as `guardian' for each paper to take the lead in identifying suitable candidate externals. In all, 273 individials contributed external reviews. The majority of papers (146) received four reviews; 53 received five, 15 received three, and 2 received six (the remaining 4 were withdrawn before the PC meeting). The PC meeting in Cambridge discussed 102 papers over two days, with a first pass in a random order then a second review pass. 51 papers were accepted (23% of the ","PeriodicalId":20683,"journal":{"name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88597729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We address the verification problem of eventual consistency of optimistic replication systems. Such systems are typically used to implement distributed data structures over large scale networks. We introduce a formal definition of eventual consistency that applies to a wide class of existing implementations, including the ones using speculative executions. Then, we reduce the problem of checking eventual consistency to reachability and model checking problems. This reduction enables the use of existing verification tools for message-passing programs in the context of verifying optimistic replication systems. Furthermore, we derive from these reductions decision procedures for checking eventual consistency of systems implemented as finite-state programs communicating through unbounded unordered channels.
{"title":"Verifying eventual consistency of optimistic replication systems","authors":"A. Bouajjani, C. Enea, Jad Hamza","doi":"10.1145/2535838.2535877","DOIUrl":"https://doi.org/10.1145/2535838.2535877","url":null,"abstract":"We address the verification problem of eventual consistency of optimistic replication systems. Such systems are typically used to implement distributed data structures over large scale networks. We introduce a formal definition of eventual consistency that applies to a wide class of existing implementations, including the ones using speculative executions. Then, we reduce the problem of checking eventual consistency to reachability and model checking problems. This reduction enables the use of existing verification tools for message-passing programs in the context of verifying optimistic replication systems. Furthermore, we derive from these reductions decision procedures for checking eventual consistency of systems implemented as finite-state programs communicating through unbounded unordered channels.","PeriodicalId":20683,"journal":{"name":"Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","volume":"77 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75731429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}