Sciweavers

15 search results - page 1 / 3
» On Complexity of Internal and External Equivalence Checking
Sort
View
DSD
2007
IEEE
117views Hardware» more  DSD 2007»
13 years 8 months ago
On Complexity of Internal and External Equivalence Checking
We compare the complexity of "internal" and "external" equivalence checking. The former is meant for proving the correctness of a synthesis transformation by w...
Eugene Goldberg, Kanupriya Gulati
SIAMCO
2000
89views more  SIAMCO 2000»
13 years 4 months ago
Stability Radius and Internal Versus External Stability in Banach Spaces: An Evolution Semigroup Approach
In this paper the theory of evolution semigroups is developed and used to provide a framework to study the stability of general linear control systems. These include autonomous and...
Stephen Clark, Yuri Latushkin, Stephen Montgomery-...
IANDC
2010
68views more  IANDC 2010»
13 years 3 months ago
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
Antonín Kucera, Richard Mayr
FM
2006
Springer
161views Formal Methods» more  FM 2006»
13 years 8 months ago
Changing Programs Correctly: Refactoring with Specifications
Refactorings change the internal structure of code without changing its external behavior. For non-trivial refactorings, the preservation of external behavior depends on semantic p...
Fabian Bannwart, Peter Müller
MEMOCODE
2007
IEEE
13 years 11 months ago
Towards Equivalence Checking Between TLM and RTL Models
The always increasing complexity of digital system is overcome in design flows based on Transaction Level Modeling (TLM) by designing and verifying the system at difbstraction le...
Nicola Bombieri, Franco Fummi, Graziano Pravadelli...