Sciweavers

37 search results - page 5 / 8
» Model Checking Knowledge and Linear Time: PSPACE Cases
Sort
View
SIGSOFT
2005
ACM
15 years 10 months ago
Reasoning about confidentiality at requirements engineering time
Growing attention is being paid to application security at requirements engineering time. Confidentiality is a particular subclass of security concerns that requires sensitive inf...
Renaud De Landtsheer, Axel van Lamsweerde
ICSOC
2010
Springer
14 years 8 months ago
Service Discovery Using Communication Fingerprints
A request to a service registry must be answered with a service that fits in several regards, including semantic compatibility, non-functional compatibility, and interface compati...
Olivia Oanea, Jan Sürmeli, Karsten Wolf
CASES
2005
ACM
14 years 11 months ago
Optimizing stream programs using linear state space analysis
Digital Signal Processing (DSP) is becoming increasingly widespread in portable devices. Due to harsh constraints on power, latency, and throughput in embedded environments, devel...
Sitij Agrawal, William Thies, Saman P. Amarasinghe
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
15 years 1 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...
ISSTA
2004
ACM
15 years 2 months ago
An optimizing compiler for batches of temporal logic formulas
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
James Ezick