Sciweavers

1148 search results - page 164 / 230
» Software engineering considered harmful
Sort
View
FSTTCS
2004
Springer
15 years 6 months ago
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
Ahmed Bouajjani, Antoine Meyer
FSTTCS
2004
Springer
15 years 6 months ago
Decidability of MSO Theories of Tree Structures
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...
Angelo Montanari, Gabriele Puppis
FSTTCS
2004
Springer
15 years 6 months ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala
86
Voted
FSTTCS
2004
Springer
15 years 6 months ago
Toward a Grainless Semantics for Shared-Variable Concurrency
Abstract. Conventional semantics for shared-variable concurrency suffers from the “grain of time” problem, i.e., the necessity of specifying a default level of atomicity. We pr...
John C. Reynolds
MSR
2010
ACM
15 years 5 months ago
A comparative exploration of FreeBSD bug lifetimes
—In this paper, we explore the viability of mining the basic data provided in bug repositories to predict bug lifetimes. We follow the method of Lucas D. Panjer as described in h...
Gargi Bougie, Christoph Treude, Daniel M. Germ&aac...