Sciweavers

375 search results - page 47 / 75
» Declarative Reasoning about the Structure of Object-Oriented...
Sort
View
SCP
1998
163views more  SCP 1998»
13 years 8 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
ENTCS
2007
108views more  ENTCS 2007»
13 years 9 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
ICALP
2007
Springer
14 years 3 months ago
Modular Algorithms for Heterogeneous Modal Logics
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
Lutz Schröder, Dirk Pattinson
RE
2007
Springer
14 years 3 months ago
Secure and Dependable Patterns in Organizations: An Empirical Approach
Designing a secure and dependable system is not just a technical issue, it involves also a deep analysis of the organizational and the social environment in which the system will ...
Yudistira Asnar, Paolo Giorgini, Roberto Bonato, V...
WADT
1998
Springer
14 years 15 days ago
An Algebra of Graph Derivations Using Finite (co-) Limit Double Theories
Graph transformation systems have been introduced for the formal specification of software systems. States are thereby modeled as graphs, and computations as graph derivations acco...
Andrea Corradini, Martin Große-Rhode, Reiko ...