Sciweavers

1175 search results - page 34 / 235
» Abstract computability and algebraic specification
Sort
View
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 7 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
CMSB
2006
Springer
13 years 11 months ago
Stronger Computational Modelling of Signalling Pathways Using Both Continuous and Discrete-State Methods
Abstract. Starting from a biochemical signalling pathway model expressed in a process algebra enriched with quantitative information we automatically derive both continuous-space a...
Muffy Calder, Adam Duguid, Stephen Gilmore, Jane H...
PVM
1997
Springer
13 years 11 months ago
Performance of CAP-Specified Linear Algebra Algorithms
The traditional approach to the parallelization of linear algebra algorithms such as matrix multiplication and LU factorization calls for static allocation of matrix blocks to proc...
Marc Mazzariol, Benoit A. Gennart, Vincent Messerl...
GI
2009
Springer
13 years 5 months ago
Specification based testing of automotive human machine interfaces
Abstract: Model based testing promises systematic test coverage in a continuous testing process. However, in practice, model based testing struggles with informal specifications, d...
Holger Grandy, Sebastian Benz
CONCUR
2009
Springer
14 years 2 months ago
Weighted Bisimulation in Linear Algebraic Form
Abstract. We study bisimulation and minimization for weighted automata, relying on a geometrical representation of the model, linear weighted automata (lwa). In a lwa, the state-sp...
Michele Boreale