Sciweavers

34 search results - page 3 / 7
» Transactional Reduction of Component Compositions
Sort
View
ICCAD
2005
IEEE
90views Hardware» more  ICCAD 2005»
14 years 2 months ago
Scalable compositional minimization via static analysis
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
Fadi A. Zaraket, Jason Baumgartner, Adnan Aziz
HASKELL
2009
ACM
13 years 11 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
IRI
2003
IEEE
13 years 10 months ago
A Formal Framework for Design Component Contracts
– Building large software systems out of existing software components can save time and cost. These software components range from architectural and design components to binary c...
Jing Dong, Paulo S. C. Alencar, Donald D. Cowan
ENTCS
2010
127views more  ENTCS 2010»
13 years 5 months ago
Action Prefixes: Reified Synchronization Paths in Minimal Component Interaction Automata
Component Interaction Automata provide a fitting model to capture and analyze the temporal facets of hierarchical-structured component-oriented software systems. However, the rule...
Markus Lumpe
DEDS
2008
63views more  DEDS 2008»
13 years 5 months ago
Compositionally Progressive Solutions of Synchronous FSM Equations
The paper addresses the problem of designing a component that combined with a known part of a system, called the context FSM, is a reduction of a given specification FSM. We study...
Nina Yevtushenko, Tiziano Villa, Robert K. Brayton...