Sciweavers

2661 search results - page 145 / 533
» Model Checking Performability Properties
Sort
View
CAV
2004
Springer
96views Hardware» more  CAV 2004»
15 years 9 months ago
Widening Arithmetic Automata
Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Gi...
Constantinos Bartzis, Tevfik Bultan
ICC
2008
IEEE
112views Communications» more  ICC 2008»
15 years 10 months ago
Impact of Super-Diffusive Behavior on Routing Performance in Delay Tolerant Networks
— Motivated by the recent findings of super-diffusive patterns in mobility traces, we investigate the impact of superdiffusive behavior of mobile nodes on contact-based metrics ...
Sungwon Kim, Do Do Eun
129
Voted
DBSEC
2007
131views Database» more  DBSEC 2007»
15 years 5 months ago
Dynamic Event-Based Access Control as Term Rewriting
Abstract. Despite the widespread adoption of Role-based Access Control (RBAC) models, new access control models are required for new applications for which RBAC may not be especial...
Clara Bertolissi, Maribel Fernández, Steve ...
105
Voted
CORR
2010
Springer
68views Education» more  CORR 2010»
15 years 3 months ago
An Optimization for Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
Cristina Feier, Stijn Heymans
127
Voted
DATE
2006
IEEE
117views Hardware» more  DATE 2006»
15 years 9 months ago
Formal verification of systemc designs using a petri-net based representation
This paper presents an effective approach to formally verify SystemC designs. The approach translates SystemC models into a Petri-Net based representation. The Petri-net model is ...
Daniel Karlsson, Petru Eles, Zebo Peng