Sciweavers

169 search results - page 33 / 34
» A type system for well-founded recursion
Sort
View
BMCBI
2006
103views more  BMCBI 2006»
13 years 6 months ago
Correction of scaling mismatches in oligonucleotide microarray data
Background: Gene expression microarray data is notoriously subject to high signal variability. Moreover, unavoidable variation in the concentration of transcripts applied to micro...
Martino Barenco, Jaroslav Stark, Daniel Brewer, Da...
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 6 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
POPL
2008
ACM
14 years 6 months ago
Engineering formal metatheory
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Arthur Charguéraud, Benjamin C. Pierce, Bri...
PLDI
2004
ACM
13 years 11 months ago
Region inference for an object-oriented language
Region-based memory management offers several important potential advantages over garbage collection, including real-time performance, better data locality, and more efficient us...
Wei-Ngan Chin, Florin Craciun, Shengchao Qin, Mart...
NMR
2004
Springer
13 years 11 months ago
A probabilistic approach to default reasoning
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈...
Miodrag Raskovic, Zoran Ognjanovic, Zoran Markovic