Sciweavers

1076 search results - page 179 / 216
» Logical Languages for Data Mining
Sort
View
FOSSACS
2009
Springer
14 years 3 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
SIGMOD
1998
ACM
180views Database» more  SIGMOD 1998»
14 years 1 months ago
Integration of Heterogeneous Databases Without Common Domains Using Queries Based on Textual Similarity
Most databases contain “name constants” like course numbers, personal names, and place names that correspond to entities in the real world. Previous work in integration of het...
William W. Cohen
ENTCS
2002
143views more  ENTCS 2002»
13 years 8 months ago
Collecting Statistics over Runtime Executions
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
Bernd Finkbeiner, Sriram Sankaranarayanan, Henny S...
WCRE
2007
IEEE
14 years 3 months ago
Parametric Process Model Inference
Legacy applications can be difficult and time-consuming to understand and update due to the lack of modern abstraction mechanisms in legacy languages, as well as the gradual dete...
Saurabh Sinha, G. Ramalingam, Raghavan Komondoor
TLDI
2005
ACM
126views Formal Methods» more  TLDI 2005»
14 years 2 months ago
Type inference for atomicity
Atomicity is a fundamental correctness property in multithreaded programs. This paper presents an algorithm for verifying atomicity via type inference. The underlying type system ...
Cormac Flanagan, Stephen N. Freund, Marina Lifshin