作者: 閑聊 時(shí)間: 2025-3-21 22:45 作者: nautical 時(shí)間: 2025-3-22 01:42
Learning Assumptions for?Compositional Verification of?Timed Automatacomponents. It is essential to address the state explosion problem associated with model checking. However, obtaining the appropriate assumption for AGR is always a highly mental challenge, especially in the case of timed systems. In this paper, we propose a learning-based compositional verification作者: 最高點(diǎn) 時(shí)間: 2025-3-22 06:37
Online Causation Monitoring of Signal Temporal Logic specification in, e.g., .. The classic STL monitoring is performed by computing a robustness interval that specifies, at each instant, how far the monitored signals are from violating and satisfying the specification. However, since a robustness interval monotonically shrinks during monitoring, cla作者: Aprope 時(shí)間: 2025-3-22 09:21 作者: 分發(fā) 時(shí)間: 2025-3-22 14:14 作者: 分發(fā) 時(shí)間: 2025-3-22 19:16
Fast Termination and?Workflow Netsall possible runs. Recent work on the termination of Petri nets suggests that, in general, practical models should terminate fast, . in polynomial time. In this paper we focus on the termination of workflow nets, an established variant of Petri nets used for modelling business processes. We partiall作者: Projection 時(shí)間: 2025-3-23 00:44
Lincheck: A Practical Framework for?Testing Concurrent Data Structures on?JVMimple and declarative way to write concurrent tests: instead of describing . to perform the test, users specify . by declaring all the operations to examine; the framework automatically handles the rest. As a result, tests written with . are concise and easy to understand. The framework automaticall作者: 古文字學(xué) 時(shí)間: 2025-3-23 03:12 作者: Kindle 時(shí)間: 2025-3-23 08:01
Overcoming Memory Weakness with?Unified Fairnesss that preclude demonic non-determinism, are motivated by practical observations, and are amenable to algorithmic techniques. We provide both logical and stochastic definitions of our fairness notions, and prove that they are equivalent in the context of liveness verification. In particular, we show作者: SPASM 時(shí)間: 2025-3-23 12:13 作者: Visual-Acuity 時(shí)間: 2025-3-23 15:01 作者: 走路左晃右晃 時(shí)間: 2025-3-23 19:39 作者: 史前 時(shí)間: 2025-3-24 01:58
A Unified Model for?Real-Time Systems: Symbolic Techniques and?Implementationmata, event-clock automata with and without diagonal constraints, and automata with timers..Our main contribution is a new simulation-based zone algorithm for checking reachability in this unified model. While such algorithms are known to exist for timed automata, and have recently been shown for ev作者: ALB 時(shí)間: 2025-3-24 05:48
Closed-Loop Analysis of?Vision-Based Autonomous Systems: A Case Studya. Formal analysis of these systems is particularly challenging due to the complexity of the perception DNNs, the sensors (cameras), and the environment conditions. We present a case study applying formal probabilistic analysis techniques to an experimental autonomous system that guides airplanes on作者: dandruff 時(shí)間: 2025-3-24 08:47
Hybrid Controller Synthesis for?Nonlinear Systems Subject to?Reach-Avoid Constraintsical systems. Reinforcement learning (RL) has been deployed successfully to synthesize controllers from user-defined reward functions encoding desired system requirements. However, it remains a significant challenge in synthesizing provably correct controllers with safety and goal-reaching requireme作者: GOAT 時(shí)間: 2025-3-24 10:56 作者: 聚集 時(shí)間: 2025-3-24 17:06 作者: 按等級(jí) 時(shí)間: 2025-3-24 20:08 作者: GEM 時(shí)間: 2025-3-24 23:57 作者: 腐蝕 時(shí)間: 2025-3-25 07:11
Systemic Effectiveness Matters,nitor their equipment or device fleets for failures or changes in operation and trigger actions when such events occur. If these models are incorrect, they may become out-of-sync with the actual state of the equipment causing customers to be unable to respond to events occurring on it..Working backw作者: 仇恨 時(shí)間: 2025-3-25 08:57
https://doi.org/10.1007/978-3-642-79622-7components. It is essential to address the state explosion problem associated with model checking. However, obtaining the appropriate assumption for AGR is always a highly mental challenge, especially in the case of timed systems. In this paper, we propose a learning-based compositional verification作者: mitten 時(shí)間: 2025-3-25 15:33
Yashwant Kumar M.D., D.N.B.,Alka Bhatia M.D. specification in, e.g., .. The classic STL monitoring is performed by computing a robustness interval that specifies, at each instant, how far the monitored signals are from violating and satisfying the specification. However, since a robustness interval monotonically shrinks during monitoring, cla作者: Ferritin 時(shí)間: 2025-3-25 18:50
https://doi.org/10.1007/978-3-642-71642-3o tell processes apart. The defender-winning initial credits exhaustively determine which preorders and equivalences from the (strong) linear-time–branching-time spectrum relate processes..The time complexity is exponential, which is optimal due to trace equivalence being covered. This complexity im作者: 他姓手中拿著 時(shí)間: 2025-3-25 23:34 作者: APNEA 時(shí)間: 2025-3-26 01:23 作者: TIGER 時(shí)間: 2025-3-26 05:51 作者: 姑姑在炫耀 時(shí)間: 2025-3-26 10:44 作者: ensemble 時(shí)間: 2025-3-26 13:41
https://doi.org/10.1007/978-3-642-29244-6s that preclude demonic non-determinism, are motivated by practical observations, and are amenable to algorithmic techniques. We provide both logical and stochastic definitions of our fairness notions, and prove that they are equivalent in the context of liveness verification. In particular, we show作者: BOOST 時(shí)間: 2025-3-26 16:46
José Pérez Rios,Xosé Lois Martínez Suárezlly consistent shared memory. In this paper, we first generalize RG to make it parametric with respect to the underlying memory model by introducing an RG framework that is applicable to any model axiomatically characterized by Hoare triples. Second, we instantiate this framework for reasoning about作者: 蘆筍 時(shí)間: 2025-3-26 23:49
Reflections on Adequate System Varietyocked executions due to spinloops..In response, we develop ., a sound, complete, and strongly optimal DPOR algorithm that avoids exploring any useless blocked executions in programs with await and confirmation-CAS loops. Consequently, it outperforms the state-of-the-art, often by an exponential fact作者: 安慰 時(shí)間: 2025-3-27 04:33 作者: Osteoporosis 時(shí)間: 2025-3-27 09:12 作者: B-cell 時(shí)間: 2025-3-27 12:26 作者: 相符 時(shí)間: 2025-3-27 16:09
https://doi.org/10.1007/978-981-99-7273-9ical systems. Reinforcement learning (RL) has been deployed successfully to synthesize controllers from user-defined reward functions encoding desired system requirements. However, it remains a significant challenge in synthesizing provably correct controllers with safety and goal-reaching requireme作者: GLIB 時(shí)間: 2025-3-27 17:48
https://doi.org/10.1007/978-3-031-37706-8architecture verification and validation; artificial intelligence; computer programming; distributed co作者: Commemorate 時(shí)間: 2025-3-27 23:36
978-3-031-37705-1The Editor(s) (if applicable) and The Author(s) 2023作者: Intend 時(shí)間: 2025-3-28 03:16 作者: grandiose 時(shí)間: 2025-3-28 06:37 作者: 一起平行 時(shí)間: 2025-3-28 11:04
: A Linearizability Proof Checkerabstraction based on separation logic and the flow framework, and its support for hindsight arguments about future-dependent linearization points. We describe the tool, present a case study, and discuss implementation details.作者: 先行 時(shí)間: 2025-3-28 18:11
Unblocking Dynamic Partial Order Reductionocked executions due to spinloops..In response, we develop ., a sound, complete, and strongly optimal DPOR algorithm that avoids exploring any useless blocked executions in programs with await and confirmation-CAS loops. Consequently, it outperforms the state-of-the-art, often by an exponential factor.作者: micronutrients 時(shí)間: 2025-3-28 18:49 作者: phlegm 時(shí)間: 2025-3-29 02:24 作者: MEET 時(shí)間: 2025-3-29 05:03
W. Graninger,C. C. Zielinski,J. S. Smolenerminating workflow nets..In general the problem is PSPACE-complete, thus intractable. We utilize insights from the coNP upper bound to implement a procedure for generalised soundness using MILP solvers. Our novel approach is a semi-procedure in general, but is complete on the rich class of terminat作者: 預(yù)測(cè) 時(shí)間: 2025-3-29 07:39
ANA Subsets in Systemic Lupus Erythematosus tests, without requiring special skills or expertise. We successfully integrated . in the development process of several large projects, such as Kotlin Coroutines, and identified new bugs in popular concurrency libraries, such as a race in Java’s standard . and a liveliness bug in Java’s . framewor作者: 遺傳學(xué) 時(shí)間: 2025-3-29 12:35 作者: 減去 時(shí)間: 2025-3-29 17:49
Jeffrey Yi-Lin Forrest,Qiang Bubabilities and thereby strengthen the soundness of the analysis. We also show how to leverage local, DNN-specific analyses as run-time guards to filter out mis-behaving inputs and increase the safety of the overall system. Our findings are applicable to other autonomous systems that use complex DNNs作者: GILD 時(shí)間: 2025-3-29 19:54
https://doi.org/10.1007/978-981-99-7273-9uce barrier certificates and Lyapunov-like functions, which can guarantee every trajectory from the initial set of the system with the resulted controller satisfies the given safety and goal-reaching requirements. We evaluate the proposed hybrid controller synthesis method on a set of benchmark exam作者: nascent 時(shí)間: 2025-3-30 01:06
Learning Assumptions for?Compositional Verification of?Timed Automataesults of our experiments to evaluate the scalability and effectiveness of the framework. The results show that the framework we propose can reduce state space effectively, and it outperforms traditional monolithic model checking for most cases.作者: ensemble 時(shí)間: 2025-3-30 04:33 作者: colostrum 時(shí)間: 2025-3-30 08:56 作者: 不理會(huì) 時(shí)間: 2025-3-30 16:16
Lincheck: A Practical Framework for?Testing Concurrent Data Structures on?JVM tests, without requiring special skills or expertise. We successfully integrated . in the development process of several large projects, such as Kotlin Coroutines, and identified new bugs in popular concurrency libraries, such as a race in Java’s standard . and a liveliness bug in Java’s . framewor作者: obviate 時(shí)間: 2025-3-30 19:54
A Unified Model for?Real-Time Systems: Symbolic Techniques and?Implementation predicting clocks) without going through a costly translation via timed automata. Last but not least, beyond being interesting in their own right, generalized timed automata can be used for model-checking event-clock specifications over timed automata models.作者: glisten 時(shí)間: 2025-3-30 22:54
Closed-Loop Analysis of?Vision-Based Autonomous Systems: A Case Studybabilities and thereby strengthen the soundness of the analysis. We also show how to leverage local, DNN-specific analyses as run-time guards to filter out mis-behaving inputs and increase the safety of the overall system. Our findings are applicable to other autonomous systems that use complex DNNs作者: 反饋 時(shí)間: 2025-3-31 03:40
Hybrid Controller Synthesis for?Nonlinear Systems Subject to?Reach-Avoid Constraintsuce barrier certificates and Lyapunov-like functions, which can guarantee every trajectory from the initial set of the system with the resulted controller satisfies the given safety and goal-reaching requirements. We evaluate the proposed hybrid controller synthesis method on a set of benchmark exam作者: 離開可分裂 時(shí)間: 2025-3-31 07:43 作者: Awning 時(shí)間: 2025-3-31 13:07 作者: objection 時(shí)間: 2025-3-31 13:41 作者: Debate 時(shí)間: 2025-3-31 18:41 作者: ANT 時(shí)間: 2025-4-1 01:29 作者: capsaicin 時(shí)間: 2025-4-1 05:32
