找回密碼
 To register

QQ登錄

只需一步，快速開始

掃一掃，訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Deductive Software Verification – The KeY Book; From Theory to Pract Wolfgang Ahrendt,Bernhard Beckert,Mattias Ulbrich Book 2016 Springer I

[復(fù)制鏈接]
查看: 8021|回復(fù): 54
樓主
發(fā)表于 2025-3-21 16:35:14 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Deductive Software Verification – The KeY Book
副標(biāo)題From Theory to Pract
編輯Wolfgang Ahrendt,Bernhard Beckert,Mattias Ulbrich
視頻videohttp://file.papertrans.cn/265/264513/264513.mp4
概述Unique visibility.Integrates classic material and new concepts.Written by experts.Includes supplementary material:
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Deductive Software Verification – The KeY Book; From Theory to Pract Wolfgang Ahrendt,Bernhard Beckert,Mattias Ulbrich Book 2016 Springer I
描述.Static analysis of software with deductive methods is a highly dynamic field of research on the verge of becoming a mainstream technology in software engineering. It consists of a large portfolio of - mostly fully automated - analyses: formal verification, test generation, security? analysis, visualization, and debugging. All of them are realized in the state-of-art deductive verification framework KeY..This book is the definitive guide to KeY that lets you explore the full potential of deductive software verification in practice. It contains the complete theory behind KeY for active researchers who want to understand it in depth or use it in their own work. But the book also features fully self-contained chapters on the Java Modeling Language and on Using KeY that require nothing else than familiarity with Java. All other chapters are accessible for graduate students (M.Sc. level and beyond). .The KeY framework is free and open software, downloadable from the book companion website which contains also all code examples mentioned in this book..
出版日期Book 2016
關(guān)鍵詞deductive verification; first-order logic; formal methods; semantic constraints; software development; ca
版次1
doihttps://doi.org/10.1007/978-3-319-49812-6
isbn_softcover978-3-319-49811-9
isbn_ebook978-3-319-49812-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer International Publishing AG 2016
The information of publication is updating

書目名稱Deductive Software Verification – The KeY Book影響因子(影響力)




書目名稱Deductive Software Verification – The KeY Book影響因子(影響力)學(xué)科排名




書目名稱Deductive Software Verification – The KeY Book網(wǎng)絡(luò)公開度




書目名稱Deductive Software Verification – The KeY Book網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Deductive Software Verification – The KeY Book被引頻次




書目名稱Deductive Software Verification – The KeY Book被引頻次學(xué)科排名




書目名稱Deductive Software Verification – The KeY Book年度引用




書目名稱Deductive Software Verification – The KeY Book年度引用學(xué)科排名




書目名稱Deductive Software Verification – The KeY Book讀者反饋




書目名稱Deductive Software Verification – The KeY Book讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics
 

0票 0%

Better Implies Difficulty
 

0票 0%

Good and Satisfactory
 

0票 0%

Adverse Performance
 

0票 0%

Disdainful Garbage
您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 20:44:55 | 只看該作者
Dynamic Logic for Javarder logic and makes it possible to consider several program states in a single formula. Its principle is the formulation of assertions about program behavior by integrating programs and formulas within a single language. We present a sequent calculus for JavaDL, which is used in the KeY System for
板凳
發(fā)表于 2025-3-22 04:17:52 | 只看該作者
Proof Search with Tacletsoductory tutorial, the syntax and semantics of the taclet language are described. Finally, techniques are presented to mechanically prove taclet soundness by deriving formulas from taclets whose validity entails the soundness.
地板
發(fā)表于 2025-3-22 08:07:51 | 只看該作者
5#
發(fā)表于 2025-3-22 11:14:49 | 只看該作者
Abstract Interpretationon their symbolic state representation (JavaDL‘s updates).Unlike counter example guided abstraction-refinement (CEGAR) loops, we startwith a fully precise representation and use abstraction only incrementallyon demand, for example, to enforce termination of symbolic execution of aloop. Incremental m
6#
發(fā)表于 2025-3-22 15:15:50 | 只看該作者
Formal Specification with the Java Modeling Languageach and tool for theverification of Java software, because JML is the dominatingstarting point of KeY style Java verification. However, this chapterdoes not depend on any specific tool nor verification methodology inany way. This introduction is written for all readers with aninterest in formal spec
7#
發(fā)表于 2025-3-22 17:44:58 | 只看該作者
8#
發(fā)表于 2025-3-22 21:44:50 | 只看該作者
9#
發(fā)表于 2025-3-23 02:42:12 | 只看該作者
Verifying Java Card Programs. The necessary extensions to the logic and thespecification language are discussed, followed by a number of small casestudies. The chapter is concluded with applications of the ideas presentedhere to on-going and future research, in particular in reasoning aboutconcurrent Java programs.
10#
發(fā)表于 2025-3-23 06:09:31 | 只看該作者
Proof-based Test Case Generationess (test driver) which does not only initialize method parametersbut also the global state that is defined by the (potentially private)fields of objects and classes. For example, a complex linked data structuremay be created as test input.The tests can satisfy different test criteriasuch as branch
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-25 23:44
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
崇义县| 乌审旗| 察雅县| 水城县| 金乡县| 镇原县| 克东县| 芮城县| 松溪县| 绵阳市| 拉萨市| 贵州省| 吉林省| 图们市| 仙桃市| 如皋市| 讷河市| 南华县| 阳东县| 珲春市| 马山县| 多伦县| 枞阳县| 特克斯县| 佛冈县| 比如县| 新巴尔虎左旗| 弋阳县| 富裕县| 即墨市| 郁南县| 云浮市| 武穴市| 隆子县| 左云县| 满洲里市| 东港市| 法库县| 综艺| 漾濞| 河北省|