Sciweavers

3573 search results - page 388 / 715
» Reasoning about Codata
Sort
View
154
Voted
JITECH
2006
70views more  JITECH 2006»
15 years 6 months ago
Using coevolutionary and complexity theories to improve IS alignment: a multi-level approach
The misalignment of information systems (IS) components with the rest of an organization remains a critical and chronic unsolved problem in today's complex and turbulent worl...
Hind Benbya, Bill McKelvey
LOBJET
2008
104views more  LOBJET 2008»
15 years 6 months ago
Une approche formelle de la reconfiguration dynamique
Self-adapting software adapts its behavior in an autonomic way, by dynamically adding, suppressing and recomposing components, and by the use of computational reflection. One way t...
M. Simonot, M. Aponte
JOLLI
2006
86views more  JOLLI 2006»
15 years 6 months ago
Types as Graphs: Continuations in Type Logical Grammar
Applying the programming-language concept of continuations, we propose a new multimodal analysis of quantification in Type Logical Grammar. Our approach naturally gives rise to a n...
Chris Barker, Chung-chieh Shan
ENTCS
2007
116views more  ENTCS 2007»
15 years 6 months ago
A Logical Characterisation of Static Equivalence
The work of Abadi and Fournet introduces the notion of a frame to describe the knowledge of the environment of a cryptographic protocol. Frames are lists of terms; two frames are ...
Hans Hüttel, Michael D. Pedersen
ENTCS
2007
108views more  ENTCS 2007»
15 years 6 months ago
Termination Criteria for DPO Transformations with Injective Matches
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
Tihamer Levendovszky, Ulrike Prange, Hartmut Ehrig