找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Constraint-Based Design Recovery for Software Reengineering; Theory and Experimen Steven G. Woods,Alexander E. Quilici,Qiang Yang Book 1998

[復(fù)制鏈接]
查看: 24521|回復(fù): 44
樓主
發(fā)表于 2025-3-21 16:56:07 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Constraint-Based Design Recovery for Software Reengineering
副標(biāo)題Theory and Experimen
編輯Steven G. Woods,Alexander E. Quilici,Qiang Yang
視頻videohttp://file.papertrans.cn/236/235941/235941.mp4
叢書名稱International Series in Software Engineering
圖書封面Titlebook: Constraint-Based Design Recovery for Software Reengineering; Theory and Experimen Steven G. Woods,Alexander E. Quilici,Qiang Yang Book 1998
描述The great challenge of reverse engineering is recovering design information from legacy code: the concept recovery problem. This monograph describes our research effort in attacking this problem. It discusses our theory of how a constraint-based approach to program plan recognition can efficiently extract design concepts from source code, and it details experiments in concept recovery that support our claims of scalability. Importantly, we present our models and experiments in sufficient detail so that they can be easily replicated. This book is intended for researchers or software developers concerned with reverse engineering or reengineering legacy systems. However, it may also interest those researchers who are interested using plan recognition techniques or constraint-based reasoning. We expect the reader to have a reasonable computer science background (i.e., familiarity with the basics of programming and algorithm analysis), but we do not require familiarity with the fields of reverse engineering or artificial intelligence (AI). To this end, we carefully explain all the AI techniques we use. This book is designed as a reference for advanced undergraduate or graduate seminar c
出版日期Book 1998
關(guān)鍵詞Constraint Satisfaction; Scala; algorithms; artificial intelligence; design; intelligence; programming; pro
版次1
doihttps://doi.org/10.1007/978-1-4615-5461-5
isbn_softcover978-1-4613-7494-7
isbn_ebook978-1-4615-5461-5Series ISSN 1384-6469
issn_series 1384-6469
copyrightSpringer Science+Business Media New York 1998
The information of publication is updating

書目名稱Constraint-Based Design Recovery for Software Reengineering影響因子(影響力)




書目名稱Constraint-Based Design Recovery for Software Reengineering影響因子(影響力)學(xué)科排名




書目名稱Constraint-Based Design Recovery for Software Reengineering網(wǎng)絡(luò)公開度




書目名稱Constraint-Based Design Recovery for Software Reengineering網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Constraint-Based Design Recovery for Software Reengineering被引頻次




書目名稱Constraint-Based Design Recovery for Software Reengineering被引頻次學(xué)科排名




書目名稱Constraint-Based Design Recovery for Software Reengineering年度引用




書目名稱Constraint-Based Design Recovery for Software Reengineering年度引用學(xué)科排名




書目名稱Constraint-Based Design Recovery for Software Reengineering讀者反饋




書目名稱Constraint-Based Design Recovery for Software Reengineering讀者反饋學(xué)科排名




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

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:44:44 | 只看該作者
板凳
發(fā)表于 2025-3-22 02:07:17 | 只看該作者
地板
發(fā)表于 2025-3-22 06:02:25 | 只看該作者
Michael J. Clay Ph.D.,Jenna N. Albersngineering but is difficult to obtain due to the complexity of software, the specialized knowledge used to construct it, and the lack of existing understanding aids. As a result, there is a need for tools that can help programmers obtain this understanding. It is particularly crucial to have tools t
5#
發(fā)表于 2025-3-22 11:43:23 | 只看該作者
L. Jehel,R. Arnal,D. Carmelo,N. Howardts are the Concept Recognizer, DECODE, GRASPR, and Unprog. While they differ considerably in the details, they view the plan recognition problem as locating a set of items in the code that meet certain constraints, and they tend to to use heuristics to reduce the combinatorics involved in plan recog
6#
發(fā)表于 2025-3-22 13:49:14 | 只看該作者
7#
發(fā)表于 2025-3-22 18:23:54 | 只看該作者
https://doi.org/10.1007/978-3-319-26282-6 algorithms tend to have different behavior in different problem domains, we have run a series of experiments to try to find a solving strategy whose performance is reasonable on small programs (those containing less than 1,500 lines of source code). We have then taken the best strategy and explored
8#
發(fā)表于 2025-3-23 00:32:17 | 只看該作者
9#
發(fā)表于 2025-3-23 03:16:10 | 只看該作者
Effect of Economic Crises on Suicide Ratescognition techniques to the program understanding problem. Curiously, however, program understanding researchers have not done so, and they have not explained why they have avoided the use of these plan recognition algorithms. The problem is that treating program understanding as plan recognition is
10#
發(fā)表于 2025-3-23 09:30:27 | 只看該作者
Gustavo Zurita,José A Pino,Nelson Baloianrward use of MAP-CSP, and there is empirical evidence that MAP-CSP is an efficient mechanism for recognizing individual plans. Unfortunately, it is not clear that the Layered MAP-CSP approach scales with the size of the plan library, nor is it obvious how Layered MAP-CSP can be effectively extended
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-16 15:57
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
瑞安市| 萨迦县| 纳雍县| 金湖县| 滦南县| 皋兰县| 萨迦县| 绥德县| 甘泉县| 永登县| 景洪市| 文昌市| 石嘴山市| 武安市| 碌曲县| 双流县| 淅川县| 深州市| 彭阳县| 天全县| 靖宇县| 青海省| 社会| 红安县| 遂昌县| 凤城市| 巴马| 饶平县| 历史| 星座| 临安市| 唐河县| 青岛市| 安陆市| 榆树市| 阿拉尔市| 嘉祥县| 肃北| 津南区| 定襄县| 奉贤区|