210 search results - page 27 / 42 » Partial model checking via abstract interpretation |
96
Voted
VSTTE
2005
Springer
15 years 5 months ago
2005
Springer
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...
117
Voted
ESOP
2008
Springer
15 years 2 months ago
2008
Springer
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...
87
Voted
CORR
2010
Springer
15 years 15 days ago
2010
Springer
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 ...
108
Voted
PKDD
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We consider the problem of training discriminative structured output predictors, such as conditional random fields (CRFs) and structured support vector machines (SSVMs)....
112
Voted
CONTEXT
2007
Springer
15 years 6 months ago
2007
Springer
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...