找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: NASA Formal Methods; 11th International S Julia M. Badger,Kristin Yvonne Rozier Conference proceedings 2019 Springer Nature Switzerland AG

[复制链接]
楼主: Spring
发表于 2025-3-28 18:06:53 | 显示全部楼层
https://doi.org/10.1007/978-3-030-20652-9formal methods; model checking and theorem proving; automated static analysis; logic and verification; m
发表于 2025-3-28 19:05:52 | 显示全部楼层
Learning-Based Testing of an Industrial Measurement Device,specially deterministic systems, like Mealy machines, a variety of learning algorithm implementations is readily available. In this paper, we apply this technique to a measurement device from the automotive industry in order to systematically test its behaviour. However, our system under learning sh
发表于 2025-3-29 02:08:12 | 显示全部楼层
: A Distributed Real-Time Modal Logic,asically be located at several computers spread over a communication network. Extensions of Timed Modal Logics (.) such as, Timed Propositional Modal Logic (.), Timed Modal .-calculus and . have been proposed to capture timed and temporal properties in real-time systems. However, these logics rely o
发表于 2025-3-29 03:11:07 | 显示全部楼层
Local Reasoning for Parameterized First Order Protocols,rameterized distributed systems. However, specifying many natural objects, such as a ring topology, in FOL is unexpectedly inconvenient. We present a framework based on FOL for specifying distributed multi-process protocols in a process-local manner together with an implicit network topology. In the
发表于 2025-3-29 08:37:06 | 显示全部楼层
Generation of Signals Under Temporal Constraints for CPS Testing,o difficult to treat symbolically, meaning that the only reasonable option is to sample a finite number of input signals and simulate the corresponding system behaviours. It is important to choose a sample so that it best “covers” the whole input signal space. We use timed automata to model temporal
发表于 2025-3-29 12:19:07 | 显示全部楼层
发表于 2025-3-29 16:44:15 | 显示全部楼层
发表于 2025-3-29 21:43:56 | 显示全部楼层
Using Standard Typing Algorithms Incrementally,er, the ever-growing size of programs and their continuous evolution require building fast and efficient analysers. A promising solution is ., aiming at only re-typing the ., i.e. those parts of the program that change or are inserted, rather than the entire codebase. We propose an algorithmic schem
发表于 2025-3-30 01:02:15 | 显示全部楼层
发表于 2025-3-30 04:26:25 | 显示全部楼层
Automated Backend Selection for , Using Deep Learning,eature different backends and configuration options. Selecting an appropriate configuration for a successful employment becomes increasingly hard. In this article, we use machine learning methods to automate the backend selection for the . model checker. In particular, we explore different approache
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-27 11:57
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表