Sciweavers

116 search results - page 19 / 24
» Sequential Verification of Serializability
Sort
View
SIMPRA
2008
137views more  SIMPRA 2008»
13 years 6 months ago
An admissible-behaviour-based analysis of the deadlock in Petri-net controllers
This paper addresses the problem of verifying the discrete control logic that is typically implemented by programmable controllers. Not only are the logical properties of the cont...
G. Music, Drago Matko
SIGSOFT
2007
ACM
14 years 8 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
MEMOCODE
2003
IEEE
14 years 20 days ago
Bridging CSP and C++ with Selective Formalism and Executable Specifications
CSP (Communicating Sequential Processes) is a useful algebraic notation for creating a hierarchical behavioural specification for concurrent systems, due to its formal interproces...
William B. Gardner
TABLEAUX
1998
Springer
13 years 11 months ago
Model Checking: Historical Perspective and Example (Extended Abstract)
ple (Extended Abstract) Edmund M. Clarke and Sergey Berezin Carnegie Mellon University -- USA Model checking is an automatic verification technique for finite state concurrent syst...
Edmund M. Clarke, Sergey Berezin
DASFAA
2008
IEEE
137views Database» more  DASFAA 2008»
13 years 9 months ago
Efficient Mining of Recurrent Rules from a Sequence Database
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
David Lo, Siau-Cheng Khoo, Chao Liu 0001