Sciweavers

656 search results - page 50 / 132
» A Formalization of Transition P Systems
Sort
View
SAC
2009
ACM
15 years 7 months ago
LTS semantics for use case models
Formalization is a necessary precondition for the specification of precise and unambiguous use case models, which serve as reference points for the design and implementation of so...
Daniel Sinnig, Patrice Chalin, Ferhat Khendek
84
Voted
FMCAD
2006
Springer
15 years 4 months ago
Post-reboot Equivalence and Compositional Verification of Hardware
We introduce a finer concept of a Hardware Machine, where the set of post-reboot operation states is explicitly a part of the FSM definition. We formalize an ad-hoc flow of combin...
Zurab Khasidashvili, Marcelo Skaba, Daher Kaiss, Z...
JLP
2006
108views more  JLP 2006»
15 years 16 days ago
On testing UML statecharts
We present a formal framework for notions related to testing and model based test generation for a behavioural subset of UML Statecharts (UMLSCs). This framework builds, on one ha...
Mieke Massink, Diego Latella, Stefania Gnesi
97
Voted
SEFM
2007
IEEE
15 years 6 months ago
Disciplining Orchestration and Conversation in Service-Oriented Computing
We give a formal account of a calculus for modeling service-based systems, suitable to describe both service composition (orchestration) and the protocol that services run when in...
Ivan Lanese, Francisco Martins, Vasco Thudichum Va...
MEMOCODE
2010
IEEE
14 years 10 months ago
LTSs for translation validation of (multi-clocked) SIGNAL specifications
Design of critical embedded systems demands for guarantees on the reliability of the implementation/compilation of a specification. In general, this guarantee takes either the form...
Julio C. Peralta, Thierry Gautier, Loïc Besna...