Sciweavers

1722 search results - page 259 / 345
» Variables in Concept Graphs
Sort
View
134
Voted
STACS
2010
Springer
15 years 11 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
112
Voted
CGO
2010
IEEE
15 years 10 months ago
Dynamic interpretation for dynamic scripting languages
Dynamic scripting languages offer programmers increased flexibility by allowing properties of programs to be defined at run-time. Typically, program execution begins with an int...
Kevin Williams, Jason McCandless, David Gregg
126
Voted
ICST
2009
IEEE
15 years 10 months ago
Test Input Generation Using UML Sequence and State Machines Models
We propose a novel testing approach that combines information from UML sequence models and state machine models. Current approaches that rely solely on sequence models do not cons...
Aritra Bandyopadhyay, Sudipto Ghosh
139
Voted
CSL
2009
Springer
15 years 10 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
MODELS
2009
Springer
15 years 10 months ago
Feature-oriented programming with Ruby
Features identify core characteristics of software in order to produce families of programs. Through configuration, different variants of a program can be composed. Our approach...
Sebastian Günther, Sagar Sunkle