Sciweavers

3775 search results - page 477 / 755
» The Expression Problem Revisited
Sort
View
PLDI
2009
ACM
16 years 7 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
POPL
2009
ACM
16 years 7 months ago
Types and higher-order recursion schemes for verification of higher-order programs
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
Naoki Kobayashi
KDD
2004
ACM
302views Data Mining» more  KDD 2004»
16 years 7 months ago
Redundancy based feature selection for microarray data
In gene expression microarray data analysis, selecting a small number of discriminative genes from thousands of genes is an important problem for accurate classification of diseas...
Lei Yu, Huan Liu
CADE
2005
Springer
16 years 7 months ago
Proof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
Claudio Castellini, Alan Smaill
156
Voted
PODS
2006
ACM
118views Database» more  PODS 2006»
16 years 6 months ago
Analyzing workflows implied by instance-dependent access rules
Recently proposed form-based web information systems liberate the capture and reuse of data in organizations by substituting the development of technical implementations of electr...
Toon Calders, Stijn Dekeyser, Jan Hidders, Jan Par...