Sciweavers

778 search results - page 137 / 156
» Expressiveness and complexity of graph logic
Sort
View
ICDT
2001
ACM
131views Database» more  ICDT 2001»
14 years 3 months ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
SIGSOFT
2000
ACM
14 years 3 months ago
Automated systematic testing for constraint-based interactive services
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
Patrice Godefroid, Lalita Jategaonkar Jagadeesan, ...
DBPL
1999
Springer
114views Database» more  DBPL 1999»
14 years 3 months ago
Structured Document Transformations Based on XSL
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...
Sebastian Maneth, Frank Neven
EATIS
2007
ACM
14 years 2 months ago
Ontology Based Affective Context Representation
In this paper we propose an ontology based representation of the affective states for context aware applications that allows expressing the complex relations that are among the af...
Kuderna-Iulian Benta, Anca Rarau, Marcel Cremene
DATE
2004
IEEE
184views Hardware» more  DATE 2004»
14 years 2 months ago
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements
We show how to automatically verify that complex XScale-like pipelined machine models satisfy the same safety and liveness properties as their corresponding instruction set archit...
Panagiotis Manolios, Sudarshan K. Srinivasan