搜索结果: 256-270 共查到“知识库 计算机科学技术基础学科”相关记录8060条 . 查询时间(2.535 秒)
Navigation and Coordination Primitives for Multidimensional Browsers
Data browsing hypermedia magnifying glasses user interfaces
2016/5/24
This paper describes extensions to the Tioga flight-simulator browsing protocol presented by Stonebraker et al. (1993a). These extensions allow users to navigate a multidimensional data space using so...
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations in dynamically typed languages. This paper shows that dynamic typing at least as powerful as Henglein...
Inclusion constraints over set-expressions [1, 4] provide a general formalism to express a large class of program analyses. Over the past two years, we have experimented with inclusion constraints to ...
Optimal Representations of Polymorphic Types with Subtyping (Extended Abstract)
Optimal Representations Polymorphic Types Subtyping (Extended Abstract)
2016/5/24
Many type inference and program analysis systems include notions of subtyping and parametric polymorphism. When used together, these two features induce equivalences that allow types to be simpli ed b...
Barrier Inference
Barrier Inference
2016/5/24
Many parallel programs are written in SPMD style, i.e.by running the same sequential program on all processes.SPMD programs include synchronization, but it is easy to write incorrect synchronization p...
Detecting Races in Relay Ladder Logic Programs
Detecting Races Relay Ladder Logic Programs
2016/5/24
Relay Ladder Logic (RLL) [4] is a programming language widely used for complex embedded control applications such as manufacturing and amusement park rides. The cost of bugs in RLL programs is extreme...
Partial Online Cycle Elimination in Inclusion Constraint Graphs
Partial Online Cycle Elimination Inclusion Constraint Graphs
2016/5/24
Many program analyses are naturally formulated and implemented using inclusion constraints. We present new results on the scalable implementation of such analyses based on two insights: rst, that onl...
Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs
Projection Merging Reducing Redundancies Inclusion Constraint Graphs
2016/5/24
Inclusion-based program analyses are implemented by adding new edges to directed graphs. In most analyses, there are many di erent ways to add a transitive edge between two nodes, namely through each ...
Type Systems for Distributed Data Structures.
Polymorphic versus Monomorphic Flow-Insensitive Points-to Analysis for C
Polymorphic versus Monomorphic Flow-Insensitive Points-to Analysis for C
2016/5/24
Polymorphic versus Monomorphic Flow-Insensitive Points-to Analysis for C.
Entailment with Conditional Equality Constraints
Entailment Conditional Equality Constraints
2016/5/24
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints wi...
We investigate the first-order theory of subtyping constraints.We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where all constructors are ei...
Winnowing: Local Algorithms for Document Fingerprinting
Winnowing Local Algorithms Document Fingerprinting
2016/5/24
Digital content is for copying: quotation, revision, plagiarism, and file sharing all create copies. Document fingerprinting is concerned with accurately identifying copying, including small partial c...
Many computer scientists think of a program as either correct (i.e. it meets some specification) or incorrect (i.e. it does not meet some specification). But industrial software development is as much...