Sciweavers

1940 search results - page 323 / 388
» Graph Transformation with Variables
Sort
View
STACS
2010
Springer
16 years 1 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...
CGO
2010
IEEE
16 years 27 days 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
ICST
2009
IEEE
16 years 20 days 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
CSL
2009
Springer
16 years 18 days 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
16 years 17 days 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