4917 search results - page 480 / 984 » Software Engineering is Not Computer Science |
156
click to vote
FSEN
2009
Springer
15 years 11 months ago
2009
Springer
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
125
Voted
CISIS
2008
IEEE
15 years 11 months ago
2008
IEEE
Parallel algorithms divide computation among several threads. In many cases, the input must also be divided. Consider an input consisting of a linear sequence of elements whose le...
139
click to vote
COMPSAC
2008
IEEE
15 years 11 months ago
2008
IEEE
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
136
click to vote
ICSM
2008
IEEE
15 years 11 months ago
2008
IEEE
An automated approach to the identification of C++0x concepts in function templates is described. Concepts are part of a new language feature appearing in the next standard for C+...
151
Voted
KBSE
2008
IEEE
15 years 11 months ago
2008
IEEE
- Service discovery has been recognised as an important activity for service-based systems. In this paper we describe a framework for dynamic service discovery that supports the id...