找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Software Engineering and Formal Methods; 17th International C Peter Csaba Ölveczky,Gwen Salaün Conference proceedings 2019 Springer Nature

[复制链接]
楼主: relapse
发表于 2025-3-26 21:31:23 | 显示全部楼层
Object-Centric Process Mining: Dealing with Divergence and Convergence in Event Data and operational support are used to improve performance and compliance. Process mining starts from recorded events that are characterized by a case identifier, an activity name, a timestamp, and optional attributes like resource or costs. In many applications, there are multiple candidate identifie
发表于 2025-3-27 04:08:36 | 显示全部楼层
Relating Session Types and Behavioural Contracts: The Asynchronous Casee existence of a fully abstract interpretation of session types into a fragment of contracts, that maps session subtyping into binary compliance-preserving contract refinement. In this way, the recent undecidability result for asynchronous session subtyping can be used to obtain an original undecida
发表于 2025-3-27 09:14:20 | 显示全部楼层
发表于 2025-3-27 10:30:13 | 显示全部楼层
发表于 2025-3-27 15:29:44 | 显示全部楼层
发表于 2025-3-27 18:19:57 | 显示全部楼层
发表于 2025-3-28 01:57:54 | 显示全部楼层
发表于 2025-3-28 02:53:13 | 显示全部楼层
Mutation Testing with Hyperpropertiesodel or source code of the system under test. A test case kills a mutant if the behavior of the mutant deviates from the original system when running the test. In this work, we use hyperproperties—which allow to express relations between multiple executions—to formalize different notions of . for bo
发表于 2025-3-28 08:31:01 | 显示全部楼层
Test Model Coverage Analysis Under Uncertaintyest itself is non-deterministic. The same test case may then trigger multiple possible execution paths, depending on some internal decisions made by the software. Consequently, performing precise test analyses, e.g. to calculate the test coverage, are not possible. This can be mitigated if developer
发表于 2025-3-28 12:43:13 | 显示全部楼层
Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach problems in computer science. Although the problem is known to be NP-complete, it can be solved efficiently with a SAT solver especially when it is used incrementally. We propose an incremental SAT solving approach for DFA inference in which general heuristics of a solver for assigning free variabl
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-26 07:28
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表