6348 search results - page 975 / 1270 » A Lesson for Software Engineering from Knowledge Engineering |
124
click to vote
FOSSACS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In order to study relative PCF-definability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [3, 5]). We introduce the notion of t...
155
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
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...
158
click to vote
ISSRE
2003
IEEE
15 years 12 months ago
2003
IEEE
Use-cases and scenarios have been identified as good inputs to generate test cases and oracles at requirement level. Yet to have an automated generation, information is missing f...
126
click to vote
FATES
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper we propose an approach to automatically produce test cases allowing to check the satis ability of a linear property on a given implementation. Linear proper...
137
click to vote
COMPSAC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—We define here a simple, low level control procedure definition, to support application implementation on a particular multiprocessor platform, namely the SegBus segme...