Sciweavers

1461 search results - page 276 / 293
» Analysis of Constraint Logic Programs
Sort
View
BPM
2008
Springer
125views Business» more  BPM 2008»
13 years 9 months ago
Checking Compliance of Execution Traces to Business Rules
Complex and flexible business processes are critical not only because they are difficult to handle, but also because they often tend to loose their intelligibility. Verifying compl...
Federico Chesani, Paola Mello, Marco Montali, Fabr...
JIIS
2008
89views more  JIIS 2008»
13 years 7 months ago
A note on phase transitions and computational pitfalls of learning from sequences
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
Antoine Cornuéjols, Michèle Sebag
JSS
2008
136views more  JSS 2008»
13 years 7 months ago
Specification, decomposition and agent synthesis for situation-aware service-based systems
Service-based systems are distributed computing systems with the major advantage of enabling rapid composition of distributed applications, such as collaborative research and deve...
Stephen S. Yau, Haishan Gong, Dazhi Huang, Wei Gao...
TDSC
2008
152views more  TDSC 2008»
13 years 7 months ago
Towards Formal Verification of Role-Based Access Control Policies
Specifying and managing access control policies is a challenging problem. We propose to develop formal verification techniques for access control policies to improve the current s...
Somesh Jha, Ninghui Li, Mahesh V. Tripunitara, Qih...
CORR
2011
Springer
165views Education» more  CORR 2011»
12 years 11 months ago
Tight Upper Bounds for Streett and Parity Complementation
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
Yang Cai, Ting Zhang