Sciweavers

378 search results - page 59 / 76
» Automating Mathematical Program Transformations
Sort
View
DAC
1998
ACM
14 years 8 months ago
Design and Specification of Embedded Systems in Java Using Successive, Formal Refinement
Successive, formal refinement is a new approach for specification of embedded systems using a general-purpose programming language. Systems are formally modeled as Abstractable Sy...
James Shin Young, Josh MacDonald, Michael Shilman,...
DISCO
1993
156views Hardware» more  DISCO 1993»
13 years 11 months ago
Variant Handling, Inheritance and Composition in the ObjectMath Computer Algebra Environment
ObjectMath is a high-level programming environment and modeling language for scientific computing which supports variants and graphical browsing in the environment and integrates o...
Peter Fritzson, Vadim Engelson, Lars Viklund
CADE
2009
Springer
14 years 8 months ago
Real World Verification
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
André Platzer, Jan-David Quesel, Philipp R&...
SCFBM
2008
151views more  SCFBM 2008»
13 years 6 months ago
Wndchrm - an open source utility for biological image analysis
Background: Biological imaging is an emerging field, covering a wide range of applications in biological and clinical research. However, while machinery for automated experimentin...
Lior Shamir, Nikita Orlov, D. Mark Eckley, Tomasz ...
POPL
2005
ACM
14 years 7 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko