Sciweavers

254 search results - page 10 / 51
» Extended Process Rewrite Systems: Expressiveness and Reachab...
Sort
View
RTA
1995
Springer
15 years 1 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...
CORR
2007
Springer
147views Education» more  CORR 2007»
14 years 9 months ago
Model Checking Synchronized Products of Infinite Transition Systems
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...
Stefan Wöhrle, Wolfgang Thomas
PVLDB
2008
118views more  PVLDB 2008»
14 years 9 months ago
XTCcmp: XQuery compilation on XTC
XTCcmp, the XQuery Compiler of a native XML database system, extends Starburst's well-known Query Graph Model to serve as an internal representation and basis for query restr...
Christian Mathis, Andreas M. Weiner, Theo Här...
ADVSE
2010
103views more  ADVSE 2010»
14 years 4 months ago
Extending Conceptual Schemas with Business Process Information
Abstract. The specification of business processes is becoming a more and more critical aspect for organizations. Such processes are specified as workflow models expressing the logi...
Marco Brambilla, Jordi Cabot, Sara Comai
EDBT
2009
ACM
85views Database» more  EDBT 2009»
15 years 2 months ago
Expressive, yet tractable XML keys
Constraints are important for a variety of XML recommendations and applications. Consequently, there are numerous opportunities for advancing the treatment of XML semantics. In pa...
Sven Hartmann, Sebastian Link