標(biāo)題: Titlebook: NASA Formal Methods; 11th International S Julia M. Badger,Kristin Yvonne Rozier Conference proceedings 2019 Springer Nature Switzerland AG [打印本頁] 作者: Spring 時(shí)間: 2025-3-21 16:49
書目名稱NASA Formal Methods影響因子(影響力)
書目名稱NASA Formal Methods影響因子(影響力)學(xué)科排名
書目名稱NASA Formal Methods網(wǎng)絡(luò)公開度
書目名稱NASA Formal Methods網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱NASA Formal Methods被引頻次
書目名稱NASA Formal Methods被引頻次學(xué)科排名
書目名稱NASA Formal Methods年度引用
書目名稱NASA Formal Methods年度引用學(xué)科排名
書目名稱NASA Formal Methods讀者反饋
書目名稱NASA Formal Methods讀者反饋學(xué)科排名
作者: Mhc-Molecule 時(shí)間: 2025-3-21 23:05 作者: constitutional 時(shí)間: 2025-3-22 03:46
Towards Full Proof Automation in Frama-C Using Auto-active Verification,cally verified with interactive provers. Based on our experience, we discuss the benefits of this methodology and the current limitations of the tool, as well as proposals of new features to overcome them.作者: 拱墻 時(shí)間: 2025-3-22 07:59 作者: Hyaluronic-Acid 時(shí)間: 2025-3-22 09:46 作者: Affluence 時(shí)間: 2025-3-22 15:09 作者: 消滅 時(shí)間: 2025-3-22 18:28
Data Independence for Software Transactional Memory,ove that opacity as a correctness criterion is data independent. Second, we develop conditions for checking data independence of STM algorithms and show their soundness. Together, these results allow to reduce model checking (of data independent STMs) to transactions with a single choice for values 作者: 符合你規(guī)定 時(shí)間: 2025-3-22 23:22 作者: HOWL 時(shí)間: 2025-3-23 01:34 作者: META 時(shí)間: 2025-3-23 09:18 作者: 搖曳的微光 時(shí)間: 2025-3-23 12:41 作者: 全部 時(shí)間: 2025-3-23 14:05 作者: 拍翅 時(shí)間: 2025-3-23 18:36 作者: Magisterial 時(shí)間: 2025-3-23 23:12 作者: RAG 時(shí)間: 2025-3-24 03:37 作者: BILE 時(shí)間: 2025-3-24 07:32
Nils Jansen,Laura Humphrey,Jana Tumova,Ufuk Topcuound NOM may incorporate viable (metabolically active) microbial cells, which would endow the structure with some level of biologically induced activity. Such colloids may be viewed as biocolloids be-cause they possess a resident and active biological community, albeit limited to a few cells in each作者: detach 時(shí)間: 2025-3-24 10:56 作者: 行業(yè) 時(shí)間: 2025-3-24 16:50
Jürgen K?nig,Heike Wehrheimalaria have been effectively controlled. However, one of the unforeseen consequences of widespread insecticide use has been the rise in insect resistance over the past 50 years. New research into the secondary effects of insecticides has also uncovered other unforeseen consequences such as endocrine作者: 遺留之物 時(shí)間: 2025-3-24 22:38 作者: Deadpan 時(shí)間: 2025-3-25 00:11
Bernhard K. Aichernig,Christian Burghard,Robert Koro?ec作者: 加入 時(shí)間: 2025-3-25 04:28
Suda Bharadwaj,Steven Carr,Natasha Neogi,Hasan Poonawala,Alejandro Barberia Chueca,Ufuk Topcu作者: 恭維 時(shí)間: 2025-3-25 08:25
Allan Blanchard,Frédéric Loulergue,Nikolai Kosmatov作者: 要塞 時(shí)間: 2025-3-25 15:32 作者: NIL 時(shí)間: 2025-3-25 15:54
Using Binary Analysis Frameworks: The Case for BAP and angr,rand Challenge. We describe a number of experiments to evaluate the capabilities of the two tools. We have implemented a value-set analysis and a call graph comparison algorithm with each tool, and report on their performance, usability, and extensibility for real-world applications.作者: GOAD 時(shí)間: 2025-3-25 23:40 作者: 印第安人 時(shí)間: 2025-3-26 02:16
Design and Runtime Verification Side-by-Side in eTrice, At the request of the developers of eTrice, we have incorporated model checking in their tool chain, by partly reusing the existing runtime verification architecture. We report on the implementation of the tool, experiments that we conducted, and lessons learned regarding the synergies between the two verification techniques.作者: assent 時(shí)間: 2025-3-26 06:43 作者: sundowning 時(shí)間: 2025-3-26 11:34
Clausal Proofs of Mutilated Chessboards,t is much easier to compute and that can be expressed within the recent (clausal) . proof system for?propositional logic. We construct short clausal proofs of mutilated chessboard problems using this new argument and validate them using a formally-verified proof checker.作者: ethnology 時(shí)間: 2025-3-26 12:46
Extracting and Optimizing Formally Verified Code for Systems Programming,ity with memory and runtime performance. By handling effectful and pure functions separately MCQC can generate executable verified code directly from Gallina, reducing the effort of implementing and executing verified systems.作者: heirloom 時(shí)間: 2025-3-26 18:47 作者: 刀鋒 時(shí)間: 2025-3-26 22:01 作者: 真實(shí)的你 時(shí)間: 2025-3-27 02:16 作者: GREG 時(shí)間: 2025-3-27 06:34
Model Checking of Verilog RTL Using IC3 with Syntax-Guided Abstraction,, SA aligns easily with data abstraction using uninterpreted functions. We demonstrate how IC3+SA with data abstraction allows reasoning that is completely independent of the bit width of variables, and becomes scalable irrespective of the state-space size or complexity of operations.作者: Increment 時(shí)間: 2025-3-27 10:44 作者: wreathe 時(shí)間: 2025-3-27 16:54
Transaction Protocol Verification with Labeled Synchronization Logic,irectly capture orders that are fundamental to the correctness of transactions. We present a denotational semantics for the language and prove the soundness of the logic. We have formalized the logic in the PVS proof assistant and mechanically constructed the challenging correctness proof of the TL2 TM algorithm.作者: hazard 時(shí)間: 2025-3-27 21:11
Learning-Based Testing of an Industrial Measurement Device,automata learning framework which masks this non-determinism. We repeat a previous model-based testing experiment with faulty devices and show that we can detect all injected faults. Most importantly, our technique was also able to find unknown bugs.作者: Amorous 時(shí)間: 2025-3-28 01:03 作者: 沒血色 時(shí)間: 2025-3-28 04:34
978-3-030-20651-2Springer Nature Switzerland AG 2019作者: 令人悲傷 時(shí)間: 2025-3-28 07:53 作者: phase-2-enzyme 時(shí)間: 2025-3-28 10:53 作者: 省略 時(shí)間: 2025-3-28 18:06
https://doi.org/10.1007/978-3-030-20652-9formal methods; model checking and theorem proving; automated static analysis; logic and verification; m作者: 生來 時(shí)間: 2025-3-28 19:05
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作者: 無政府主義者 時(shí)間: 2025-3-29 02:08
: 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作者: 附錄 時(shí)間: 2025-3-29 03:11
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作者: FILLY 時(shí)間: 2025-3-29 08:37
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作者: 否認(rèn) 時(shí)間: 2025-3-29 12:19 作者: 詞匯表 時(shí)間: 2025-3-29 16:44 作者: Fissure 時(shí)間: 2025-3-29 21:43
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作者: 紅腫 時(shí)間: 2025-3-30 01:02 作者: 水槽 時(shí)間: 2025-3-30 04:26
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作者: Certainty 時(shí)間: 2025-3-30 08:33 作者: 一致性 時(shí)間: 2025-3-30 13:53 作者: grudging 時(shí)間: 2025-3-30 17:32
Towards a Two-Layer Framework for Verifying Autonomous Vehicles, ensured through formal verification. To facilitate the verification, it is beneficial to decouple the static high-level planning from the dynamic functions like collision avoidance. In this paper, we propose a conceptual two-layer framework for verifying autonomous vehicles, which consists of a sta作者: gentle 時(shí)間: 2025-3-30 23:42
Clausal Proofs of Mutilated Chessboards,in exponential runtime of current SAT solvers. Although there exists a well-known short argument for solving mutilated chessboard problems, this argument is based on an abstraction that is challenging to discover by automated-reasoning techniques. In this paper, we present another short argument tha作者: seroma 時(shí)間: 2025-3-31 02:51
Practical Causal Models for Cyber-Physical Systems,d social context, rendering these faults harder to diagnose. To complicate matters further, knowledge about the behavior and failure modes of a system are often collected in different models. We show how three of those models, namely attack trees, fault trees, and timed failure propagation graphs ca作者: 商店街 時(shí)間: 2025-3-31 06:14 作者: 新義 時(shí)間: 2025-3-31 10:18
Structured Synthesis for Probabilistic Systems,system configuration. We define the structured synthesis problem as a nonlinear programming problem (NLP) with integer variables. As solving NLPs is not feasible in general, we present an alternative approach. A transformation of models specified in the PRISM probabilistic programming language creat作者: incontinence 時(shí)間: 2025-3-31 16:54
Design and Runtime Verification Side-by-Side in eTrice,lopment of solutions for domains such as health, heavy machinery and the automotive. eTrice natively incorporates mechanisms for runtime verification. At the request of the developers of eTrice, we have incorporated model checking in their tool chain, by partly reusing the existing runtime verificat作者: abduction 時(shí)間: 2025-3-31 19:12
Data Independence for Software Transactional Memory,ly, programmers can specify . (reading from and writing to shared state) which then execute in a “seeming” atomicity. This property is captured in a correctness criterion called .. For model checking the opacity of an STM algorithm, we – in principle – need to check opacity for all possible combinat作者: electrolyte 時(shí)間: 2025-3-31 21:50
Transaction Protocol Verification with Labeled Synchronization Logic, the type of the used synchronization objects and associates labels to method calls to explicitly capture their intra-thread order. We use the language to capture architecture independent representations of transactional memory (TM) algorithms. We present a novel logic that enables reasoning about s作者: 腐蝕 時(shí)間: 2025-4-1 02:53
James Ortiz,Moussa Amrani,Pierre-Yves Schobbensonments has justified the present triumvirate of specialized publications in this field: comprehensive reviews, rapidly published research papers and progress reports, and archival documentations. These three international publications are inte- grated and scheduled to provide the coherency essentia作者: STEER 時(shí)間: 2025-4-1 07:06
Rylo Ashmore,Arie Gurfinkel,Richard Trefleronments has justified the present triumvirate of specialized publications in this field: comprehensive reviews, rapidly published research papers and progress reports, and archival documentations. These three international publications are inte- grated and scheduled to provide the coherency essentia作者: 人類 時(shí)間: 2025-4-1 13:29 作者: alliance 時(shí)間: 2025-4-1 16:51 作者: 煩憂 時(shí)間: 2025-4-1 21:10 作者: grandiose 時(shí)間: 2025-4-1 23:09
Amjad Ibrahim,Severin Kacianka,Alexander Pretschner,Charles Hartsell,Gabor Karsaionments has justi? ed the present triumvirate of specialized publications in this ? eld: comprehensive reviews, rapidly published research papers and progress reports, and archival documentations. These three international publications are integrated and scheduled to provide the coherency ess- tial 作者: DAMN 時(shí)間: 2025-4-2 05:58
Eleftherios Ioannidis,Frans Kaashoek,Nickolai Zeldovicharticle counting (LPC) in aquatic systems almost inevitably reveals a total suspended-solids content that may range in diameter from less than detectable (usually 0.4 μm) to as large as 120 μm in diameter. These “solids” are, in reality, particles that can intercede in the laser pathway and so allow
