Catalysis Surveys from Japan最新文献

A Tool for Describing and Checking Natural Semantics Definitions of Programming Languages 描述和检查程序设计语言的自然语义定义的工具

Catalysis Surveys from Japan Pub Date : 2022-09-20 DOI: 10.4204/EPTCS.369.4

Georgian-Vlad Saioc, Hans Hüttel

{"title":"A Tool for Describing and Checking Natural Semantics Definitions of Programming Languages","authors":"Georgian-Vlad Saioc, Hans Hüttel","doi":"10.4204/EPTCS.369.4","DOIUrl":"https://doi.org/10.4204/EPTCS.369.4","url":null,"abstract":"Many universities have courses and projects revolving around compiler or interpreter implementation as part of their degree programmes in computer science. In such teaching activities, tool support can be highly beneficial. While there are already several tools for assisting with development of the front end of compilers, tool support tapers off towards the back end, or requires more background experience than is expected of undergraduate students. Structural operational semantics is a useful and mathematically simple formalism for specifying the behaviour of programs and a specification lends itself well to implementation; in particular big-step or natural semantics is often a useful and simple approach. However, many students struggle with learning the notation and often come up with ill-defined and meaningless attempts at defining a structural operational semantics. A survey shows that students working on programming language projects feel that tool support is lacking and would be useful. Many of these problems encountered when developing a semantic definition are similar to problems encountered in programming, in particular ones that are essentially the result of type errors. We present a pedagogical metalanguage based on natural semantics, and its implementation, as an attempt to marry two notions: a syntax similar to textbook notation for natural semantics on the one hand, and automatic verification of some correctness properties on the other by means of a strong type discipline. The metalanguage and the tool provide the facilities for writing and executing specifications as a form of programming. The user can check that the specification is not meaningless as well as execute programs, if the specification makes sense.","PeriodicalId":9644,"journal":{"name":"Catalysis Surveys from Japan","volume":"87 10 1","pages":"51-66"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91122385","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

Synthesis of Cost-Optimal Multi-Agent Systems for Resource Allocation 资源分配中成本最优多智能体系统的综合

Catalysis Surveys from Japan Pub Date : 2022-09-20 DOI: 10.4204/EPTCS.369.5

Nils Timm, J. Botha

{"title":"Synthesis of Cost-Optimal Multi-Agent Systems for Resource Allocation","authors":"Nils Timm, J. Botha","doi":"10.4204/EPTCS.369.5","DOIUrl":"https://doi.org/10.4204/EPTCS.369.5","url":null,"abstract":"Multi-agent systems for resource allocation (MRAs) have been introduced as a concept for modelling competitive resource allocation problems in distributed computing. An MRA is composed of a set of agents and a set of resources. Each agent has goals in terms of allocating certain resources. For MRAs it is typically of importance that they are designed in a way such that there exists a strategy that guarantees that all agents will achieve their goals. The corresponding model checking problem is to determine whether such a winning strategy exists or not, and the synthesis problem is to actually build the strategy. While winning strategies ensure that all goals will be achieved, following such strategies does not necessarily involve an optimal use of resources. In this paper, we present a technique that allows to synthesise cost-optimal solutions to distributed resource allocation problems. We consider a scenario where system components such as agents and resources involve costs. A multi-agent system shall be designed that is cost-minimal but still capable of accomplishing a given set of goals. Our approach synthesises a winning strategy that minimises the cumulative costs of the components that are required for achieving the goals. The technique is based on a propositional logic encoding and a reduction of the synthesis problem to the maximum satisfiability problem (Max-SAT). Hence, a Max-SAT solver can be used to perform the synthesis. From a truth assignment that maximises the number of satisfied clauses of the encoding a cost-optimal winning strategy as well as a cost-optimal system can be immediately derived.","PeriodicalId":9644,"journal":{"name":"Catalysis Surveys from Japan","volume":"90 1","pages":"67-82"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76308050","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

Correctness of Broadcast via Multicast: Graphically and Formally 通过多播广播的正确性:图形化和形式化

Catalysis Surveys from Japan Pub Date : 2022-09-20 DOI: 10.4204/EPTCS.369.3

W. Jeltsch, Javier D'iaz

{"title":"Correctness of Broadcast via Multicast: Graphically and Formally","authors":"W. Jeltsch, Javier D'iaz","doi":"10.4204/EPTCS.369.3","DOIUrl":"https://doi.org/10.4204/EPTCS.369.3","url":null,"abstract":"Maintaining data consistency among multiple parties requires nodes to repeatedly send data to all other nodes. For example, the nodes of a blockchain network have to disseminate the blocks they create across the whole network. The scientific literature typically takes the ideal perspective that such data distribution is performed by broadcasting to all nodes directly, while in practice data is distributed by repeated multicast. Since correctness and security of consistency maintenance protocols usually have been established for the ideal setting only, it is vital to show that these properties carry over to real-world implementations. Therefore, it is desirable to prove that the ideal and the real behavior are equivalent. In the work described in this paper, we take an important step towards such a proof by proving a simpler variant of this equivalence statement. The simplification is that we consider only a concrete pair of network topologies, which nevertheless illustrates important phenomena encountered with arbitrary topologies. For describing systems that distribute data, we use a domain-specific language of processes that corresponds to a class of Petri nets and is embedded in a general-purpose process calculus. This way, we can outline our proof using an intuitive graphical notation and leverage the rich theory of process calculi in the actual proof, which is machine-checked using the Isabelle proof assistant.","PeriodicalId":9644,"journal":{"name":"Catalysis Surveys from Japan","volume":"13 1","pages":"37-50"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79505202","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}

引用次数: 1

Mechanizing Matching Logic in Coq Coq中匹配逻辑的机械化

Catalysis Surveys from Japan Pub Date : 2022-01-15 DOI: 10.4204/EPTCS.369.2

Péter Bereczky, Xiaohong Chen, D'aniel Horp'acsi, Tam'as B'alint Mizsei, Lucas Peña, Jan Tusil

引用次数: 1

Proof-Carrying Parameters in Certified Symbolic Execution: The Case Study of Antiunification 证明符号执行中的携带证明参数:以反统一为例

Catalysis Surveys from Japan Pub Date : 2021-10-22 DOI: 10.4204/EPTCS.369.1

Andrei Arusoaie, D. Lucanu

引用次数: 1

Gröbner Bases with Reduction Machines Gröbner基地与还原机

Catalysis Surveys from Japan Pub Date : 2019-09-02 DOI: 10.4204/EPTCS.303.5

Georgiana Surlea, A. Craciun