Sciweavers

295 search results - page 34 / 59
» Approximating the Expressive Power of Logics in Finite Model...
Sort
View
FSTTCS
2010
Springer
14 years 7 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
113
Voted
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 9 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
ASPDAC
2004
ACM
148views Hardware» more  ASPDAC 2004»
15 years 3 months ago
Optimal planning for mesh-based power distribution
— Robust power distribution within available routing area resources is critical to chip performance and reliability. In this paper, we propose a novel and efficient method for o...
Hongyu Chen, Chung-Kuan Cheng, Andrew B. Kahng, Ma...
DAGSTUHL
2000
14 years 11 months ago
Product Form Queueing Networks
Queueing network models have been extensively applied to represent and analyze resource sharing systems such as communication and computer systems and they have proved to be a pow...
Simonetta Balsamo
ACSD
2008
IEEE
106views Hardware» more  ACSD 2008»
14 years 11 months ago
Time-bounded model checking of infinite-state continuous-time Markov chains
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...