Sciweavers

2896 search results - page 368 / 580
» Curricula Modeling and Checking
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
15 years 3 months ago
Precedence Automata and Languages
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
Violetta Lonati, Dino Mandrioli, Matteo Pradella
FMICS
2007
Springer
16 years 22 days ago
An Approach to Formalization and Analysis of Message Passing Libraries
Message passing using libraries implementing the Message Passing Interface (MPI) standard is the dominant communication mechanism in high performance computing (HPC) applications. ...
Robert Palmer, Michael Delisi, Ganesh Gopalakrishn...
DAC
2004
ACM
16 years 7 months ago
A SAT-based algorithm for reparameterization in symbolic simulation
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
Pankaj Chauhan, Edmund M. Clarke, Daniel Kroening
EDBT
2010
ACM
208views Database» more  EDBT 2010»
16 years 1 months ago
Stream schema: providing and exploiting static metadata for data stream processing
Schemas, and more generally metadata specifying structural and semantic constraints, are invaluable in data management. They facilitate conceptual design and enable checking of da...
Peter M. Fischer, Kyumars Sheykh Esmaili, Ren&eacu...
BPM
2010
Springer
191views Business» more  BPM 2010»
15 years 7 months ago
Correctness Ensuring Process Configuration: An Approach Based on Partner Synthesis
Abstract. A configurable process model describes a family of similar process models in a given domain. Such a model can be configured to obtain a specific process model that is sub...
Wil M. P. van der Aalst, Niels Lohmann, Marcello L...