Sciweavers

974 search results - page 89 / 195
» Formal Modeling of Communication Traces
Sort
View
IFM
2009
Springer
155views Formal Methods» more  IFM 2009»
14 years 9 months ago
Application of Graph Transformation in Verification of Dynamic Systems
Abstract. A communication system evolves dynamically with the addition and deletion of services. In our previous work [12], a graph transformation system (GTS) was used to model th...
Zarrin Langari, Richard J. Trefler
IPPS
1998
IEEE
15 years 4 months ago
Configuration Independent Analysis for Characterizing Shared-Memory Applications
Characterizing shared-memory applications provides insight to design efficient systems, and provides awareness to identify and correct application performance bottlenecks. Configu...
Gheith A. Abandah, Edward S. Davidson
STOC
1998
ACM
112views Algorithms» more  STOC 1998»
15 years 4 months ago
Quantum Circuits with Mixed States
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
Dorit Aharonov, Alexei Kitaev, Noam Nisan
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
15 years 5 months ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
JLP
2010
85views more  JLP 2010»
14 years 6 months ago
Synchronous Kleene algebra
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
Cristian Prisacariu