作者: 生氣地 時間: 2025-3-21 23:18
A Short History of KeYThis paper describes the story of the first nine years of the KeY project, its original goals, the people involved, its setbacks, but also its occasional failures and blind alleys. It is deliberately written in a more personal style, but tries to meet scientific standards of correctness and completeness.作者: Hyperopia 時間: 2025-3-22 02:12 作者: Graves’-disease 時間: 2025-3-22 07:02
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/264514.jpg作者: 范圍廣 時間: 2025-3-22 11:53 作者: 有偏見 時間: 2025-3-22 12:59 作者: 有偏見 時間: 2025-3-22 17:40
https://doi.org/10.1007/978-3-642-83117-1currency models such as actors seriously restrict concurrency to obtain race-free programs. Languages with . occupy a middle ground between these extremes by explicit scheduling points. We introduce ., a contract-based specification approach designed for cooperative scheduling. It permits to specify作者: lacrimal-gland 時間: 2025-3-22 23:46 作者: adipose-tissue 時間: 2025-3-23 04:26 作者: 關(guān)節(jié)炎 時間: 2025-3-23 05:36 作者: limber 時間: 2025-3-23 13:46
https://doi.org/10.1007/978-3-658-21781-5cause they manage valuable assets and therefore are a prime target for security attacks. In this paper, we show that the computation model of smart contracts allows the application of formal methods designed for analysing single-threaded imperative programs. We discuss different classes of correctne作者: 遍及 時間: 2025-3-23 15:27 作者: Incompetent 時間: 2025-3-23 21:14
Praktische Konsequenzen der HOPE-Studieea of deductive program verification even further, we have proposed the VerifyThis Collaborative Long Term Challenge, which calls upon the program verification community to verify different aspects of a realistic software application over a period of several months. Goal of the challenge is to foste作者: 北京人起源 時間: 2025-3-23 23:25
Praktische Konsequenzen der HOPE-Studieification systems, even more so as the size of the investigated programs gets larger and the properties to be verified gain in complexity. We will present recommendations for the design of user interfaces in deductive program verification systems. The goal is to always provide the user with an easy 作者: BET 時間: 2025-3-24 04:11 作者: labile 時間: 2025-3-24 07:24 作者: Indecisive 時間: 2025-3-24 14:29
https://doi.org/10.1007/978-3-030-64354-6architecting; artificial intelligence; computer programming; deductive verification; embedded systems; fo作者: 流出 時間: 2025-3-24 17:23 作者: Peculate 時間: 2025-3-24 21:38
Deductive Software Verification: Future Perspectives978-3-030-64354-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 防御 時間: 2025-3-24 23:10 作者: remission 時間: 2025-3-25 06:57 作者: 后來 時間: 2025-3-25 09:30 作者: sundowning 時間: 2025-3-25 11:56
https://doi.org/10.1007/978-3-642-83117-1en reasoning about quantifiers. For both solutions we measure the effect on the performance. We see that the new encoding vastly reduces the verification time of certain programs, while other programs keep showing comparable times. This effect remains when moving to newer backends for VerCors.作者: browbeat 時間: 2025-3-25 16:44 作者: Genetics 時間: 2025-3-25 20:24 作者: Cryptic 時間: 2025-3-26 02:31
https://doi.org/10.1007/978-3-642-83117-1emes by explicit scheduling points. We introduce ., a contract-based specification approach designed for cooperative scheduling. It permits to specify complex concurrent behavior succinctly. Cooperative contracts are formalized as behavioral contracts in a compositional behavioral program logic in which they can be formally verified.作者: CLAN 時間: 2025-3-26 08:19
https://doi.org/10.1007/978-3-658-21781-5aper includes video material that shows recordings of interactive sessions, and project files with solutions. As such, this material is also interesting for the expert user and the developer of KeY as a ‘benchmark’ for specification and (automatic) verification techniques.作者: Sinus-Rhythm 時間: 2025-3-26 10:19
Book 2020the KeY project two decades ago, the area of deductive verification has evolved considerably. Support for real world programming languages by deductive program verification tools has become prevalent. This required to overcome significant theoretical and technical challenges to support advanced soft作者: Asymptomatic 時間: 2025-3-26 15:41 作者: Bph773 時間: 2025-3-26 20:26 作者: Ataxia 時間: 2025-3-26 22:59 作者: 宮殿般 時間: 2025-3-27 04:54 作者: Stress 時間: 2025-3-27 07:08 作者: 厭倦嗎你 時間: 2025-3-27 11:59 作者: 率直 時間: 2025-3-27 14:54 作者: Polydipsia 時間: 2025-3-27 19:16 作者: Asparagus 時間: 2025-3-27 22:28
A Retrospective on Developing Hybrid System Provers in the KeYmaera Familygy, their logical proximity yet technical distance enables us to draw conclusions about the various advantages and disadvantages of different prover implementation styles for different purposes, which we hope are of generalizable interest.作者: 表示向下 時間: 2025-3-28 03:28 作者: 不斷的變動 時間: 2025-3-28 09:48
Formal Analysis of Smart Contracts: Applying the KeY Systemss properties and the formal methods that may be applied. Furthermore, we show how deductive program verification in particular can be used to prove correctness of smart contracts, and we discuss two approaches where we have applied the program verification tool?KeY.作者: subacute 時間: 2025-3-28 12:00 作者: somnambulism 時間: 2025-3-28 18:34 作者: 蟄伏 時間: 2025-3-28 20:48
Behavioral Contracts for Cooperative Schedulingcurrency models such as actors seriously restrict concurrency to obtain race-free programs. Languages with . occupy a middle ground between these extremes by explicit scheduling points. We introduce ., a contract-based specification approach designed for cooperative scheduling. It permits to specify作者: Acumen 時間: 2025-3-28 23:02 作者: 安定 時間: 2025-3-29 06:53
Constraint-Based Contract Inference for Deductive Verificationrtions hold whenever program execution is at the corresponding control point. While the associated annotation overhead is relatively low, these techniques are typically monolithic in that they explore the state space of the whole program at once, and may therefore scale poorly to large programs. Ded作者: inspired 時間: 2025-3-29 11:13 作者: 外表讀作 時間: 2025-3-29 14:53 作者: 中和 時間: 2025-3-29 19:07 作者: 颶風(fēng) 時間: 2025-3-29 20:03
The VerifyThis Collaborative Long Term Challengeea of deductive program verification even further, we have proposed the VerifyThis Collaborative Long Term Challenge, which calls upon the program verification community to verify different aspects of a realistic software application over a period of several months. Goal of the challenge is to foste作者: 進(jìn)入 時間: 2025-3-30 01:06 作者: Infinitesimal 時間: 2025-3-30 05:12
Integration of Static and Dynamic Analysis Techniques for Checking Noninterferencetic analysis on the other hand, with the goal of checking noninterference. Noninterference is the non-functional property that certain confidential information cannot leak to certain public output, i.e., the confidentiality of that information is always preserved..We define the noninterference prope作者: 無政府主義者 時間: 2025-3-30 08:55
SymPaths: Symbolic Execution Meets Partial Order Reductionhs for a given program. For multithreaded shared variable programs, this technique leads to a state space explosion. Partial order reduction is a technique which allows equivalent execution paths to be recognized, reducing the state space explosion problem. This paper provides formal justifications 作者: 褲子 時間: 2025-3-30 15:13
Using Abstract Contracts for Verifying Evolving Features and Their Interactionsractions. . builds partial proofs for each evolving feature and then reuses the resulting partial proofs in verifying feature interactions, yielding a full verification of the complete software system. Moreover, to investigate whether a combination of both strategies is fruitful, we present the firs
