Sciweavers

4218 search results - page 508 / 844
» Complete sets of cooperations
Sort
View
FSEN
2007
Springer
15 years 11 months ago
Test Selection Criteria for Quantifier-Free First-Order Specifications
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulae. Test cases are modeled as ground formulae and any spe...
Marc Aiguier, Agnès Arnould, Pascale Le Gal...
ASAP
2004
IEEE
160views Hardware» more  ASAP 2004»
15 years 11 months ago
Architectural Support for Arithmetic in Optimal Extension Fields
Public-key cryptosystems generally involve computation-intensive arithmetic operations, making them impractical for software implementation on constrained devices such as smart ca...
Johann Großschädl, Sandeep S. Kumar, Ch...
AMT
2006
Springer
107views Multimedia» more  AMT 2006»
15 years 11 months ago
An Intelligent Process Monitoring System in Complex Manufacturing Environment
In high-tech industries, most manufacturing processes are complexly intertwined, in that manufacturers or engineers can hardly control a whole set of processes. They are only capa...
Sung Ho Ha, Boo-Sik Kang
ATAL
2006
Springer
15 years 11 months ago
Temporal qualitative coalitional games
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
186
Voted
CONCUR
2006
Springer
15 years 11 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...