Sciweavers

404 search results - page 62 / 81
» Temporal Constraints in Non-temporal Data Modelling Language...
Sort
View
124
Voted
LFCS
2009
Springer
15 years 4 months ago
Completeness Results for Memory Logics
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
Carlos Areces, Santiago Figueira, Sergio Mera
FDL
2008
IEEE
14 years 9 months ago
MARTE-based Design of a Multimedia Application and Formal Analysis
Digital television (DTV) is an advanced broadcasting technology that is spreading fast today. It gives broadcasters the capability to send programs with a better picture and sound ...
Adolf Abdallah, Abdoulaye Gamatié, Jean-Luc...
PVLDB
2008
167views more  PVLDB 2008»
14 years 9 months ago
Managing and querying transaction-time databases under schema evolution
The old problem of managing the history of database information is now made more urgent and complex by fast spreading web information systems, such as Wikipedia. Our PRIMA system ...
Hyun Jin Moon, Carlo Curino, Alin Deutsch, Chien-Y...
ACTA
2002
111views more  ACTA 2002»
14 years 9 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht
88
Voted
GPCE
2007
Springer
15 years 3 months ago
Safe composition of product lines
Programs of a software product line can be synthesized by composing modules that implement features. Besides high-level domain constraints that govern the compatibility of feature...
Sahil Thaker, Don S. Batory, David Kitchin, Willia...