International Conference on Information and Computation Economies最新文献

The Right Kind of Non-Determinism: Using Concurrency to Verify C Programs with Underspecified Semantics 正确的非确定性:使用并发性来验证具有未指定语义的C程序

International Conference on Information and Computation Economies Pub Date : 2022-08-08 DOI: 10.4204/EPTCS.365.1

Eduard Kamburjan, Nathan Wasser

{"title":"The Right Kind of Non-Determinism: Using Concurrency to Verify C Programs with Underspecified Semantics","authors":"Eduard Kamburjan, Nathan Wasser","doi":"10.4204/EPTCS.365.1","DOIUrl":"https://doi.org/10.4204/EPTCS.365.1","url":null,"abstract":"We present a novel and well automatable approach to formal verification of C programs with underspecified semantics, i.e., a language semantics that leaves open the order of certain evaluations. First, we reduce this problem to non-determinism of concurrent systems, automatically extracting a distributed Active Object model from underspecified, sequential C code. This translation process provides a fully formal semantics for the considered C subset. In the extracted model every non-deterministic choice corresponds to one possible evaluation order. This step also automatically translates specifications in the ANSI/ISO C Specification Language (ACSL) into method contracts and object invariants for Active Objects. We then perform verification on the specified Active Objects model, using the Crowbar theorem prover, which verifies the extracted model with respect to the translated specification and ensures the original property of the C code for all possible evaluation orders. By using model extraction, we can use standard tools, without designing a new complex program logic to deal with underspecification. The case study used is highly underspecified and cannot be handled correctly by existing tools for C.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116332270","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

Lang-n-Send Extended: Sending Regular Expressions to Monitors Lang-n-Send Extended:向监视器发送正则表达式

International Conference on Information and Computation Economies Pub Date : 2022-08-08 DOI: 10.4204/EPTCS.365.5

M. Cimini

引用次数: 0

Session Fidelity for ElixirST: A Session-Based Type System for Elixir Modules ElixirST的会话保真:Elixir模块的基于会话的类型系统

International Conference on Information and Computation Economies Pub Date : 2022-08-08 DOI: 10.4204/EPTCS.365.2

Gerard Tabone, Adrian Francalanza

引用次数: 1

On Composing Communicating Systems 论构成通信系统

International Conference on Information and Computation Economies Pub Date : 2022-08-08 DOI: 10.4204/EPTCS.365.4

F. Barbanera, Ivan Lanese, E. Tuosto

{"title":"On Composing Communicating Systems","authors":"F. Barbanera, Ivan Lanese, E. Tuosto","doi":"10.4204/EPTCS.365.4","DOIUrl":"https://doi.org/10.4204/EPTCS.365.4","url":null,"abstract":"Communication is an essential element of modern software, yet programming and analysing communicating systems are difficult tasks. A reason for this difficulty is the lack of compositional mechanisms that preserve relevant communication properties. This problem has been recently addressed for the well-known model of communicating systems, that is sets of components consisting of finite-state machines capable of exchanging messages. The main idea of this approach is to take two systems, select a participant from each of them, and derive from those participants a pair of coupled gateways connecting the two systems. More precisely, a message directed to one of the gateways is forwarded to the gateway in the other system, which sends it to the other system. It has been shown that, under some suitable compatibility conditions between gateways, this composition mechanism preserves deadlock freedom for asynchronous as well as symmetric synchronous communications (where sender and receiver play the same part in determining which message to exchange). This paper considers the case of asymmetric synchronous communications where senders decide independently which message should be exchanged. We show here that preservation of lock freedom requires sequentiality of gateways, while this is not needed for preservation of either deadlock freedom or strong lock freedom.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124282589","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}

引用次数: 2

Branching Pomsets for Choreographies 用于编排的分支集合

International Conference on Information and Computation Economies Pub Date : 2022-08-08 DOI: 10.4204/EPTCS.365.3

L. Edixhoven, S. Jongmans, J. Proença, G. Cledou

引用次数: 6

Deadlock Freedom for Asynchronous and Cyclic Process Networks 异步和循环进程网络的死锁自由

International Conference on Information and Computation Economies Pub Date : 2021-10-01 DOI: 10.4204/EPTCS.347.3

B. V. D. Heuvel, Jorge A. P'erez

引用次数: 4

Typestates to Automata and back: a tool 类型状态到自动机和返回:一个工具

International Conference on Information and Computation Economies Pub Date : 2020-09-17 DOI: 10.4204/EPTCS.324.4

Andr'e Trindade, João Mota, A. Ravara

{"title":"Typestates to Automata and back: a tool","authors":"Andr'e Trindade, João Mota, A. Ravara","doi":"10.4204/EPTCS.324.4","DOIUrl":"https://doi.org/10.4204/EPTCS.324.4","url":null,"abstract":"Development of software is an iterative process. Graphical tools to represent the relevant entities and processes can be helpful. In particular, automata capture well the intended execution flow of applications, and are thus behind many formal approaches, namely behavioral types. \u0000Typestate-oriented programming allow us to model and validate the intended protocol of applications, not only providing a top-down approach to the development of software, but also coping well with compositional development. Moreover, it provides important static guarantees like protocol fidelity and some forms of progress. \u0000Mungo is a front-end tool for Java that associates a typestate describing the valid orders of method calls to each class, and statically checks that the code of all classes follows the prescribed order of method calls. \u0000To assist programming with Mungo, as typestates are textual descriptions that are terms of an elaborate grammar, we developed a tool that bidirectionally converts typestates into an adequate form of automata, providing on one direction a visualization of the underlying protocol specified by the typestate, and on the reverse direction a way to get a syntactically correct typestate from the more intuitive automata representation.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128989085","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}

引用次数: 5

Towards Refinable Choreographies 走向可提炼的舞蹈编排

International Conference on Information and Computation Economies Pub Date : 2020-09-17 DOI: 10.4204/EPTCS.324.6

Ugo de'Liguoro, Hernán C. Melgratti, E. Tuosto

引用次数: 2

A type language for message passing component-based systems 用于消息传递基于组件的系统的类型语言

International Conference on Information and Computation Economies Pub Date : 2020-09-17 DOI: 10.4204/EPTCS.324.3

Zorica Savanovi'c, Letterio Galletta, H. Vieira

引用次数: 5

A Note On Compliance Relations And Fixed Points 关于遵从关系和不动点的注解

International Conference on Information and Computation Economies Pub Date : 2019-09-12 DOI: 10.4204/EPTCS.304.3

Maurizio Murgia

引用次数: 4