作者: ostrish 時間: 2025-3-21 22:45
rformance evaluation of our system by comparing transactions-based concurrency control mechanism for nested parallel computations with a mechanism already provided by OpenMP based on mutual exclusion.作者: Amorous 時間: 2025-3-22 03:32
osing new extensions..We provide two different semantics of an FJig program: . and . semantics. The difference is analogous to that between two intuitive models to understand inheritance: the former where inherited methods are copied into heir classes, and the latter where member lookup is performed作者: Mortal 時間: 2025-3-22 05:19 作者: 控訴 時間: 2025-3-22 10:10
C. Sommer,T. Dietsche,M. Sommer,Ph. Müllerlugin provides correctness guarantees on par with those of Eclipse’s own refactorings, (2) both our plugin and our approach address the aforementioned limitations, and (3) our approach fully subsumes traditional refactoring.作者: enflame 時間: 2025-3-22 13:50 作者: enflame 時間: 2025-3-22 17:51
Featherweight Jigsaw: A Minimal Core Calculus for Modular Composition of Classesosing new extensions..We provide two different semantics of an FJig program: . and . semantics. The difference is analogous to that between two intuitive models to understand inheritance: the former where inherited methods are copied into heir classes, and the latter where member lookup is performed作者: GLUT 時間: 2025-3-22 23:46
MAPO: Mining and Recommending API Usage Patternslled together and their usages follow some sequential rules. MAPO further recommends the mined API usage patterns and their associated code snippets upon programmers’ requests. Our experimental results show that with these patterns MAPO helps programmers locate useful code snippets more effectively 作者: 極大的痛苦 時間: 2025-3-23 03:41
Program Metamorphosislugin provides correctness guarantees on par with those of Eclipse’s own refactorings, (2) both our plugin and our approach address the aforementioned limitations, and (3) our approach fully subsumes traditional refactoring.作者: considerable 時間: 2025-3-23 09:09 作者: UNT 時間: 2025-3-23 12:39
https://doi.org/10.1007/978-3-642-03013-0Action; Factor; Java programming; abstraction; aspect-oriented programming; component systems; distributed作者: CROW 時間: 2025-3-23 16:21
978-3-642-03012-3Springer-Verlag Berlin Heidelberg 2009作者: antedate 時間: 2025-3-23 18:53 作者: Rankle 時間: 2025-3-24 00:41 作者: Glucose 時間: 2025-3-24 03:53
,Andere krankhafte Zust?nde an der Ferse,pend on runtime values. Additionally, they are difficult to specify because they are often extrinsic and may break behavioral subtyping. This work introduces . as an abstraction for specifying framework constraints in FUSION (Framework Usage SpecificatIONs), and it presents a formal description and 作者: micturition 時間: 2025-3-24 07:03 作者: conduct 時間: 2025-3-24 13:16 作者: Loathe 時間: 2025-3-24 16:36
,Fu?ball — Erfolgsgarant für Pay-TV?,e the points-to solution for an entire large program. Our goal is to increase significantly the scalability of the currently most precise points-to analysis for Java. This CFL-reachability analysis depends on determining whether two program variables may be aliases. We propose an efficient but less 作者: 祝賀 時間: 2025-3-24 21:24
urrently executing code fragments in terms of high-level properties they should possess. However, all currently existing TM systems deliver on this promise only partially by disallowing parallel execution of computations performed inside transactions. This paper fills in that gap by introducing NePa作者: 傾聽 時間: 2025-3-25 00:47 作者: Extort 時間: 2025-3-25 04:55
Kerstin P??iger,S?hnke Vosgerauthough, traditional RBAC does not easily express application-level security requirements. For instance, in a medical records system it is difficult to express that doctors should only update the records of . patients. Further, traditional RBAC frameworks like Java’s Enterprise Edition rely solely on作者: 小步舞 時間: 2025-3-25 08:38 作者: anaphylaxis 時間: 2025-3-25 12:58
express visibility control for methods. Two extensions, stateful traits and freezable traits, have been proposed to overcome these limitations. However, these extensions introduce complexity and have not yet been combined to simultaneously add both state . visibility control to traits..This paper r作者: 推崇 時間: 2025-3-25 17:24 作者: bile648 時間: 2025-3-25 21:52
Leistungsbestimmende Faktoren im Fu?balldatatypes. Like the traditional ., adding new components (either variants or operations) should be possible while preserving .. Moreover, different combinations of components should have different type identities and the subtyping relationships between components should be preserved. By generalizing作者: FLAT 時間: 2025-3-26 00:28 作者: 鬼魂 時間: 2025-3-26 05:37
Ergebnisse der Beobachtungsstudien, provided in their APIs. Those API methods, however, are often complex and not well documented. To get familiar with how those API methods are used, programmers often exploit a source code search tool to search for code snippets that use the API methods of interest. However, the returned code snippe作者: 使尷尬 時間: 2025-3-26 12:17
,Die Finanzierung von Fu?ballunternehmen,bclassing, implementing callbacks, and making calls. Existing applications contain valuable examples of such steps, except that locating them in the application code is often challenging. We propose the notion of ., which summarize the necessary implementation steps, and an approach to automatic ext作者: circuit 時間: 2025-3-26 16:19 作者: Abduct 時間: 2025-3-26 17:22
C. Sommer,T. Dietsche,M. Sommer,Ph. Müllerare limited in three ways: (i) atomicity forces transformations to be complex and opaque, (ii) the behaviour preservation requirement disallows deliberate behaviour evolution, and (iii) atomicity limits code reuse opportunities for refactoring implementers..We present ‘program metamorphosis’, a nove作者: AWE 時間: 2025-3-26 22:40 作者: Opponent 時間: 2025-3-27 01:23
ECOOP 2009 -- Object-Oriented Programming978-3-642-03013-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 攤位 時間: 2025-3-27 06:19 作者: 離開可分裂 時間: 2025-3-27 10:14
Classes, Jim, But Not as We Know Them — Type Classes in Haskell: What, Why, and Whithermely type classes, with a few anecdotes and reflections along the way about the process of developing the language..Type classes are probably Haskell’s most distinctive feature. The original idea is very neat and, better still, it led to a long series of subsequent generalisations and innovations. I作者: invade 時間: 2025-3-27 15:42
Coinductive Type Systems for Object-Oriented Languages Horn formulas which are interpreted w.r.t. their coinductive Herbrand model..We illustrate the approach by first specifying a standard type system for a small object-oriented language similar to Featherweight Java. Then we define an idealized type system for a variant of the language where type ann作者: 釋放 時間: 2025-3-27 18:51 作者: 報復 時間: 2025-3-27 23:31 作者: 卵石 時間: 2025-3-28 05:00 作者: Harpoon 時間: 2025-3-28 06:29 作者: 潛移默化 時間: 2025-3-28 12:53 作者: IOTA 時間: 2025-3-28 16:21
Implicit Dynamic Frames: Combining Dynamic Frames and Separation Logicand checking many frame annotations. In this paper, we propose a variant of the dynamic frames approach that eliminates the need to explicitly write and check frame annotations. Reminiscent of separation logic’s frame rule, programmers write access assertions inside pre- and postconditions instead o作者: 名詞 時間: 2025-3-28 18:58
Fine-Grained Access Control with Object-Sensitive Rolesthough, traditional RBAC does not easily express application-level security requirements. For instance, in a medical records system it is difficult to express that doctors should only update the records of . patients. Further, traditional RBAC frameworks like Java’s Enterprise Edition rely solely on作者: FOIL 時間: 2025-3-28 23:56
Practical API Protocol Checking with Access Permissionswhile affording a great deal of aliasing flexibility. We also developed Plural, a prototype tool that embodies our approach as an automated static analysis and includes several extensions we found useful in practice. This paper evaluates our approach along the following dimensions: (1) We report on 作者: 幼稚 時間: 2025-3-29 04:50
Adding State and Visibility Control to Traits Using Lexical Nesting express visibility control for methods. Two extensions, stateful traits and freezable traits, have been proposed to overcome these limitations. However, these extensions introduce complexity and have not yet been combined to simultaneously add both state . visibility control to traits..This paper r作者: 知識 時間: 2025-3-29 08:29
Featherweight Jigsaw: A Minimal Core Calculus for Modular Composition of Classesructor. However, inheritance has been generalized to the much more flexible notion originally proposed in Bracha’s Jigsaw framework. That is, classes play also the role of modules, that can be composed by a rich set of operators, all of which can be expressed by a minimal core..We keep the nominal a作者: 秘方藥 時間: 2025-3-29 13:54
Modular Visitor Componentsdatatypes. Like the traditional ., adding new components (either variants or operations) should be possible while preserving .. Moreover, different combinations of components should have different type identities and the subtyping relationships between components should be preserved. By generalizing作者: 圓桶 時間: 2025-3-29 16:58
Debugging Method Namesng programmers with little or no support in assuring meaningful names. In this paper, we show that naming conventions can go much further: we can mechanically check whether or not a method name and implementation are likely to be good matches for each other. The vast amount of software written in Ja作者: Calibrate 時間: 2025-3-29 20:22 作者: capillaries 時間: 2025-3-30 03:52 作者: 拋媚眼 時間: 2025-3-30 05:31 作者: forbid 時間: 2025-3-30 09:56
Program Metamorphosisare limited in three ways: (i) atomicity forces transformations to be complex and opaque, (ii) the behaviour preservation requirement disallows deliberate behaviour evolution, and (iii) atomicity limits code reuse opportunities for refactoring implementers..We present ‘program metamorphosis’, a nove作者: GUILT 時間: 2025-3-30 14:29
From Public to Private to Absent: Refactoring , Programs under Constrained Accessibilitye tools provide hints that referenced elements may become inaccessible due to the intended restructuring, none we have tested prevent changes that alter the meaning of a program, and none take steps that counteract such alterations. To address these problems, we formalize accessibility in . as a set作者: 欺騙手段 時間: 2025-3-30 19:05
Implicit Dynamic Frames: Combining Dynamic Frames and Separation Logicf writing frame annotations. From the precondition, one can then infer an upper bound on the set of locations writable or readable by the corresponding method. We implemented our approach in a tool, and used it to automatically verify several challenging programs, including subject-observer, iterator and linked list.作者: rectocele 時間: 2025-3-30 23:09
Modular Visitor Components previous work exploring the connection between type-theoretic encodings of datatypes and visitors, we propose two solutions for this problem in Scala using .. These components can be grouped into . that can be easily composed in a . style to obtain customized datatypes and operations.作者: noxious 時間: 2025-3-31 01:31
Debugging Method Namesva defines an implicit convention for pairing names and implementations. We exploit this to extract rules for method names, which are used to identify “naming bugs” in well-known Java applications. We also present an approach for automatic suggestion of more suitable names in the presence of mismatch between name and implementation.作者: CHECK 時間: 2025-3-31 06:30 作者: 壓倒性勝利 時間: 2025-3-31 11:49
Leistungsbestimmende Faktoren im Fu?ball previous work exploring the connection between type-theoretic encodings of datatypes and visitors, we propose two solutions for this problem in Scala using .. These components can be grouped into . that can be easily composed in a . style to obtain customized datatypes and operations.作者: overweight 時間: 2025-3-31 14:57
,Fu?ball und Kommunikationstechnik,va defines an implicit convention for pairing names and implementations. We exploit this to extract rules for method names, which are used to identify “naming bugs” in well-known Java applications. We also present an approach for automatic suggestion of more suitable names in the presence of mismatch between name and implementation.作者: Factual 時間: 2025-3-31 20:49
,Ballenfu?, Hohlfu?, Hackenfu?,n adding type-level functions to Haskell, as I will briefly describe..I will explain what type classes are, how they differ from the classes of mainstream object oriented languages, why I think they are so cool, and what the hot topics are. I’ll give plenty of examples, so you don’t need to already know Haskell.作者: 咒語 時間: 2025-3-31 21:50
,Andere krankhafte Zust?nde an der Ferse,lete, and a pragmatic variant that balances these tradeoffs. We prove soundness and completeness for the appropriate variants, and we show that the pragmatic variant can effectively check constraints from real-world programs.作者: 壓倒性勝利 時間: 2025-4-1 05:13 作者: Alienated 時間: 2025-4-1 09:13
Classes, Jim, But Not as We Know Them — Type Classes in Haskell: What, Why, and Whithern adding type-level functions to Haskell, as I will briefly describe..I will explain what type classes are, how they differ from the classes of mainstream object oriented languages, why I think they are so cool, and what the hot topics are. I’ll give plenty of examples, so you don’t need to already know Haskell.作者: 休息 時間: 2025-4-1 11:00
Checking Framework Interactions with Relationshipslete, and a pragmatic variant that balances these tradeoffs. We prove soundness and completeness for the appropriate variants, and we show that the pragmatic variant can effectively check constraints from real-world programs.
