Sciweavers

210 search results - page 27 / 42
» Partial model checking via abstract interpretation
Sort
View
VSTTE
2005
Springer
14 years 26 days ago
WYSINWYX: What You See Is Not What You eXecute
What You See Is Not What You eXecute: computers do not execute source-code programs; they execute machine-code programs that are generated from source code. Not only can the WYSINW...
Gogul Balakrishnan, Thomas W. Reps, David Melski, ...
ESOP
2008
Springer
13 years 9 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 7 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
PKDD
2010
Springer
160views Data Mining» more  PKDD 2010»
13 years 5 months ago
Entropy and Margin Maximization for Structured Output Learning
Abstract. We consider the problem of training discriminative structured output predictors, such as conditional random fields (CRFs) and structured support vector machines (SSVMs)....
Patrick Pletscher, Cheng Soon Ong, Joachim M. Buhm...
CONTEXT
2007
Springer
14 years 1 months ago
Contexts and Ontologies in Schema Matching
Abstract. In this paper, we propose a general model of schema matching based on the following ideas: on the one hand, a schema is viewed as a context (namely as a partial and appro...
Paolo Bouquet