Sciweavers

12981 search results - page 517 / 2597
» Model Checking (Abstract)
Sort
View
IIWAS
2008
15 years 7 months ago
A model-prover for constrained dynamic conversations
In a service-oriented architecture, systems communicate by exchanging messages. In this work, we propose a formal model based on OCL-constrained UML Class diagrams and a methodolo...
Diletta Cacciagrano, Flavio Corradini, Rosario Cul...
170
Voted
PLANX
2008
15 years 7 months ago
Linear Time Membership for a Class of XML Types with Interleaving and Counting
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
163
Voted
IFIP13
2004
15 years 7 months ago
Analysing Dynamic Function Scheduling Decisions
: Function allocation, as a process used in the construction of dependable complex systems, is a significant aspect of the design and implementation of interactive systems. It invo...
Karsten Loer, Michael Hildebrandt, Michael D. Harr...
SEBD
2001
145views Database» more  SEBD 2001»
15 years 7 months ago
Reasoning over Conceptual Schemas and Queries in Temporal Databases
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
Alessandro Artale, Enrico Franconi, Milenko Mosuro...
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 6 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari