作者: theta-waves 時(shí)間: 2025-3-21 22:06 作者: armistice 時(shí)間: 2025-3-22 02:45
Beantwortung der Forschungsfragenon algorithms in the literature do not handle Scala features, such as traits and abstract type members. Applying existing call graph construction algorithms to the JVM bytecodes generated by the Scala compiler produces very imprecise results due to type information being lost during compilation. We 作者: 放肆的你 時(shí)間: 2025-3-22 05:25 作者: 豐富 時(shí)間: 2025-3-22 10:03
Jürgen Enders,Christoph Heine,Peter Kl?sypes (e.g. regular expressions), but user-defined types must use general-purpose syntax. Frustration with this causes developers to use strings, rather than structured data, with alarming frequency, leading to correctness, performance, security, and usability issues. Allowing library providers to mo作者: Flavouring 時(shí)間: 2025-3-22 14:12 作者: Flavouring 時(shí)間: 2025-3-22 20:25 作者: 初次登臺(tái) 時(shí)間: 2025-3-22 22:45 作者: 破譯密碼 時(shí)間: 2025-3-23 04:22 作者: Duodenitis 時(shí)間: 2025-3-23 07:18
,Mehr Demokratief?rderung wagen,re any hardware or complex software infrastructure support. We focus on minimizing logging overhead as it only logs a subset of system calls and thread spawns. Replay is on a single core. During replay, our technique first tries to follow only the event order in the log. However, due to schedule dif作者: 為寵愛 時(shí)間: 2025-3-23 17:04
Ziele und Methodik der empirischen Studie,les, or by means of set inclusion between type interpretations, following the more intuitive approach of semantic subtyping, which allows simpler proofs of the expected properties of the subtyping relation..In object-oriented programming, recursive types are typically interpreted inductively; howeve作者: LATE 時(shí)間: 2025-3-23 18:17 作者: Militia 時(shí)間: 2025-3-24 00:19 作者: 壓倒 時(shí)間: 2025-3-24 04:50 作者: 變量 時(shí)間: 2025-3-24 09:41
,Zusammenfassung und Ausblick – eine Vision, which offers seamless usage, but limits DSL developers, or a . (multi-staged) embedding which offers freedom to optimize at will, but is less seamless to use and incurs additional runtime overhead. We propose a metaprogrammatic approach for extracting domain-specific programs from user programs for作者: Morose 時(shí)間: 2025-3-24 10:40 作者: 外面 時(shí)間: 2025-3-24 15:18 作者: exostosis 時(shí)間: 2025-3-24 19:30
Zeiten der Unruhe, Zeiten der Not,rected against vulnerable ones. Web browser vendors have therefore recently developed new extension frameworks aimed at better isolating extensions while still allowing access to privileged browser state. For instance Google Chrome extension architecture and Mozilla’s Jetpack extension framework..We作者: 緯線 時(shí)間: 2025-3-25 01:50 作者: 憤世嫉俗者 時(shí)間: 2025-3-25 04:09 作者: spondylosis 時(shí)間: 2025-3-25 10:40 作者: famine 時(shí)間: 2025-3-25 12:07 作者: 樂器演奏者 時(shí)間: 2025-3-25 17:25 作者: 消散 時(shí)間: 2025-3-25 21:44
Das Forschungsdesign der empirischen Studiet-sensitive Andersen’s pointer analysis using all 11 DaCapo benchmarks and two applications. . can make a disciplined tradeoff among soundness, precision and scalability while also discovering usually more reflective targets. . is useful for any pointer analysis, particularly under-approximate techn作者: 啜泣 時(shí)間: 2025-3-26 02:14
Jürgen Enders,Christoph Heine,Peter Kl?sen a literal appears where a term of that type is expected, guaranteeing non-interference. We give evidence supporting the applicability of this approach and formally specify it with a bidirectionally typed elaboration semantics for the Wyvern programming language.作者: 顛簸地移動(dòng) 時(shí)間: 2025-3-26 06:40
Zielsetzungen und Forschungsfragen, on the principle of encoding type information corresponding to captured variables in the type of a spore. We prove our type system sound, implement our approach for Scala, evaluate its practicality through a small empirical study, and show the power of these guarantees through a case analysis of re作者: 嗎啡 時(shí)間: 2025-3-26 08:41 作者: 變化 時(shí)間: 2025-3-26 15:43 作者: 消息靈通 時(shí)間: 2025-3-26 17:06
Safely Composable Type-Specific Languagesen a literal appears where a term of that type is expected, guaranteeing non-interference. We give evidence supporting the applicability of this approach and formally specify it with a bidirectionally typed elaboration semantics for the Wyvern programming language.作者: Etymology 時(shí)間: 2025-3-26 23:02
Spores: A Type-Based Foundation for Closures in the Age of Concurrency and Distribution on the principle of encoding type information corresponding to captured variables in the type of a spore. We prove our type system sound, implement our approach for Scala, evaluate its practicality through a small empirical study, and show the power of these guarantees through a case analysis of re作者: Wordlist 時(shí)間: 2025-3-27 01:15 作者: lymphoma 時(shí)間: 2025-3-27 08:49
0302-9743 ctions named: analysis; design; concurrency; types; implementation; refactoring; JavaScript, PHP and frameworks; and parallelism.978-3-662-44201-2978-3-662-44202-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 冷淡周邊 時(shí)間: 2025-3-27 10:36
,Zusammenfassung und Ausblick – eine Vision, custom processing. This allows for similar optimization options as deep embedding, while still allowing for seamless embedded usage. We have implemented a simplified instance of this approach in a prototype framework for Java-embedded EDSL expressions, which relies on load-time reflection for improved deployability and usability.作者: Concrete 時(shí)間: 2025-3-27 14:19
Conference proceedings 2014ust 2014. The 27 papers presented in this volume were carefully reviewed and selected from 101 submissions. They are organized in topical sections named: analysis; design; concurrency; types; implementation; refactoring; JavaScript, PHP and frameworks; and parallelism.作者: Lipoma 時(shí)間: 2025-3-27 21:09 作者: Dislocation 時(shí)間: 2025-3-28 00:36
Warum Sprachkompetenz? – Eine Reflexions-to algorithm in terms of their respective performance and accuracy on a client application. The experimental results on real JavaScript websites show that the new points-to analysis significantly improves precision, uniquely resolving on average 11% more property lookup statements.作者: 賄賂 時(shí)間: 2025-3-28 04:15
Forschung zur diagnostischen Kompetenz,combination of well-known language features: lexical nesting, lambda expressions, multi-part method names, optional typing, and pluggable checkers. Grace’s approach to dialects is validated by a series of case studies, including both extensions and restrictions of the base language.作者: Measured 時(shí)間: 2025-3-28 07:38
Konzeptuelle Fassungen von Inklusion to a Javadoc control in a between-subjects laboratory experiment. We find that Plaiddoc participants complete state search tasks in significantly less time and with significantly fewer errors than Javadoc participants.作者: Connotation 時(shí)間: 2025-3-28 12:44 作者: Addictive 時(shí)間: 2025-3-28 18:13 作者: 孤僻 時(shí)間: 2025-3-28 20:05 作者: braggadocio 時(shí)間: 2025-3-28 23:01 作者: 充滿人 時(shí)間: 2025-3-29 07:06
State-Sensitive Points-to Analysis for the Dynamic Behavior of JavaScript Objectss-to algorithm in terms of their respective performance and accuracy on a client application. The experimental results on real JavaScript websites show that the new points-to analysis significantly improves precision, uniquely resolving on average 11% more property lookup statements.作者: 黑豹 時(shí)間: 2025-3-29 07:20 作者: hangdog 時(shí)間: 2025-3-29 12:31
Structuring Documentation to Support State Search: A Laboratory Experiment about Protocol Programmin to a Javadoc control in a between-subjects laboratory experiment. We find that Plaiddoc participants complete state search tasks in significantly less time and with significantly fewer errors than Javadoc participants.作者: euphoria 時(shí)間: 2025-3-29 16:35
Reusable Concurrent Data Types-based and lock-free synchronizations on SPARC and x86-64 architectures and we integrate our methodology to a travel reservation benchmark. Although our reusable CDTs are sometimes less efficient than non-composable handcrafted CDTs from the JDK, they outperform all reusable Java CDTs.作者: GULP 時(shí)間: 2025-3-29 21:04
Infrastructure-Free Logging and Replay of Concurrent Execution on Multiple Coresdoes not lead to progress, it further reorders shared variable accesses. The exploration is facilitated by a sophisticated caching mechanism. Our experiments on real world programs and real workload show that the proposed technique has very low logging overhead (2.6% on average) and fast schedule reconstruction.作者: 傲慢物 時(shí)間: 2025-3-30 00:12 作者: Permanent 時(shí)間: 2025-3-30 07:35
Retargetting Legacy Browser Extensions to Modern Extension Frameworkso that they conform to the constraints imposed by Jetpack and simplify runtime policy enforcement. Finally, we present an experimental evaluation of Morpheus by applying it to port 52 legacy Firefox extensions to the Jetpack framework.作者: Adulate 時(shí)間: 2025-3-30 11:09
Beantwortung der Forschungsfragensed on Featherweight Scala. We evaluate our algorithms on a collection of Scala programs. Our results show that careful handling of complex Scala constructs greatly helps precision and that our most precise analysis generates call graphs with 1.1-3.7 times fewer nodes and 1.5-18.7 times fewer edges than a bytecode-based RTA analysis.作者: 莎草 時(shí)間: 2025-3-30 12:57 作者: 樹膠 時(shí)間: 2025-3-30 20:36 作者: foppish 時(shí)間: 2025-3-31 00:12 作者: 有效 時(shí)間: 2025-3-31 03:39 作者: Feature 時(shí)間: 2025-3-31 05:08 作者: antidepressant 時(shí)間: 2025-3-31 12:58 作者: VAN 時(shí)間: 2025-3-31 14:39
Constructing Call Graphs of Scala Programssed on Featherweight Scala. We evaluate our algorithms on a collection of Scala programs. Our results show that careful handling of complex Scala constructs greatly helps precision and that our most precise analysis generates call graphs with 1.1-3.7 times fewer nodes and 1.5-18.7 times fewer edges than a bytecode-based RTA analysis.作者: 疲憊的老馬 時(shí)間: 2025-3-31 19:01
Finding Reference-Counting Errors in Python/C Programs with Affine Analysisn Python/C interface code. Pungi transforms Python/C interface code into affine programs with respect to our proposed abstractions of reference counts. Our system performs static analysis on transformed affine programs and reports possible reference counting errors. Our prototype implementation found over 150 errors in a set of Python/C programs.作者: 擔(dān)心 時(shí)間: 2025-4-1 00:42 作者: macabre 時(shí)間: 2025-4-1 05:43 作者: Infiltrate 時(shí)間: 2025-4-1 07:37
Sound and Complete Subtyping between Coinductive Types for Object-Oriented Languagess, which are particularly interesting for object-oriented programming, and develop and implement a sound and complete top-down direct and effective algorithm for deciding it. To our knowledge, this is the first proposal for a sound and complete top-down direct algorithm for semantic subtyping between coinductive types.作者: insolence 時(shí)間: 2025-4-1 14:02 作者: delta-waves 時(shí)間: 2025-4-1 15:06
Stream Processing with a Spreadsheetadsheet that enables visualizing live streams, live programming to compute new streams, and exporting computations to be run on a server where they can be shared with other users, and persisted beyond the life of the spreadsheet. We formalize our core language, and present case studies that cover a range of stream processing applications.作者: Anal-Canal 時(shí)間: 2025-4-1 19:16 作者: 客觀 時(shí)間: 2025-4-1 22:59
State-Sensitive Points-to Analysis for the Dynamic Behavior of JavaScript Objectsoving properties at runtime. Points-to analysis calculates the set of values a reference property or variable may have during execution. We present a novel, partially flow-sensitive, context-sensitive points-to algorithm that accurately models dynamic changes in object behavior. The algorithm repres作者: LANCE 時(shí)間: 2025-4-2 03:43
