Sciweavers

57 search results - page 11 / 12
» Semantic Abstraction Rules for Class Diagrams
Sort
View
JANCL
2008
170views more  JANCL 2008»
13 years 7 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
WOLLIC
2009
Springer
14 years 2 months ago
Classic-Like Analytic Tableaux for Finite-Valued Logics
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
Carlos Caleiro, João Marcos
ICMT
2009
Springer
14 years 2 months ago
A Simple Game-Theoretic Approach to Checkonly QVT Relations
Abstract. The QVT Relations (QVT-R) transformation language allows the definition of bidirectional model transformations, which are required in cases where a two (or more) models ...
Perdita Stevens
ECWEB
2004
Springer
148views ECommerce» more  ECWEB 2004»
14 years 26 days ago
OCL-Constraints for UMM Business Collaborations
Abstract. Recently, a trend towards business processes in Business-toBusiness e-Commerce (B2B) is apparent. One of the most promising approaches is UN/CEFACT’s modeling methodolo...
Birgit Hofreiter, Christian Huemer, Werner Winiwar...
JUCS
2008
115views more  JUCS 2008»
13 years 7 months ago
Capturing Interaction Requirements in a Model Transformation Technology Based on MDA
: Currently, many models are used to capture functional software requirements. However, the Software Engineering community has faded interaction requirements into the background, d...
José Ignacio Panach, Sergio España, ...