Sciweavers

949 search results - page 15 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
SIAMSC
2008
118views more  SIAMSC 2008»
13 years 7 months ago
Splitting Methods Based on Algebraic Factorization for Fluid-Structure Interaction
We discuss in this paper the numerical approximation of fluid-structure interaction (FSI) problems dealing with strong added-mass effect. We propose new semi-implicit algorithms ba...
Santiago Badia, Annalisa Quaini, Alfio Quarteroni
ZUM
2000
Springer
107views Formal Methods» more  ZUM 2000»
13 years 11 months ago
How to Drive a B Machine
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
Helen Treharne, Steve Schneider
SIP
2001
13 years 8 months ago
A contribution to advanced theory of discrete signals and systems
The paper presents basic concepts of the discrete system theory from the viewpoint of Banach algebras and shows that some Banach algebras of sequences are not only suitable mathem...
Eduard Krajnik
DLT
2008
13 years 9 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
FM
2009
Springer
123views Formal Methods» more  FM 2009»
14 years 2 months ago
"Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis
Abstract. Bounding resource usage is important for a number of areas, notably real-time embedded systems and safety-critical systems. In this paper, we present a fully automatic st...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...