Sciweavers

191 search results - page 15 / 39
» Second-Order Programs with Preconditions
Sort
View
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 5 months ago
Recursive Definitions of Monadic Functions
Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple opt...
Alexander Krauss
OOPSLA
2010
Springer
13 years 5 months ago
A simple inductive synthesis methodology and its applications
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Moo...
KDD
2006
ACM
201views Data Mining» more  KDD 2006»
14 years 7 months ago
Clustering based large margin classification: a scalable approach using SOCP formulation
This paper presents a novel Second Order Cone Programming (SOCP) formulation for large scale binary classification tasks. Assuming that the class conditional densities are mixture...
J. Saketha Nath, Chiranjib Bhattacharyya, M. Naras...
ECOOP
2009
Springer
14 years 8 months ago
Implicit Dynamic Frames: Combining Dynamic Frames and Separation Logic
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...
Jan Smans, Bart Jacobs 0002, Frank Piessens
DEXA
2000
Springer
95views Database» more  DEXA 2000»
13 years 11 months ago
Formalizing Workflows Using the Event Calculus
The event calculus is a logic programming formalism for representing events and their effects especially in database applications. This paper presents the use of the event calculus...
Nihan Kesim Cicekli, Yakup Yildirim