Sciweavers

24 search results - page 5 / 5
» Faster and More Complete Extended Static Checking for the Ja...
Sort
View
PODS
1994
ACM
138views Database» more  PODS 1994»
13 years 9 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
WWW
2004
ACM
14 years 6 months ago
Analysis of interacting BPEL web services
This paper presents a set of tools and techniques for analyzing interactions of composite web services which are specified in BPEL and communicate through asynchronous XML message...
Xiang Fu, Tevfik Bultan, Jianwen Su
PODS
2008
ACM
178views Database» more  PODS 2008»
14 years 5 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
ICSE
2003
IEEE-ACM
13 years 10 months ago
A Tutorial on Feature Oriented Programming and Product-Lines
ct Feature Oriented Programming (FOP) is a design methodology and tools for program synthesis. The goal is to specify a target program in terms of the features that it offers, and ...
Don S. Batory