Sciweavers

7778 search results - page 55 / 1556
» Designing Controllers for Reachability
Sort
View
TAPSOFT
1997
Springer
15 years 6 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
ATVA
2006
Springer
160views Hardware» more  ATVA 2006»
15 years 6 months ago
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
Giorgio Delzanno, Javier Esparza, Jirí Srba
SAFECOMP
1998
Springer
15 years 6 months ago
Safety Verification of Software Using Structured Petri Nets
A method is described for the analysis and the verification of safety in software systems. The method offers a formal notation for describing the software structure, the means for ...
Krzysztof Sacha
COMAD
2008
15 years 4 months ago
The Efficient Maintenance of Access Roles with Role Hiding
Role-based access control (RBAC) has attracted considerable research interest. However, the computational issues of RBAC models are yet to be thoroughly studied. In this paper, we...
Chaoyi Pang, Xiuzhen Zhang, Yanchun Zhang, Kotagir...
AUTOMATICA
2006
111views more  AUTOMATICA 2006»
15 years 2 months ago
The minimal disturbance invariant set: Outer approximations via its partial sums
This paper is concerned with outer approximations of the minimal disturbance invariant set (MDIS) of a discrete-time linear system with an additive set-bounded disturbance. The k-...
Chong Jin Ong, Elmer G. Gilbert