Sciweavers

999 search results - page 108 / 200
» Constraints in Non-Boolean Contexts
Sort
View
PODS
2006
ACM
118views Database» more  PODS 2006»
16 years 6 months ago
Analyzing workflows implied by instance-dependent access rules
Recently proposed form-based web information systems liberate the capture and reuse of data in organizations by substituting the development of technical implementations of electr...
Toon Calders, Stijn Dekeyser, Jan Hidders, Jan Par...
ALT
2008
Springer
16 years 3 months ago
Iterative Learning of Simple External Contextual Languages
It is investigated for which choice of a parameter q, denoting the number of contexts, the class of simple external contextual languages is iteratively learnable. On one hand, the ...
Leonor Becerra-Bonache, John Case, Sanjay Jain, Fr...
VMCAI
2009
Springer
16 years 29 days ago
Reducing Behavioural to Structural Properties of Programs with Procedures
Abstract There is an intimate link between program structure and behaviour. Exploiting this link to phrase program correctness problems in terms of the structural properties of a p...
Dilian Gurov, Marieke Huisman
CBSE
2009
Springer
16 years 23 days ago
Selecting Fault Tolerant Styles for Third-Party Components with Model Checking Support
To build highly available or reliable applications out of unreliable third-party components, some software-implemented fault-tolerant mechanisms are introduced to gracefully deal w...
Junguo Li, Xiangping Chen, Gang Huang, Hong Mei, F...
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
16 years 23 days ago
Dynamic Path Reduction for Software Model Checking
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...