Sciweavers

3128 search results - page 291 / 626
» Finite element method
Sort
View
ITCC
2002
IEEE
15 years 9 months ago
FSM Implementation in Embedded Memory Blocks of Programmable Logic Devices Using Functional Decomposition
: Since modern programmable devices contain embedded memory blocks, there exists a possibility to implement Finite State Machines (FSM) using such blocks. The size of the memory av...
Henry Selvaraj, Mariusz Rawski, Tadeusz Luba
ADAEUROPE
2001
Springer
15 years 9 months ago
Testing from Formal Specifications, a Generic Approach
Deriving test cases from specifications is now recognised as a major application of formal methods to software development. Several methods have been proposed for various formalism...
Marie-Claude Gaudel
LOPSTR
1994
Springer
15 years 8 months ago
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
Annalisa Bossi, Sandro Etalle
SAS
1993
Springer
104views Formal Methods» more  SAS 1993»
15 years 8 months ago
Strictness Properties of Lazy Algebraic Datatypes
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
P. N. Benton
207
Voted
AGTIVE
2007
Springer
15 years 8 months ago
Verification and Synthesis of OCL Constraints Via Topology Analysis
On the basis of a case-study, we demonstrate the usefulness of topology invariants for model-driven systems development. Considering a graph grammar semantics for a relevant fragme...
Jörg Bauer, Werner Damm, Tobe Toben, Bernd We...