Sciweavers

444 search results - page 66 / 89
» Termination by Abstraction
Sort
View
ASPDAC
2006
ACM
143views Hardware» more  ASPDAC 2006»
14 years 3 months ago
CDCTree: novel obstacle-avoiding routing tree construction based on current driven circuit model
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
Yiyu Shi, Tong Jing, Lei He, Zhe Feng 0002, Xianlo...
SAINT
2005
IEEE
14 years 2 months ago
A Context-centric Security Middleware for Service Provisioning in Pervasive Computing
Pervasive user mobility, wireless connectivity and the widespread diffusion of portable devices raise new challenges for ubiquitous service provisioning. An emerging architecture ...
Antonio Corradi, Rebecca Montanari, Daniela Tibald...
SIGCSE
2005
ACM
117views Education» more  SIGCSE 2005»
14 years 2 months ago
Design patterns for parsing
We provide a systematic transformation of an LL(1) grammar to an object model that consists of · an object structure representing the non-terminal symbols and their corresponding...
Dung Zung Nguyen, Mathias Ricken, Stephen B. Wong
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
14 years 2 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
FATES
2005
Springer
14 years 2 months ago
Simulated Time for Testing Railway Interlockings with TTCN-3
Abstract. Railway control systems are timed and safety-critical. Testing these systems is a key issue. Prior to system testing, the software of a railway control system is tested s...
Stefan Blom, Natalia Ioustinova, Jaco van de Pol, ...