2419 search results - page 289 / 484 » A Formal Approach to Software Testing |
159
click to vote
SAC
2009
ACM
15 years 8 months ago
2009
ACM
This paper presents a novel software engineering approach for developing a dynamic web interface that meets the quality criterion of “WYDIWYS” - What You Do Is What You See. T...
123
click to vote
FOSSACS
2003
Springer
15 years 9 months ago
2003
Springer
In previous work we have investigated a notion of approximate bisimilarity for labelled Markov processes. We argued that such a notion is more realistic and more feasible to compu...
173
click to vote
SIAMCOMP
2011
14 years 7 months ago
2011
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
113
Voted
POPL
2010
ACM
16 years 1 months ago
2010
ACM
This paper presents a method for creating formally correct just-intime (JIT) compilers. The tractability of our approach is demonstrated through, what we believe is the first, ver...
126
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...