Sciweavers

51 search results - page 9 / 11
» Verifying Statecharts with State Invariants
Sort
View
DATE
2003
IEEE
98views Hardware» more  DATE 2003»
14 years 22 days ago
Using Formal Techniques to Debug the AMBA System-on-Chip Bus Protocol
System-on-chip (SoC) designs use bus protocols for high performance data transfer among the Intellectual Property (IP) cores. These protocols incorporate advanced features such as...
Abhik Roychoudhury, Tulika Mitra, S. R. Karri
ASM
2004
ASM
14 years 26 days ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
14 years 28 days ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...
FMCAD
2004
Springer
14 years 25 days ago
Proof Styles in Operational Semantics
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
Sandip Ray, J. Strother Moore
PPOPP
2012
ACM
12 years 3 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...