Sciweavers

475 search results - page 42 / 95
» Formal Analysis of Processor Timing Models
Sort
View
ISSTA
1998
ACM
15 years 6 months ago
Improving Efficiency of Symbolic Model Checking for State-Based System Requirements
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
William Chan, Richard J. Anderson, Paul Beame, Dav...
IPPS
1999
IEEE
15 years 7 months ago
Run-Time Selection of Block Size in Pipelined Parallel Programs
Parallelizing compiler technology has improved in recent years. One area in which compilers have made progress is in handling DOACROSS loops, where crossprocessor data dependencie...
David K. Lowenthal, Michael James
NJC
2006
125views more  NJC 2006»
15 years 3 months ago
PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms
Abstract. We present a new parallel computation model called the Parallel ResourceOptimal computation model. PRO is a framework being proposed to enable the design of efficient and...
Assefaw Hadish Gebremedhin, Mohamed Essaïdi, ...
ICSE
2004
IEEE-ACM
16 years 3 months ago
Elaborating Security Requirements by Construction of Intentional Anti-Models
Caring for security at requirements engineering time is a message that has finally received some attention recently. However, it is not yet very clear how to achieve this systemat...
Axel van Lamsweerde
EGPGV
2004
Springer
165views Visualization» more  EGPGV 2004»
15 years 8 months ago
Tuning of Algorithms for Independent Task Placement in the Context of Demand-Driven Parallel Ray Tracing
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
Tomas Plachetka