| 書(shū)目名稱(chēng) | Verification of Object-Oriented Software. The KeY Approach |
| 副標(biāo)題 | Foreword by K. Rusta |
| 編輯 | Bernhard Beckert,Reiner H?hnle,Peter H. Schmitt |
| 視頻video | http://file.papertrans.cn/982/981709/981709.mp4 |
| 叢書(shū)名稱(chēng) | Lecture Notes in Computer Science |
| 圖書(shū)封面 |  |
| 描述 | Long gone are the days when program veri?cation was a task carried out merely by hand with paper and pen. For one, we are increasingly interested in proving actual program artifacts, not just abstractions thereof or core algorithms. The programs we want to verify today are thus longer, including whole classes and modules. As we consider larger programs, the number of cases to be considered in a proof increases. The creative and insightful parts of a proof can easily be lost in scores of mundane cases. Another problem with paper-and-pen proofs is that the features of the programming languages we employ in these programs are plentiful, including object-oriented organizations of data, facilities for specifying di?erent c- trol ?ow for rare situations, constructs for iterating over the elements of a collection, and the grouping together of operations into atomic transactions. These language features were designed to facilitate simpler and more natural encodings of programs, and ideally they are accompanied by simpler proof rules. But the variety and increased number of these features make it harder to remember all that needs to be proved about their uses. As a third problem, we have co |
| 出版日期 | Book 2007 |
| 關(guān)鍵詞 | AI logics; JML; Java; Java Card; OCL; deductive verification; formal methods; formal reasoning; logic reason |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-540-69061-0 |
| isbn_softcover | 978-3-540-68977-5 |
| isbn_ebook | 978-3-540-69061-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 2007 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-10 02:31
發(fā)表于 2025-3-21 17:17:49
