Sciweavers

1167 search results - page 218 / 234
» A Really Temporal Logic
Sort
View
MST
2006
129views more  MST 2006»
13 years 8 months ago
Reachability Problems on Regular Ground Tree Rewriting Graphs
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
Christof Löding
TKDE
2008
177views more  TKDE 2008»
13 years 8 months ago
Analyzing and Managing Role-Based Access Control Policies
Today more and more security-relevant data is stored on computer systems; security-critical business processes are mapped to their digital counterparts. This situation applies to ...
Karsten Sohr, Michael Drouineaud, Gail-Joon Ahn, M...
JSW
2007
156views more  JSW 2007»
13 years 8 months ago
An Automatic Test Case Generation Framework for Web Services
— BPEL (Business Process Execution Language) as a de-facto standard for web service orchestration has drawn particularly attention from researchers and industries. BPEL is a semi...
Yongyan Zheng, Jiong Zhou, Paul Krause
CJ
2004
105views more  CJ 2004»
13 years 8 months ago
Generalized Template Splay: A Basic Theory and Calculus
act interpretation. R. Barbuti, C. Bernardeschi and N. De Francesco With mobile technology more and more prominent, the problem of security leakages becomes more and more important...
George F. Georgakopoulos, David J. McClurkin
CORR
2002
Springer
106views Education» more  CORR 2002»
13 years 8 months ago
Domain-Dependent Knowledge in Answer Set Planning
In this paper we consider three di erent kinds of domain dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative ...
Tran Cao Son, Chitta Baral, Tran Hoai Nam, Sheila ...