找回密碼
 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ù) 返回頂部 返回列表
临潭县| 玉溪市| 商水县| 宣恩县| 铜梁县| 新竹县| 梅河口市| 遂川县| 恩平市| 平利县| 万盛区| 甘南县| 马山县| 呼伦贝尔市| 麻栗坡县| 涡阳县| 昭苏县| 姜堰市| 太保市| 沽源县| 三明市| 同江市| 临桂县| 都兰县| 高阳县| 新邵县| 微山县| 湄潭县| 隆德县| 公主岭市| 二连浩特市| 简阳市| 磴口县| 桂阳县| 遂宁市| 抚州市| 宜昌市| 龙海市| 游戏| SHOW| 甘孜|