arXiv - CS - Logic in Computer Science最新文献_第4页

Non-deterministic, probabilistic, and quantum effects through the lens of event structures (Technical report) 从事件结构透视非确定性、概率和量子效应（技术报告）

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-26 DOI: arxiv-2408.14563

Vítor Fernandes, Marc de Visme, Benoît Valiron

引用次数: 0

Instrumenting Transaction Trace Properties in Smart Contracts: Extending the EVM for Real-Time Security 智能合约中的交易跟踪属性工具：为实时安全扩展 EVM

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-26 DOI: arxiv-2408.14621

Zhiyang Chen, Jan Gorzny, Martin Derka

{"title":"Instrumenting Transaction Trace Properties in Smart Contracts: Extending the EVM for Real-Time Security","authors":"Zhiyang Chen, Jan Gorzny, Martin Derka","doi":"arxiv-2408.14621","DOIUrl":"https://doi.org/arxiv-2408.14621","url":null,"abstract":"In the realm of smart contract security, transaction malice detection has\u0000been able to leverage properties of transaction traces to identify hacks with\u0000high accuracy. However, these methods cannot be applied in real-time to revert\u0000malicious transactions. Instead, smart contracts are often instrumented with\u0000some safety properties to enhance their security. However, these instrumentable\u0000safety properties are limited and fail to block certain types of hacks such as\u0000those which exploit read-only re-entrancy. This limitation primarily stems from\u0000the Ethereum Virtual Machine's (EVM) inability to allow a smart contract to\u0000read transaction traces in real-time. Additionally, these instrumentable safety\u0000properties can be gas-intensive, rendering them impractical for on-the-fly\u0000validation. To address these challenges, we propose modifications to both the\u0000EVM and Ethereum clients, enabling smart contracts to validate these\u0000transaction trace properties in real-time without affecting traditional EVM\u0000execution. We also use past-time linear temporal logic (PLTL) to formalize\u0000transaction trace properties, showcasing that most existing detection metrics\u0000can be expressed using PLTL. We also discuss the potential implications of our\u0000proposed modifications, emphasizing their capacity to significantly enhance\u0000smart contract security.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"57 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142192516","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

Logic interpretations of ANN partition cells ANN 分区单元的逻辑解释

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-26 DOI: arxiv-2408.14314

Ingo Schmitt

引用次数: 0

Temporal Ensemble Logic 时态组合逻辑

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-26 DOI: arxiv-2408.14443

Guo-Qiang Zhang

{"title":"Temporal Ensemble Logic","authors":"Guo-Qiang Zhang","doi":"arxiv-2408.14443","DOIUrl":"https://doi.org/arxiv-2408.14443","url":null,"abstract":"We introduce Temporal Ensemble Logic (TEL), a monadic, first-order modal\u0000logic for linear-time temporal reasoning. TEL includes primitive temporal\u0000constructs such as ``always up to $t$ time later'' ($Box_t$), ``sometimes\u0000before $t$ time in the future'' ($Diamond_t$), and ``$t$-time later''\u0000$varphi_t$. TEL has been motivated from the requirement for rigor and\u0000reproducibility for cohort specification and discovery in clinical and\u0000population health research, to fill a gap in formalizing temporal reasoning in\u0000biomedicine. In this paper, we first introduce TEL in a general set up, with\u0000discrete and dense time as special cases. We then focus on the theoretical\u0000development of discrete TEL on the temporal domain of positive integers\u0000$mathbb{N}^+$, denoted as ${rm TEL}_{mathbb{N}^+}$. ${rm\u0000TEL}_{mathbb{N}^+}$ is strictly more expressive than the standard monadic\u0000second order logic, characterized by B\"{u}chi automata. We present its formal\u0000semantics, a proof system, and provide a proof for the undecidability of the\u0000satisfiability of ${rm TEL}_{mathbb{N}^+}$. We also discuss expressiveness\u0000and decidability fragments for ${rm TEL}_{mathbb{N}^+}$, followed by\u0000illustrative applications.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"7 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142192519","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

Machine Learning for Quantifier Selection in cvc5 cvc5 中用于量词选择的机器学习

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-26 DOI: arxiv-2408.14338

Jan Jakubův, Mikoláš Janota, Jelle Piepenbrock, Josef Urban

引用次数: 0

Model-checking positive equality free logic on a fixed structure (direttissima) 对固定结构上的正相等自由逻辑进行模型检查（direttissima）

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-25 DOI: arxiv-2408.13840

Manuel Bodirsky, Marcin Kozik, Florent Madelaine, Barnaby Martin, Michal Wrona

{"title":"Model-checking positive equality free logic on a fixed structure (direttissima)","authors":"Manuel Bodirsky, Marcin Kozik, Florent Madelaine, Barnaby Martin, Michal Wrona","doi":"arxiv-2408.13840","DOIUrl":"https://doi.org/arxiv-2408.13840","url":null,"abstract":"We give a new, direct proof of the tetrachotomy classification for the\u0000model-checking problem of positive equality-free logic parameterised by the\u0000model. The four complexity classes are Logspace, NP-complete, co-NP-complete\u0000and Pspace-complete. The previous proof of this result relied on notions from\u0000universal algebra and core-like structures called U-X-cores. This new proof\u0000uses only relations, and works for infinite structures also in the distinction\u0000between Logspace and NP-hard under Turing reductions. For finite domains, the membership in NP and co-NP follows from a simple\u0000argument, which breaks down already over an infinite set with a binary\u0000relation. We develop some interesting new algorithms to solve NP and co-NP\u0000membership for a variety of infinite structures. We begin with those\u0000first-order definable in (Q;=), the so-called equality languages, then move to\u0000those first-order definable in (Q;<), the so-called temporal languages.\u0000However, it is first-order expansions of the Random Graph (V,E) that provide\u0000the most interesting examples. In all of these cases, the derived\u0000classification is a tetrachotomy between Logspace, NP-complete, co-NP-complete\u0000and Pspace-complete.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"75 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142192523","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

An Overview and Comparison of Axiomatization Structures Regarding Inconsistency Indices' Properties in Pairwise Comparisons Methods 关于成对比较方法中不一致指数特性的公理化结构概述与比较

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-23 DOI: arxiv-2408.13297

Sangeeta Pant, Anuj Kumar, Jiří Mazurek

{"title":"An Overview and Comparison of Axiomatization Structures Regarding Inconsistency Indices' Properties in Pairwise Comparisons Methods","authors":"Sangeeta Pant, Anuj Kumar, Jiří Mazurek","doi":"arxiv-2408.13297","DOIUrl":"https://doi.org/arxiv-2408.13297","url":null,"abstract":"Mathematical analysis of the analytic hierarchy process (AHP) led to the\u0000development of a mathematical function, usually called the inconsistency index,\u0000which has the center role in measuring the inconsistency of the judgements in\u0000AHP. Inconsistency index is a mathematical function which maps every pairwise\u0000comparison matrix (PCM) into a real number. An inconsistency index can be\u0000considered more trustworthy when it satisfies a set of suitable properties.\u0000Therefore, the research community has been trying to postulate a set of\u0000desirable rules (axioms, properties) for inconsistency indices. Subsequently,\u0000many axiomatic frameworks for these functions have been suggested\u0000independently, however, the literature on the topic is fragmented and missing a\u0000broader framework. Therefore, the objective of this article is twofold.\u0000Firstly, we provide a comprehensive review of the advancements in the\u0000axiomatization of inconsistency indices' properties during the last decade.\u0000Secondly, we provide a comparison and discussion of the aforementioned\u0000axiomatic structures along with directions of the future research.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"13 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142192527","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

Input-based Framework for Three-valued Abstraction Refinement 基于输入的三值抽象细化框架

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-22 DOI: arxiv-2408.12668

Jan Onderka

引用次数: 0

The Bright Side of Timed Opacity 定时不透明的光明面

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-22 DOI: arxiv-2408.12240

Étienne André, Sarah Dépernet, Engel Lefaucheux

引用次数: 0

Invariants for One-Counter Automata with Disequality Tests 具有二义性检验的单计数器自动机的不变式

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-21 DOI: arxiv-2408.11908

Dmitry Chistikov, Jérôme Leroux, Henry Sinclair-Banks, Nicolas Waldburger

{"title":"Invariants for One-Counter Automata with Disequality Tests","authors":"Dmitry Chistikov, Jérôme Leroux, Henry Sinclair-Banks, Nicolas Waldburger","doi":"arxiv-2408.11908","DOIUrl":"https://doi.org/arxiv-2408.11908","url":null,"abstract":"We study the reachability problem for one-counter automata in which\u0000transitions can carry disequality tests. A disequality test is a guard that\u0000prohibits a specified counter value. This reachability problem has been known\u0000to be NP-hard and in PSPACE, and characterising its computational complexity\u0000has been left as a challenging open question by Almagor, Cohen, P'erez,\u0000Shirmohammadi, and Worrell (2020). We reduce the complexity gap, placing the\u0000problem into the second level of the polynomial hierarchy, namely into the\u0000class $mathsf{coNP}^{mathsf{NP}}$. In the presence of both equality and\u0000disequality tests, our upper bound is at the third level,\u0000$mathsf{P}^{mathsf{NP}^{mathsf{NP}}}$. To prove this result, we show that non-reachability can be witnessed by a\u0000pair of invariants (forward and backward). These invariants are almost\u0000inductive. They aim to over-approximate only a \"core\" of the reachability set\u0000instead of the entire set. The invariants are also leaky: it is possible to\u0000escape the set. We complement this with separate checks as the leaks can only\u0000occur in a controlled way.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"70 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142192518","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