Sciweavers

1060 search results - page 177 / 212
» Mechanized semantics
Sort
View
FOAL
2007
ACM
15 years 1 months ago
Requirement enforcement by transformation automata
The goal of this work is to treat safety and security policies as requirements to be composed in an aspectual style with a developing application. Policies can be expressed either...
Douglas R. Smith
DSRT
2009
IEEE
15 years 1 months ago
Statemachine Matching in BOM Based Model Composition
Base Object Model (BOM) is a component-based standard designed to support reusability and Composability. Reusability helps in reducing time and cost of the development of a simula...
Imran Mahmood, Rassul Ayani, Vladimir Vlassov, Far...
AMAST
2006
Springer
15 years 1 months ago
Some Programming Languages for Logspace and Ptime
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
Guillaume Bonfante
DBISP2P
2006
Springer
110views Database» more  DBISP2P 2006»
15 years 1 months ago
Reusing Classical Query Rewriting in P2P Databases
Sharing of structured data in P2P overlays is a challenging problem, especially in the absence of a global schema. The nature of structured data stored in the overlay enforces stri...
Verena Kantere, Timos K. Sellis
EDBTW
2006
Springer
15 years 1 months ago
Enhanced Regular Path Queries on Semistructured Databases
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...
Dan C. Stefanescu, Alex Thomo