2944 search results - page 298 / 589 » On Well Quasi-orders on Languages |
137
click to vote
ICSE
2008
IEEE-ACM
16 years 6 months ago
2008
IEEE-ACM
Central to the problem frames approach is the distinction of three different descriptions: requirements R, domain assumptions W and specifications S, tied together with the socall...
173
click to vote
PLDI
2010
ACM
16 years 4 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
204
click to vote
ESOP
2010
Springer
16 years 4 months ago
2010
Springer
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
161
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
185
click to vote
ASPLOS
2010
ACM
16 years 1 months ago
2010
ACM
DRAM is facing severe scalability challenges in sub-45nm technology nodes due to precise charge placement and sensing hurdles in deep-submicron geometries. Resistive memories, suc...