Sciweavers

4491 search results - page 288 / 899
» Algorithm Engineering
Sort
View
EMSOFT
2005
Springer
15 years 8 months ago
A structural approach to quasi-static schedulability analysis of communicating concurrent programs
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
Cong Liu, Alex Kondratyev, Yosinori Watanabe, Albe...
KBSE
1999
IEEE
15 years 7 months ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi
SIGSOFT
2004
ACM
15 years 8 months ago
Verifying aspect advice modularly
Aspect-oriented programming has become an increasingly important means of expressing cross-cutting program abstractions. Despite this, aspects lack support for computeraided veriï...
Shriram Krishnamurthi, Kathi Fisler, Michael Green...
CODES
2008
IEEE
15 years 5 months ago
Guaranteed scheduling for repetitive hard real-time tasks under the maximal temperature constraint
We study the problem of scheduling repetitive real-time tasks with the Earliest Deadline First (EDF) policy that can guarantee the given maximal temperature constraint. We show th...
Gang Quan, Yan Zhang, William Wiles, Pei Pei
GLVLSI
2007
IEEE
153views VLSI» more  GLVLSI 2007»
15 years 5 months ago
Address generation for nanowire decoders
Nanoscale crossbars built from nanowires can form high density memories and programmable logic devices. To integrate such nanoscale devices with other circuits, nanowire decoders ...
Jia Wang, Ming-Yang Kao, Hai Zhou