发布求助
文献互助 智能选刊 最新文献

Journal of Historic Buildings and Places最新文献

筛选
英文 中文
Coinductive Big-Step Semantics for Concurrency 并发的协归纳大步语义
4区 历史学
Journal of Historic Buildings and Places Pub Date : 2013-12-10 DOI: 10.4204/EPTCS.137.6
Tarmo Uustalu
{"title":"Coinductive Big-Step Semantics for Concurrency","authors":"Tarmo Uustalu","doi":"10.4204/EPTCS.137.6","DOIUrl":"https://doi.org/10.4204/EPTCS.137.6","url":null,"abstract":"In a paper presented at SOS 2010, we developed a framework for big-step semantics for interactive input-output in combination with divergence, based on coinductive and mixed inductive-coinductive notions of resumptions, evaluation and termination-sensitive weak bisimilarity. In contrast to standard inductively defined big-step semantics, this framework handles divergence properly; in particular, runs that produce some observable effects and then diverge, are not \"lost\". Here we scale this approach for shared-variable concurrency on a simple example language. We develop the metatheory of our semantics in a constructive logic.","PeriodicalId":53164,"journal":{"name":"Journal of Historic Buildings and Places","volume":"6 1","pages":"63-78"},"PeriodicalIF":0.0,"publicationDate":"2013-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72525214","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"历史学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Static Application-Level Race Detection in STM Haskell using Contracts STM Haskell中使用契约的静态应用级竞争检测
4区 历史学
Journal of Historic Buildings and Places Pub Date : 2013-12-10 DOI: 10.4204/EPTCS.137.10
R. Demeyer, Wim Vanhoof
{"title":"Static Application-Level Race Detection in STM Haskell using Contracts","authors":"R. Demeyer, Wim Vanhoof","doi":"10.4204/EPTCS.137.10","DOIUrl":"https://doi.org/10.4204/EPTCS.137.10","url":null,"abstract":"Writing concurrent programs is a hard task, even when using high-level synchronization primitives such as transactional memories together with a functional language with well-controlled side-effects such as Haskell, because the interferences generated by the processes to each other can occur at different levels and in a very subtle way. The problem occurs when a thread leaves or exposes the shared data in an inconsistent state with respect to the application logic or the real meaning of the data. In this paper, we propose to associate contracts to transactions and we define a program transformation that makes it possible to extend static contract checking in the context of STM Haskell. As a result, we are able to check statically that each transaction of a STM Haskell program handles the shared data in a such way that a given consistency property, expressed in the form of a user-defined boolean function, is preserved. This ensures that bad interference will not occur during the execution of the concurrent program.","PeriodicalId":53164,"journal":{"name":"Journal of Historic Buildings and Places","volume":"5 1","pages":"115-134"},"PeriodicalIF":0.0,"publicationDate":"2013-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74551024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"历史学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
From Lock Freedom to Progress Using Session Types 从自由锁到使用会话类型的进程
4区 历史学
Journal of Historic Buildings and Places Pub Date : 2013-12-10 DOI: 10.4204/EPTCS.137.2
L. Padovani
{"title":"From Lock Freedom to Progress Using Session Types","authors":"L. Padovani","doi":"10.4204/EPTCS.137.2","DOIUrl":"https://doi.org/10.4204/EPTCS.137.2","url":null,"abstract":"Inspired by Kobayashi's type system for lock freedom, we define a behavioral type system for ensuring progress in a language of binary sessions. The key idea is to annotate actions in session types with priorities representing the urgency with which such actions must be performed and to verify that processes perform such actions with the required priority. Compared to related systems for session-based languages, the presented type system is relatively simpler and establishes progress for a wider range of processes.","PeriodicalId":53164,"journal":{"name":"Journal of Historic Buildings and Places","volume":"41 1","pages":"3-19"},"PeriodicalIF":0.0,"publicationDate":"2013-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77124876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"历史学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 29
Minimising virtual machine support for concurrency 最小化虚拟机对并发性的支持
4区 历史学
Journal of Historic Buildings and Places Pub Date : 2013-12-10 DOI: 10.4204/EPTCS.137.11
S. Dobson, A. Dearle, Barry Porter
{"title":"Minimising virtual machine support for concurrency","authors":"S. Dobson, A. Dearle, Barry Porter","doi":"10.4204/EPTCS.137.11","DOIUrl":"https://doi.org/10.4204/EPTCS.137.11","url":null,"abstract":"Co-operative and pre-emptive scheduling are usually considered to be complementary models of threading. In the case of virtual machines, we show that they can be unified using a single concept, the bounded execution of a thread of control, essentially providing a first-class representation of a computation as it is reduced. Furthermore this technique can be used to surface the thread scheduler of a language into the language itself, allowing programs to provide their own schedulers without any additional support in the virtual machine, and allowing the same virtual machine to support different thread models simultaneously and without re-compilation.","PeriodicalId":53164,"journal":{"name":"Journal of Historic Buildings and Places","volume":"527 1","pages":"135-141"},"PeriodicalIF":0.0,"publicationDate":"2013-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79611277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"历史学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Session Types Go Dynamic or How to Verify Your Python Conversations 会话类型变为动态或如何验证Python会话
4区 历史学
Journal of Historic Buildings and Places Pub Date : 2013-12-10 DOI: 10.4204/EPTCS.137.8
R. Neykova
{"title":"Session Types Go Dynamic or How to Verify Your Python Conversations","authors":"R. Neykova","doi":"10.4204/EPTCS.137.8","DOIUrl":"https://doi.org/10.4204/EPTCS.137.8","url":null,"abstract":"This paper presents the first implementation of session types in a dynamically-typed language - Python. Communication safety of the whole system is guaranteed at runtime by monitors that check the execution traces comply with an associated protocol. Protocols are written in Scribble, a choreography description language based on multiparty session types, with addition of logic formulas for more precise behaviour properties. The presented framework overcomes the limitations of previous works on the session types where all endpoints should be statically typed so that they do not permit interoperability with untyped participants. The advantages, expressiveness and performance of dynamic protocol checking are demonstrated through use case and benchmarks.","PeriodicalId":53164,"journal":{"name":"Journal of Historic Buildings and Places","volume":"232 1","pages":"95-102"},"PeriodicalIF":0.0,"publicationDate":"2013-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73955913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"历史学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Towards deductive verification of MPI programs against session types 针对会话类型对MPI程序进行演绎验证
4区 历史学
Journal of Historic Buildings and Places Pub Date : 2013-12-10 DOI: 10.4204/EPTCS.137.9
Eduardo R. B. Marques, F. Martins, V. Vasconcelos, Nicholas Ng, Nuno Martins
{"title":"Towards deductive verification of MPI programs against session types","authors":"Eduardo R. B. Marques, F. Martins, V. Vasconcelos, Nicholas Ng, Nuno Martins","doi":"10.4204/EPTCS.137.9","DOIUrl":"https://doi.org/10.4204/EPTCS.137.9","url":null,"abstract":"The Message Passing Interface (MPI) is the de facto standard message-passing infrastructure for developing parallel applications. Two decades after the first version of the library specification, MPI-based applications are nowadays routinely deployed on super and cluster computers. These applications, written in C or Fortran, exhibit intricate message passing behaviours, making it hard to statically verify important properties such as the absence of deadlocks. Our work builds on session types, a theory for describing protocols that provides for correct-by-construction guarantees in this regard. We annotate MPI primitives and C code with session type contracts, written in the language of a software verifier for C. Annotated code is then checked for correctness with the software verifier. We present preliminary results and discuss the challenges that lie ahead for verifying realistic MPI program compliance against session types.","PeriodicalId":53164,"journal":{"name":"Journal of Historic Buildings and Places","volume":"8 1","pages":"103-113"},"PeriodicalIF":0.0,"publicationDate":"2013-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89492641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"历史学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
The Glasgow Parallel Reduction Machine: Programming Shared-memory Many-core Systems using Parallel Task Composition 格拉斯哥并行约简机:使用并行任务组合编程共享内存多核系统
4区 历史学
Journal of Historic Buildings and Places Pub Date : 2013-12-08 DOI: 10.4204/EPTCS.137.7
Ashkan Tousimojarad, W. Vanderbauwhede
{"title":"The Glasgow Parallel Reduction Machine: Programming Shared-memory Many-core Systems using Parallel Task Composition","authors":"Ashkan Tousimojarad, W. Vanderbauwhede","doi":"10.4204/EPTCS.137.7","DOIUrl":"https://doi.org/10.4204/EPTCS.137.7","url":null,"abstract":"We present the Glasgow Parallel Reduction Machine (GPRM), a novel, flexible framework for parallel task-composition based many-core programming. We allow the programmer to structure programs into task code, written as C++ classes, and communication code, written in a restricted subset of C++ with functional semantics and parallel evaluation. In this paper we discuss the GPRM, the virtual machine framework that enables the parallel task composition approach. We focus the discussion on GPIR, the functional language used as the intermediate representation of the bytecode running on the GPRM. Using examples in this language we show the flexibility and power of our task composition framework. We demonstrate the potential using an implementation of a merge sort algorithm on a 64-core Tilera processor, as well as on a conventional Intel quad-core processor and an AMD 48-core processor system. We also compare our framework with OpenMP tasks in a parallel pointer chasing algorithm running on the Tilera processor. Our results show that the GPRM programs outperform the corresponding OpenMP codes on all test platforms, and can greatly facilitate writing of parallel programs, in particular non-data parallel algorithms such as reductions.","PeriodicalId":53164,"journal":{"name":"Journal of Historic Buildings and Places","volume":"85 1","pages":"79-94"},"PeriodicalIF":0.0,"publicationDate":"2013-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81231777","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"历史学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Session Types in Abelian Logic 会话类型在阿贝尔逻辑
4区 历史学
Journal of Historic Buildings and Places Pub Date : 2013-12-08 DOI: 10.4204/EPTCS.137.4
Yoichi Hirai
{"title":"Session Types in Abelian Logic","authors":"Yoichi Hirai","doi":"10.4204/EPTCS.137.4","DOIUrl":"https://doi.org/10.4204/EPTCS.137.4","url":null,"abstract":"There was a PhD student who says \"I found a pair of wooden shoes. I put a coin in the left and a key in the right. Next morning, I found those objects in the opposite shoes.\" We do not claim existence of such shoes, but propose a similar programming abstraction in the context of typed lambda calculi. The result, which we call the Amida calculus, extends Abramsky's linear lambda calculus LF and characterizes Abelian logic.","PeriodicalId":53164,"journal":{"name":"Journal of Historic Buildings and Places","volume":"17 1","pages":"33-52"},"PeriodicalIF":0.0,"publicationDate":"2013-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77619323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"历史学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Embedding Session Types in HML 在html中嵌入会话类型
4区 历史学
Journal of Historic Buildings and Places Pub Date : 2013-12-01 DOI: 10.4204/EPTCS.137.5
Laura Bocchi, Romain Demangeon
{"title":"Embedding Session Types in HML","authors":"Laura Bocchi, Romain Demangeon","doi":"10.4204/EPTCS.137.5","DOIUrl":"https://doi.org/10.4204/EPTCS.137.5","url":null,"abstract":"Recent work on the enhancement of multiparty session types with logical annotations enable the effective verification of properties on (1) the structure of the conversations, (2) the sorts of the messages, and (3) the actual values exchanged. In [3] we extend this work to enable the specification and verification of mutual effects of multiple cross-session interactions. Here we give a sound and complete embedding into the Hennessy-Milner logic to justify the expressiveness of the approach in [3] and to provide it with a logical background that will enable us to compare it with similar approaches.","PeriodicalId":53164,"journal":{"name":"Journal of Historic Buildings and Places","volume":"3 1","pages":"53-62"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75328384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"历史学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Modularizing and Specifying Protocols among Threads 模块化和指定线程间的协议
4区 历史学
Journal of Historic Buildings and Places Pub Date : 2013-02-25 DOI: 10.4204/EPTCS.109.6
S. Jongmans, F. Arbab
{"title":"Modularizing and Specifying Protocols among Threads","authors":"S. Jongmans, F. Arbab","doi":"10.4204/EPTCS.109.6","DOIUrl":"https://doi.org/10.4204/EPTCS.109.6","url":null,"abstract":"We identify three problems with current techniques for implementing protocols among threads, which complicate and impair the scalability of multicore software development: implementing synchronization, implementing coordination, and modularizing protocols. To mend these deficiencies, we argue for the use of domain-specific languages (DSL) based on existing models of concurrency. To demonstrate the feasibility of this proposal, we explain how to use the model of concurrency Reo as a high-level protocol DSL, which offers appropriate abstractions and a natural separation of protocols and computations. We describe a Reo-to-Java compiler and illustrate its use through examples.","PeriodicalId":53164,"journal":{"name":"Journal of Historic Buildings and Places","volume":"76 1","pages":"34-45"},"PeriodicalIF":0.0,"publicationDate":"2013-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79619722","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"历史学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信