5547 search results - page 478 / 1110 » Software Variability Management |
219
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
We propose a new language concept called "L-closures" for a running program to legitimately inspect/modify the contents of its execution stack. L-closures are lightweight...
163
click to vote
ICSE
2000
IEEE-ACM
15 years 10 months ago
2000
IEEE-ACM
To compute accurate information efficiently for programs that use pointer variables, a program analysis must account for the fact that a procedure may access different sets of mem...
189
click to vote
CISSE
2008
Springer
15 years 8 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
208
click to vote
FASE
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
180
click to vote
FOSSACS
2008
Springer
15 years 8 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...