找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: ECOOP 2011--Object-Oriented Programming; 25th European Confer Mira Mezini Conference proceedings 2011 Springer-Verlag GmbH Berlin Heidelber

[復(fù)制鏈接]
樓主: 不足木
51#
發(fā)表于 2025-3-30 08:57:57 | 只看該作者
Theorie des f?derativen Staatesnting specifications of three different refactorings for the Eiffel programming language, and by applying the resulting refactoring tools to several sample programs. Outcome suggests that our approach is indeed viable.
52#
發(fā)表于 2025-3-30 12:45:13 | 只看該作者
Textilchemische Untersuchungen,ent a metric, ., to quantify the fraction of the program that is algorithmically essential. We evaluate our approach by studying the algorithmic essence of a large corpus of software system, and by comparing the measured essence to an intuitive view of design “overhead”.
53#
發(fā)表于 2025-3-30 18:35:59 | 只看該作者
5 MSLOC. We also undertook a study of the typographical features of identifier names (single case, use of digits, .) per object-oriented construct (class names, method names, .), thus providing an insight into naming conventions in industrial-scale object-oriented code. Our tokenisation tool and datasets are publicly available.
54#
發(fā)表于 2025-3-30 20:57:48 | 只看該作者
,Spanien: unechter F?deralismus,ty/field lookup in the presence of worlds. We also describe an efficient implementation strategy (used in our Squeak-based prototype), and illustrate the practical benefits of worlds with two case studies.
55#
發(fā)表于 2025-3-31 04:07:47 | 只看該作者
56#
發(fā)表于 2025-3-31 08:06:13 | 只看該作者
Systematische und historische Grundlagen, while retaining soundness. We present a formal semantics and soundness properties for the language. Finally, we describe an evaluation showing that our technique can express three parallel frameworks and three realistic parallel algorithms using those frameworks.
57#
發(fā)表于 2025-3-31 11:55:35 | 只看該作者
58#
發(fā)表于 2025-3-31 15:28:16 | 只看該作者
59#
發(fā)表于 2025-3-31 19:38:41 | 只看該作者
nt results on 34 applications, and case studies for nine of these. We demonstrate that eleven patterns cover most memory problems, and that users need inspect only a small number of pattern occurrences to reap large benefits.
60#
發(fā)表于 2025-4-1 00:54:50 | 只看該作者
 關(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-27 19:06
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
偏关县| 湟源县| 台北市| 昭平县| 息烽县| 根河市| 竹溪县| 淮安市| 库尔勒市| 盐边县| 图们市| 通道| 高青县| 大渡口区| 阿拉善盟| 逊克县| 大安市| 泸州市| 贵港市| 高密市| 芜湖市| 镇赉县| 观塘区| 高台县| 大新县| 长垣县| 穆棱市| 昌江| 丹江口市| 肇州县| 沿河| 兴化市| 留坝县| 聊城市| 喀喇沁旗| 宣威市| 鹿邑县| 博湖县| 土默特左旗| 北海市| 宣汉县|