Sciweavers

128 search results - page 22 / 26
» Logical Data Independence Reconsidered (Extended Abstract)
Sort
View
CONCUR
2007
Springer
14 years 1 months ago
Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures
We present a fixpoint-based algorithm for context-sensitive interprocedural kill/gen-analysis of programs with thread creation. Our algorithm is precise up to abstraction of sync...
Peter Lammich, Markus Müller-Olm
SAS
2004
Springer
140views Formal Methods» more  SAS 2004»
14 years 10 days ago
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Sumit Gulwani, George C. Necula
TMM
2010
199views Management» more  TMM 2010»
13 years 1 months ago
Video Annotation Through Search and Graph Reinforcement Mining
Abstract--Unlimited vocabulary annotation of multimedia documents remains elusive despite progress solving the problem in the case of a small, fixed lexicon. Taking advantage of th...
Emily Moxley, Tao Mei, Bangalore S. Manjunath
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 3 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
POPL
2007
ACM
14 years 7 months ago
Specialization of CML message-passing primitives
Concurrent ML (CML) is a statically-typed higher-order concurrent language that is embedded in Standard ML. Its most notable feature is its support for first-class synchronous ope...
John H. Reppy, Yingqi Xiao