Sciweavers

8132 search results - page 231 / 1627
» Dependability, Abstraction, and Programming
Sort
View
POS
2000
Springer
15 years 10 months ago
Hyper-Code Revisited: Unifying Program Source, Executable, and Data
Abstract. The technique of hyper-programming allows program representations held in a persistent store to contain embedded links to persistent code and data. In 1994, Connor et al ...
Evangelos Zirintsis, Graham N. C. Kirby, Ronald Mo...
LOPSTR
2004
Springer
16 years 36 min ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
CAV
2010
Springer
158views Hardware» more  CAV 2010»
15 years 10 months ago
Model-Checking Parameterized Concurrent Programs Using Linear Interfaces
Abstract. We consider the verification of parameterized Boolean proabstractions of shared-memory concurrent programs with an unbounded number of threads. We propose that such prog...
Salvatore La Torre, P. Madhusudan, Gennaro Parlato
ICML
2007
IEEE
16 years 7 months ago
Discriminant kernel and regularization parameter learning via semidefinite programming
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection o...
Jieping Ye, Jianhui Chen, Shuiwang Ji
ICLP
2009
Springer
16 years 7 months ago
Constraint Based Languages for Biological Reactions
In this paper, we study the modelization of biochemical reaction by using concurrent constraint programming idioms. In particular we will consider the stochastic concurrent constra...
Marco Bottalico, Stefano Bistarelli