作者: delusion 時間: 2025-3-21 23:36
Heinz Pfeifer,Gerald Kabisch,Hans Lautnere three desired ones: safety, programmability, and efficiency. In this paper, we introduce a novel runtime ownership model that supports the first memory isolation model of actors with these three properties—it is safe, developer-friendly, and efficient.作者: ECG769 時間: 2025-3-22 02:07
Conference proceedings 2013 2013. The 29 papers presented in this volume were carefully reviewed and selected from 116 submissions. They are organized in topical sections on aspects, components, and modularity; types; language design; concurrency, parallelism, and distribution; analysis and verification; modelling and refacto作者: subacute 時間: 2025-3-22 06:23 作者: 取回 時間: 2025-3-22 12:22
,Schlucken und Schluckbeeintr?chtigung,t with . about the page and with . about the structure of containers. Together, these two extensions allow us to track precisely which nodes are active in a jQuery object, with minimal programmer annotation effort. We evaluate this work by applying it to sample real-world jQuery programs.作者: amorphous 時間: 2025-3-22 16:57
Petra Scherer,Elisabeth Moser Opitznear, and the precision of decomposition – placing objects to scopes as non-global as possible – can be reduced to a linear programming problem. . has been implemented as an open-source tool that can decompose real-world Java applications of more than 100K LOC and up to 6000 statically distinct instantiations.作者: amorphous 時間: 2025-3-22 17:59
Heinz Pfeifer,Gerald Kabisch,Hans Lautnercture for dynamic program analysis tools which treats the maintenance of analysis state in a modular fashion, consisting of . decomposing input events spatially, and . aggregating them over time. We show that this architecture captures the requirements of a wide variety of existing analysis tools.作者: VEST 時間: 2025-3-22 21:35
ness. We also investigate the underlying invariant checking problem in general and show that it is co-NP hard, i.e., that solutions must be approximations to remain tractable. We have seen a factor of thirty performance improvement using this algorithm in a case study.作者: 冬眠 時間: 2025-3-23 04:13
CoCo: Sound and Adaptive Replacement of Java Collectionsework, and developed a static CoCo compiler to generate Java code that performs optimizations. This work is the first step towards achieving the ultimate goal of automatically optimizing away semantic inefficiencies.作者: podiatrist 時間: 2025-3-23 09:19
Combining Form and Function: Static Types for JQuery Programst with . about the page and with . about the structure of containers. Together, these two extensions allow us to track precisely which nodes are active in a jQuery object, with minimal programmer annotation effort. We evaluate this work by applying it to sample real-world jQuery programs.作者: Deject 時間: 2025-3-23 12:23 作者: 確保 時間: 2025-3-23 15:51 作者: NEXUS 時間: 2025-3-23 22:00
Reducing Lookups for Invariant Checkingness. We also investigate the underlying invariant checking problem in general and show that it is co-NP hard, i.e., that solutions must be approximations to remain tractable. We have seen a factor of thirty performance improvement using this algorithm in a case study.作者: gerrymander 時間: 2025-3-23 23:56
QUIC Graphs: Relational Invariant Generation for Containersa container domain out of a . (QUIC) graph parameterized by an arbitrary .. We instantiate our domain with a polyhedral base domain and evaluate it on programs extracted from the Python test suite. Over traditional, non-relational domains, we find significant precision improvements with minimal performance cost.作者: 做作 時間: 2025-3-24 03:39 作者: Injunction 時間: 2025-3-24 06:55 作者: 高度表 時間: 2025-3-24 13:45 作者: Intrepid 時間: 2025-3-24 16:14 作者: Pedagogy 時間: 2025-3-24 19:00 作者: Bricklayer 時間: 2025-3-24 23:47
,: Effects for Controlling UI Object Accesstrated that the annotation burden is low..We also describe code patterns our effect system handles less gracefully or not at all, which we believe offers lessons for those applying other effect systems to existing code.作者: 五行打油詩 時間: 2025-3-25 03:28 作者: Suggestions 時間: 2025-3-25 10:20
Why Do Scala Developers Mix the Actor Model with other Concurrency Models?tors to their fullest advantage. Inspection of the programs and discussion with the developers reveal two reasons for mixing that can be influenced by researchers and library-builders: weaknesses in the actor library implementations, and shortcomings of the actor model itself.作者: HIKE 時間: 2025-3-25 14:06 作者: glowing 時間: 2025-3-25 16:53
Ownership-Based Isolation for Concurrent Actors on Multi-core Machinese three desired ones: safety, programmability, and efficiency. In this paper, we introduce a novel runtime ownership model that supports the first memory isolation model of actors with these three properties—it is safe, developer-friendly, and efficient.作者: Range-Of-Motion 時間: 2025-3-25 20:36
Conference proceedings 2013ects, components, and modularity; types; language design; concurrency, parallelism, and distribution; analysis and verification; modelling and refactoring; testing, profiling, and empirical studies; and implementation.作者: GULF 時間: 2025-3-26 01:13
,Materialflu? und F?rderhilfsmittel,a container domain out of a . (QUIC) graph parameterized by an arbitrary .. We instantiate our domain with a polyhedral base domain and evaluate it on programs extracted from the Python test suite. Over traditional, non-relational domains, we find significant precision improvements with minimal performance cost.作者: 微生物 時間: 2025-3-26 06:05 作者: 灰心喪氣 時間: 2025-3-26 09:32
A Formal Semantics for Isorecursive and Equirecursive State Abstractionsit dynamic frames. We show that development of such formalisations requires addressing several subtle issues, such as the possibility of infinitely-recursive definitions and the need for the isorecursive semantics to correctly reflect the restrictions that make it readily implementable. These questi作者: 花費(fèi) 時間: 2025-3-26 13:57
Trustworthy Proxiess paper sheds light on these questions in the context of a Javascript-like language, and describes the design of a Proxy API that allows proxies to emulate objects with invariants, yet have these invariants continue to be language-enforced. This design forms the basis of proxies in ECMAScript 6.作者: 徹底明白 時間: 2025-3-26 18:34 作者: GULLY 時間: 2025-3-26 23:35
RedCard: Redundant Check Elimination for Dynamic Race Detectorslementation for the Java language, enables dynamic race detectors to reduce the number of run-time checks by close to 40% with no loss in precision..We also present a complementary . analysis for identifying when multiple memory locations can be treated as a single location by a dynamic race detecto作者: Circumscribe 時間: 2025-3-27 01:38 作者: Adherent 時間: 2025-3-27 09:03
Composition and Reuse with Compiled Domain-Specific Languages作者: 過去分詞 時間: 2025-3-27 11:51 作者: absolve 時間: 2025-3-27 14:13 作者: 影響帶來 時間: 2025-3-27 18:10
s paper sheds light on these questions in the context of a Javascript-like language, and describes the design of a Proxy API that allows proxies to emulate objects with invariants, yet have these invariants continue to be language-enforced. This design forms the basis of proxies in ECMAScript 6.作者: 套索 時間: 2025-3-27 23:28
,Verfahrensrechtliche Fragen der F?rderung,efine an operational semantics for placeholders, a type system for placeholder types, and prove soundness. Incorporating placeholders into object-oriented languages should make programs simultaneously simpler to write, and easier to write correctly.作者: 瘙癢 時間: 2025-3-28 02:27 作者: Admire 時間: 2025-3-28 06:20
Normen, Richtlinien, Literatur,er library as a replacement for the actual libraries to efficiently construct a sound and precise application call graph. . improves the analysis time of whole-program call graph construction by a factor of 4.3x to 12x, and reduces memory requirements by a factor of 8.4x to 13x. In addition, . makes作者: RALES 時間: 2025-3-28 12:02 作者: 意見一致 時間: 2025-3-28 15:26 作者: CANE 時間: 2025-3-28 21:08 作者: 軍械庫 時間: 2025-3-29 00:28
Heap Decomposition Inference with Linear Programmingeating all as “global.” This paper offers a foundational study of ., the problem of statically extracting the decomposition hierarchy latent in the runtimes of object-oriented programs, henceforth revealing the compositional nature of the heap. The centerpiece of the paper is ., a sound, precise, an作者: Ingenuity 時間: 2025-3-29 03:12 作者: opprobrious 時間: 2025-3-29 08:20
Trustworthy Proxieset object. Both the proxy’s representation and behavior may differ substantially from that of its target object..In many OO languages, objects may have language-enforced invariants associated with them. For instance, an object may declare immutable fields, which are guaranteed to point to the same v作者: AMPLE 時間: 2025-3-29 14:03 作者: Sciatica 時間: 2025-3-29 16:47 作者: 群居動物 時間: 2025-3-29 21:28
Implementing Federated Object Systemsically generated notifications are pushed from their publishers to interested subscribers. Interoperability is a core issue in such federated networked distributed applications. However, the problems of heterogeneity must be reconsidered in the light of tougher conditions than previously: low latenc作者: AGGER 時間: 2025-3-30 02:49 作者: COKE 時間: 2025-3-30 06:06
Ownership-Based Isolation for Concurrent Actors on Multi-core Machineschines. Several approaches have been proposed in the state of the art to circumvent this overhead, but they require to choose two properties out of the three desired ones: safety, programmability, and efficiency. In this paper, we introduce a novel runtime ownership model that supports the first mem作者: 流動才波動 時間: 2025-3-30 08:25
Why Do Scala Developers Mix the Actor Model with other Concurrency Models?cks and data races—two mistakes that are hard to make with actors. Furthermore, it prevents the use of many advanced testing, modeling, and verification tools for actors, as these require . actor programs. This study is the first to point out the phenomenon of mixing concurrency models by Scala deve作者: GRILL 時間: 2025-3-30 13:32 作者: offense 時間: 2025-3-30 16:56
: Whole-Program Analysis without the Whole Programluding all library dependencies. The . makes it possible to generate sound and reasonably precise call graphs without analyzing libraries. We investigate whether the separate compilation assumption can be encoded universally in Java bytecode, such that all existing whole-program analysis frameworks 作者: Legion 時間: 2025-3-30 21:33
QUIC Graphs: Relational Invariant Generation for Containersct interpretation-based framework for automatically inferring . between the set of values stored in these containers. Relations include inclusion relations over unions and intersections, as well as quantified relationships with scalar variables. We develop an abstract domain constructor that builds 作者: 難管 時間: 2025-3-31 03:22
Reducing Lookups for Invariant Checkingriant and a request is received to update a subset of them. We reduce the set of variables to inspect, in order to verify that the invariant is still satisfied. We present a formal model of this scenario, based on a simple query language for the expression of invariants that covers the core of a rea作者: 陳列 時間: 2025-3-31 05:14 作者: 有抱負(fù)者 時間: 2025-3-31 13:13
ECOOP 2013 -- Object-Oriented Programming978-3-642-39038-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: CALL 時間: 2025-3-31 15:42 作者: Alveoli 時間: 2025-3-31 18:16 作者: 剝削 時間: 2025-4-1 01:02 作者: Conjuction 時間: 2025-4-1 05:35
