3820 search results - page 289 / 764 » Bounded Model Debugging |
138
click to vote
BIRTHDAY
2008
Springer
15 years 6 months ago
2008
Springer
As Dag Normann has recently shown, the fully abstract model for PCF of hereditarily sequential functionals is not -complete and therefore not continuous in the traditional terminol...
131
click to vote
ENTCS
2007
15 years 3 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
145
click to vote
JSC
2006
15 years 3 months ago
2006
In statistics, mixture models consisting of several component subpopulations are used widely to model data drawn from heterogeneous sources. In this paper, we consider maximum lik...
87
Voted
ICSE
2003
IEEE-ACM
16 years 4 months ago
2003
IEEE-ACM
Reflection remains a second-class citizen in current programming models, where it's assumed to be imperative and tightly bound to its implementation. In contrast, most object...
119
click to vote
DIGRA
2003
Springer
15 years 9 months ago
2003
Springer
We present a structural framework to describe games in terms of components. The components are divided into four major areas: meta-structure, bounding, narrative and objective. Th...