Sciweavers

562 search results - page 21 / 113
» Ordered Sets in the Calculus of Data Structures
Sort
View
ECOOP
2012
Springer
13 years 3 days ago
Static Detection of Loop-Invariant Data Structures
As a culture, object-orientation encourages programmers to create objects, both short- and long-lived, without concern for cost. Excessive object creation and initialization can ca...
Guoqing (Harry) Xu, Dacong Yan, Atanas Rountev
DAGSTUHL
2010
14 years 11 months ago
Tracking Lines in Higher Order Tensor Fields
While tensors occur in many areas of science and engineering, little has been done to visualize tensors with order higher than two. Tensors of higher orders can be used for exampl...
Mario Hlawitschka, Gerik Scheuermann
BMCBI
2006
159views more  BMCBI 2006»
14 years 9 months ago
MultiSeq: unifying sequence and structure data for evolutionary analysis
Background: Since the publication of the first draft of the human genome in 2000, bioinformatic data have been accumulating at an overwhelming pace. Currently, more than 3 million...
Elijah Roberts, John Eargle, Dan Wright, Zaida Lut...
SP
2010
IEEE
152views Security Privacy» more  SP 2010»
14 years 7 months ago
Scalable Parametric Verification of Secure Systems: How to Verify Reference Monitors without Worrying about Data Structure Size
The security of systems such as operating systems, hypervisors, and web browsers depend critically on reference monitors to correctly enforce their desired security policy in the ...
Jason Franklin, Sagar Chaki, Anupam Datta, Arvind ...
105
Voted
RTA
1995
Springer
15 years 1 months ago
Completion for Multiple Reduction Orderings
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi