Sciweavers

163 search results - page 18 / 33
» Composition Theorems in Communication Complexity
Sort
View
FMSD
2002
107views more  FMSD 2002»
14 years 9 months ago
Verification of Out-Of-Order Processor Designs Using Model Checking and a Light-Weight Completion Function
We present a new technique for verification of complex hardware devices that allows both generality andahighdegreeofautomation.Thetechniqueisbasedonournewwayofconstructinga"li...
Sergey Berezin, Edmund M. Clarke, Armin Biere, Yun...
FAC
2007
128views more  FAC 2007»
14 years 9 months ago
Verifying a signature architecture: a comparative case study
Abstract. We report on a case study in applying different formal methods to model and verify an architecture for administrating digital signatures. The architecture comprises seve...
David A. Basin, Hironobu Kuruma, Kunihiko Miyazaki...
SIGSOFT
2002
ACM
15 years 10 months ago
Composable semantics for model-based notations
We propose a unifying framework for model-based specification notations. Our framework captures the execution semantics that are common among model-based notations, and leaves the...
Jianwei Niu, Joanne M. Atlee, Nancy A. Day
ICECCS
2005
IEEE
73views Hardware» more  ICECCS 2005»
15 years 3 months ago
Integrating Object-Z with Timed Automata
When designing a complex system, Object-Z is a powerful logic-based language for modeling the system state aspects, and Timed Automata is an excellent graph-based notation for cap...
Jin Song Dong, Roger Duke, Ping Hao
CMMR
2007
Springer
140views Music» more  CMMR 2007»
15 years 3 months ago
Emergent Rhythms through Multi-agency in Max/MSP
This paper presents a multiple-agent architecture created in Max/ MSP that generates polyphonic rhythmic patterns which continuously evolve and develop in a musically intelligent m...
Arne Eigenfeldt