arXiv - CS - Programming Languages最新文献

Memory Consistency and Program Transformations 内存一致性和程序转换

arXiv - CS - Programming Languages Pub Date : 2024-09-18 DOI: arxiv-2409.12013

Akshay GopalakrishnanMcGill University, Clark VerbruggeMcGill University, Mark BattyUniversity of Kent

{"title":"Memory Consistency and Program Transformations","authors":"Akshay GopalakrishnanMcGill University, Clark VerbruggeMcGill University, Mark BattyUniversity of Kent","doi":"arxiv-2409.12013","DOIUrl":"https://doi.org/arxiv-2409.12013","url":null,"abstract":"A memory consistency model specifies the allowed behaviors of shared memory\u0000concurrent programs. At the language level, these models are known to have a\u0000non-trivial impact on the safety of program optimizations, limiting the ability\u0000to rearrange/refactor code without introducing new behaviors. Existing\u0000programming language memory models try to address this by permitting more\u0000(relaxed/weak) concurrent behaviors but are still unable to allow all the\u0000desired optimizations. A core problem is that weaker consistency models may\u0000also render optimizations unsafe, a conclusion that goes against the intuition\u0000of them allowing more behaviors. This exposes an open problem of the\u0000compositional interaction between memory consistency semantics and\u0000optimizations: which parts of the semantics correspond to allowing/disallowing\u0000which set of optimizations is unclear. In this work, we establish a formal\u0000foundation suitable enough to understand this compositional nature, decomposing\u0000optimizations into a finite set of elementary effects on program execution\u0000traces, over which aspects of safety can be assessed. We use this decomposition\u0000to identify a desirable compositional property (complete) that would guarantee\u0000the safety of optimizations from one memory model to another. We showcase its\u0000practicality by proving such a property between Sequential Consistency (SC) and\u0000$SC_{RR}$, the latter allowing independent read-read reordering over $SC$. Our\u0000work potentially paves way to a new design methodology of programming-language\u0000memory models, one that places emphasis on the optimizations desired to be\u0000performed.","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":"47 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142250404","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}

引用次数: 0

Towards Quantum Multiparty Session Types 迈向量子多方会话类型

arXiv - CS - Programming Languages Pub Date : 2024-09-17 DOI: arxiv-2409.11133

Ivan Lanese, Ugo Dal Lago, Vikraman Choudhury

引用次数: 0

Scheme Pearl: Quantum Continuations 珍珠计划量子延续

arXiv - CS - Programming Languages Pub Date : 2024-09-17 DOI: arxiv-2409.11106

Vikraman Choudhury, Borislav Agapiev, Amr Sabry

引用次数: 0

Minuska: Towards a Formally Verified Programming Language Framework 米努斯卡迈向正式验证的编程语言框架

arXiv - CS - Programming Languages Pub Date : 2024-09-17 DOI: arxiv-2409.11530

Jan Tušil, Jan Obdržálek

引用次数: 0

No Saved Kaleidosope: an 100% Jitted Neural Network Coding Language with Pythonic Syntax 没有保存的 Kaleidosope：具有 Pythonic 语法的 100% Jitted 神经网络编码语言

arXiv - CS - Programming Languages Pub Date : 2024-09-17 DOI: arxiv-2409.11600

Augusto Seben da Rosa, Marlon Daniel Angeli, Jorge Aikes Junior, Alef Iury Ferreira, Lucas Rafael Gris, Anderson da Silva Soares, Arnaldo Candido Junior, Frederico Santos de Oliveira, Gabriel Trevisan Damke, Rafael Teixeira Sousa

{"title":"No Saved Kaleidosope: an 100% Jitted Neural Network Coding Language with Pythonic Syntax","authors":"Augusto Seben da Rosa, Marlon Daniel Angeli, Jorge Aikes Junior, Alef Iury Ferreira, Lucas Rafael Gris, Anderson da Silva Soares, Arnaldo Candido Junior, Frederico Santos de Oliveira, Gabriel Trevisan Damke, Rafael Teixeira Sousa","doi":"arxiv-2409.11600","DOIUrl":"https://doi.org/arxiv-2409.11600","url":null,"abstract":"We developed a jitted compiler for training Artificial Neural Networks using\u0000C++, LLVM and Cuda. It features object-oriented characteristics, strong typing,\u0000parallel workers for data pre-processing, pythonic syntax for expressions,\u0000PyTorch like model declaration and Automatic Differentiation. We implement the\u0000mechanisms of cache and pooling in order to manage VRAM, cuBLAS for high\u0000performance matrix multiplication and cuDNN for convolutional layers. Our\u0000experiments with Residual Convolutional Neural Networks on ImageNet, we reach\u0000similar speed but degraded performance. Also, the GRU network experiments show\u0000similar accuracy, but our compiler have degraded speed in that task. However,\u0000our compiler demonstrates promising results at the CIFAR-10 benchmark, in which\u0000we reach the same performance and about the same speed as PyTorch. We make the\u0000code publicly available at: https://github.com/NoSavedDATA/NoSavedKaleidoscope","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":"26 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142250142","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}

引用次数: 0

The Incredible Shrinking Context... in a decompiler near you 不可思议的缩小语境......就在您身边的解码器中

arXiv - CS - Programming Languages Pub Date : 2024-09-17 DOI: arxiv-2409.11157

Sifis Lagouvardos, Yannis Bollanos, Neville Grech, Yannis Smaragdakis

{"title":"The Incredible Shrinking Context... in a decompiler near you","authors":"Sifis Lagouvardos, Yannis Bollanos, Neville Grech, Yannis Smaragdakis","doi":"arxiv-2409.11157","DOIUrl":"https://doi.org/arxiv-2409.11157","url":null,"abstract":"Decompilation of binary code has arisen as a highly-important application in\u0000the space of Ethereum VM (EVM) smart contracts. Major new decompilers appear\u0000nearly every year and attain popularity, for a multitude of reverse-engineering\u0000or tool-building purposes. Technically, the problem is fundamental: it consists\u0000of recovering high-level control flow from a highly-optimized\u0000continuation-passing-style (CPS) representation. Architecturally, decompilers\u0000can be built using either static analysis or symbolic execution techniques. We present Shrknr, a static-analysis-based decompiler succeeding the\u0000state-of-the-art Elipmoc decompiler. Shrknr manages to achieve drastic\u0000improvements relative to the state of the art, in all significant dimensions:\u0000scalability, completeness, precision. Chief among the techniques employed is a\u0000new variant of static analysis context: shrinking context sensitivity.\u0000Shrinking context sensitivity performs deep cuts in the static analysis\u0000context, eagerly \"forgetting\" control-flow history, in order to leave room for\u0000further precise reasoning. We compare Shrnkr to state-of-the-art decompilers, both static-analysis- and\u0000symbolic-execution-based. In a standard benchmark set, Shrnkr scales to over\u000099.5% of contracts (compared to ~95%), covers (i.e., reaches and manages to\u0000decompile) 67% more code, and reduces key imprecision metrics by over 65%.","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":"10 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142250145","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}

引用次数: 0

Coordination-free Collaborative Replication based on Operational Transformation 基于业务转型的无协调协作复制

arXiv - CS - Programming Languages Pub Date : 2024-09-16 DOI: arxiv-2409.09934

Masato Takeichi

{"title":"Coordination-free Collaborative Replication based on Operational Transformation","authors":"Masato Takeichi","doi":"arxiv-2409.09934","DOIUrl":"https://doi.org/arxiv-2409.09934","url":null,"abstract":"We introduce Coordination-free Collaborative Replication (CCR), a new method\u0000for maintaining consistency across replicas in distributed systems without\u0000requiring explicit coordination messages. CCR automates conflict resolution,\u0000contrasting with traditional Data-sharing systems that typically involve\u0000centralized update management or predefined consistency rules. Operational Transformation (OT), commonly used in collaborative editing,\u0000ensures consistency by transforming operations while maintaining document\u0000integrity across replicas. However, OT assumes server-based coordination, which\u0000is unsuitable for modern, decentralized Peer-to-Peer (P2P) systems. Conflict-free Replicated Data Type (CRDT), like Two-Phase Sets (2P-Sets),\u0000guarantees eventual consistency by allowing commutative and associative\u0000operations but often result in counterintuitive behaviors, such as failing to\u0000re-add an item to a shopping cart once removed. In contrast, CCR employs a more intuitive approach to replication. It allows\u0000for straightforward updates and conflict resolution based on the current data\u0000state, enhancing clarity and usability compared to CRDTs. Furthermore, CCR\u0000addresses inefficiencies in messaging by developing a versatile protocol based\u0000on data stream confluence, thus providing a more efficient and practical\u0000solution for collaborative data sharing in distributed systems.","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":"36 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142250147","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}

引用次数: 0

Repr Types: One Abstraction to Rule Them All Repr 类型：一个抽象概念统领一切

arXiv - CS - Programming Languages Pub Date : 2024-09-12 DOI: arxiv-2409.07950

Viktor Palmkvist, Anders Ågren Thuné, Elias Castegren, David Broman

{"title":"Repr Types: One Abstraction to Rule Them All","authors":"Viktor Palmkvist, Anders Ågren Thuné, Elias Castegren, David Broman","doi":"arxiv-2409.07950","DOIUrl":"https://doi.org/arxiv-2409.07950","url":null,"abstract":"The choice of how to represent an abstract type can have a major impact on\u0000the performance of a program, yet mainstream compilers cannot perform\u0000optimizations at such a high level. When dealing with optimizations of data\u0000type representations, an important feature is having extensible\u0000representation-flexible data types; the ability for a programmer to add new\u0000abstract types and operations, as well as concrete implementations of these,\u0000without modifying the compiler or a previously defined library. Many research\u0000projects support high-level optimizations through static analysis,\u0000instrumentation, or benchmarking, but they are all restricted in at least one\u0000aspect of extensibility. This paper presents a new approach to representation-flexible data types\u0000without such restrictions and which still finds efficient optimizations. Our\u0000approach centers around a single built-in type $texttt{repr}$ and function\u0000overloading with cost annotations for operation implementations. We evaluate\u0000our approach (i) by defining a universal collection type as a library, a single\u0000type for all conventional collections, and (ii) by designing and implementing a\u0000representation-flexible graph library. Programs using $texttt{repr}$ types are\u0000typically faster than programs with idiomatic representation choices --\u0000sometimes dramatically so -- as long as the compiler finds good implementations\u0000for all operations. Our compiler performs the analysis efficiently by finding\u0000optimized solutions quickly and by reusing previous results to avoid\u0000recomputations.","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":"8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142179503","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}

引用次数: 0

$μλεδ$-Calculus: A Self Optimizing Language that Seems to Exhibit Paradoxical Transfinite Cognitive Capabilities μλεδ$-微积分：一种似乎具有自相矛盾的无限认知能力的自我优化语言

arXiv - CS - Programming Languages Pub Date : 2024-09-09 DOI: arxiv-2409.05351

Ronie Salgado

{"title":"$μλεδ$-Calculus: A Self Optimizing Language that Seems to Exhibit Paradoxical Transfinite Cognitive Capabilities","authors":"Ronie Salgado","doi":"arxiv-2409.05351","DOIUrl":"https://doi.org/arxiv-2409.05351","url":null,"abstract":"Formal mathematics and computer science proofs are formalized using\u0000Hilbert-Russell-style logical systems which are designed to not admit paradoxes\u0000and self-refencing reasoning. These logical systems are natural way to describe\u0000and reason syntactic about tree-like data structures. We found that\u0000Wittgenstein-style logic is an alternate system whose propositional elements\u0000are directed graphs (points and arrows) capable of performing paraconsistent\u0000self-referencing reasoning without exploding. Imperative programming language\u0000are typically compiled and optimized with SSA-based graphs whose most general\u0000representation is the Sea of Node. By restricting the Sea of Nodes to only the\u0000data dependencies nodes, we attempted to stablish syntactic-semantic\u0000correspondences with the Lambda-calculus optimization. Surprisingly, when we\u0000tested our optimizer of the lambda calculus we performed a natural extension\u0000onto the $mulambda$ which is always terminating. This always terminating\u0000algorithm is an actual paradox whose resulting graphs are geometrical fractals,\u0000which seem to be isomorphic to original source program. These fractal\u0000structures looks like a perfect compressor of a program, which seem to resemble\u0000an actual physical black-hole with a naked singularity. In addition to these\u0000surprising results, we propose two additional extensions to the calculus to\u0000model the cognitive process of self-aware beings: 1) $epsilon$-expressions to\u0000model syntactic to semantic expansion as a general model of macros; 2)\u0000$delta$-functional expressions as a minimal model of input and output. We\u0000provide detailed step-by-step construction of our language interpreter,\u0000compiler and optimizer.","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142179504","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}

引用次数: 0

Conversational Concurrency 会话并发

arXiv - CS - Programming Languages Pub Date : 2024-09-06 DOI: arxiv-2409.04055

Tony Garnock-Jones

{"title":"Conversational Concurrency","authors":"Tony Garnock-Jones","doi":"arxiv-2409.04055","DOIUrl":"https://doi.org/arxiv-2409.04055","url":null,"abstract":"Concurrent computations resemble conversations. In a conversation,\u0000participants direct utterances at others and, as the conversation evolves,\u0000exploit the known common context to advance the conversation. Similarly,\u0000collaborating software components share knowledge with each other in order to\u0000make progress as a group towards a common goal. This dissertation studies concurrency from the perspective of cooperative\u0000knowledge-sharing, taking the conversational exchange of knowledge as a central\u0000concern in the design of concurrent programming languages. In doing so, it\u0000makes five contributions: 1. It develops the idea of a common dataspace as a\u0000medium for knowledge exchange among concurrent components, enabling a new\u0000approach to concurrent programming. While dataspaces loosely resemble both\u0000\"fact spaces\" from the world of Linda-style languages and Erlang's\u0000collaborative model, they significantly differ in many details. 2. It offers\u0000the first crisp formulation of cooperative, conversational knowledge-exchange\u0000as a mathematical model. 3. It describes two faithful implementations of the\u0000model for two quite different languages. 4. It proposes a completely novel\u0000suite of linguistic constructs for organizing the internal structure of\u0000individual actors in a conversational setting. The combination of dataspaces\u0000with these constructs is dubbed Syndicate. 5. It presents and analyzes evidence\u0000suggesting that the proposed techniques and constructs combine to simplify\u0000concurrent programming. The dataspace concept stands alone in its focus on representation and\u0000manipulation of conversational frames and conversational state and in its\u0000integral use of explicit epistemic knowledge. The design is particularly suited\u0000to integration of general-purpose I/O with otherwise-functional languages, but\u0000also applies to actor-like settings more generally.","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142179507","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}

引用次数: 0