国产bbaaaaa片,成年美女黄网站色视频免费,成年黄大片,а天堂中文最新一区二区三区,成人精品视频一区二区三区尤物

首頁> 外文期刊>Software and systems modeling >Specification and automated verification of atomic concurrent real-time transactions
【24h】

Specification and automated verification of atomic concurrent real-time transactions

機(jī)譯:規(guī)范和自動(dòng)驗(yàn)證原子并發(fā)實(shí)時(shí)交易

獲取原文
獲取原文并翻譯 | 示例

摘要

Many database management systems (DBMS) need to ensure atomicity and isolation of transactions for logical data consistency, as well as to guarantee temporal correctness of the executed transactions. Since the mechanisms for atomicity and isolation may lead to breaching temporal correctness, trade-offs between these properties are often required during the DBMS design. To be able to address this concern, we have previously proposed the pattern-based UPPCART framework, which models the transactions and the DBMS mechanisms as timed automata, and verifies the trade-offs with provable guarantee. However, the manual construction of UPPCART models can require considerable effort and is prone to errors. In this paper, we advance the formal analysis of atomic concurrent real-time transactions with tool-automated construction of UPPCART models. The latter are generated automatically from our previously proposed UTRAN specifications, which are high-level UML-based specifications familiar to designers. To achieve this, we first propose formal definitions for the modeling patterns in UPPCART, as well as for the pattern-based construction of DBMS models, respectively. Based on this, we establish a translational semantics from UTRAN specifications to UPPCART models, to provide the former with a formal semantics relying on timed automata, and develop a tool that implements the automated transformation. We also extend the expressiveness of UTRAN and UPPCART, to incorporate transaction sequences and their timing properties. We demonstrate the specification in UTRAN, automated transformation to UPPCART, and verification of the traded-off properties, via an industrial use case.
機(jī)譯:許多數(shù)據(jù)庫管理系統(tǒng)(DBMS)需要確保邏輯數(shù)據(jù)一致性的原子性和分離事務(wù),并保證執(zhí)行的事務(wù)的時(shí)間正確性。由于原子學(xué)和隔離的機(jī)制可能導(dǎo)致突破時(shí)間正確性,因此在DBMS設(shè)計(jì)期間通常需要這些性質(zhì)之間的折衷。為了能夠解決這個(gè)問題,我們之前提出了基于模式的UPPCart框架,將事務(wù)和DBMS機(jī)制模擬為定時(shí)自動(dòng)機(jī),并驗(yàn)證具有可提供保證的權(quán)衡。但是,UPPCART模型的手動(dòng)構(gòu)建可能需要相當(dāng)大的努力并且容易出錯(cuò)。在本文中,我們推進(jìn)了與UPPCART模型的工具自動(dòng)構(gòu)造的原子并發(fā)實(shí)時(shí)交易正式分析。后者從我們先前提出的UTRAN規(guī)范中自動(dòng)生成,這些規(guī)范是設(shè)計(jì)人員熟悉的基于UML的高級(jí)UML的規(guī)范。為此,我們首先提出了UPPCART中的建模模式的正式定義,以及DBMS模型的模式構(gòu)造。基于此,我們建立了從UTRAN規(guī)范到UPPCART模型的翻譯語義,為前者提供了一個(gè)正式的語義,依賴于定時(shí)自動(dòng)機(jī),并開發(fā)一個(gè)實(shí)現(xiàn)自動(dòng)轉(zhuǎn)換的工具。我們還擴(kuò)展了UTRAN和UPPCART的表現(xiàn)力,并包含事務(wù)序列及其時(shí)序?qū)傩浴N覀兺ㄟ^工業(yè)用例展示了UTRAN,自動(dòng)轉(zhuǎn)換的規(guī)范,并通過工業(yè)用例驗(yàn)證了貿(mào)易場(chǎng)所。

著錄項(xiàng)

獲取原文

客服郵箱:kefu@zhangqiaokeyan.com

京公網(wǎng)安備:11010802029741號(hào) ICP備案號(hào):京ICP備15016152號(hào)-6 六維聯(lián)合信息科技 (北京) 有限公司?版權(quán)所有
  • 客服微信

  • 服務(wù)號(hào)