Sciweavers

963 search results - page 42 / 193
» Formal Analysis of BPMN Models Using Event-B
Sort
View
FSTTCS
2007
Springer
15 years 7 months ago
Program Analysis Using Weighted Pushdown Systems
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
Thomas W. Reps, Akash Lal, Nicholas Kidd
DAC
2006
ACM
16 years 2 months ago
Early cutpoint insertion for high-level software vs. RTL formal combinational equivalence verification
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
Xiushan Feng, Alan J. Hu
MM
2009
ACM
178views Multimedia» more  MM 2009»
15 years 6 months ago
Automatic role recognition in multiparty recordings using social networks and probabilistic sequential models
The automatic analysis of social interactions is attracting significant interest in the multimedia community. This work addresses one of the most important aspects of the problem...
Sarah Favre, Alfred Dielmann, Alessandro Vinciarel...
DATE
2009
IEEE
249views Hardware» more  DATE 2009»
15 years 8 months ago
White box performance analysis considering static non-preemptive software scheduling
—In this paper, a novel approach for integrating static non-preemptive software scheduling in formal bottom-up performance evaluation of embedded system models is described. The ...
Alexander Viehl, Michael Pressler, Oliver Bringman...
IEE
2008
116views more  IEE 2008»
15 years 1 months ago
Evaluating formal properties of feature diagram languages
: Feature diagrams (FDs) are a family of popular modelling languages, mainly used for managing variability in software product lines. FDs were first introduced by Kang et al. as pa...
Patrick Heymans, Pierre-Yves Schobbens, Jean-Chris...