Sciweavers

383 search results - page 72 / 77
» Formal Syntax and Semantics of Case Stacking Languages
Sort
View
SCESM
2006
ACM
262views Algorithms» more  SCESM 2006»
14 years 1 months ago
Scenario-driven modeling and validation of requirements models
Requirements models for large systems typically cannot be developed in a single step, but evolve in a sequence of iterations. We have developed such an iterative modeling process ...
Christian Seybold, Silvio Meier, Martin Glinz
ICFP
2005
ACM
14 years 7 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power
AOSD
2010
ACM
14 years 2 months ago
Execution levels for aspect-oriented programming
In aspect-oriented programming languages, advice evaluation is usually considered as part of the base program evaluation. This is also the case for certain pointcuts, such as if p...
Éric Tanter
SIGSOFT
2007
ACM
14 years 8 months ago
On marrying ontological and metamodeling technical spaces
In software engineering, the use of models and metamodeling approaches (e.g., MDA with MOF/UML) for purposes such as software design or software validation is an established pract...
Fernando Silva Parreiras, Steffen Staab, Andreas W...
APN
2001
Springer
13 years 12 months ago
Rewriting Logic as a Unifying Framework for Petri Nets
We propose rewriting logic as a unifying framework for a wide range of Petri nets models. We treat in detail place/transition nets and important extensions of the basic model by in...
Mark-Oliver Stehr, José Meseguer, Peter Csa...