Sciweavers

218 search results - page 38 / 44
» Verifying Safety Properties with the TLA Proof System
Sort
View
CHARME
2003
Springer
110views Hardware» more  CHARME 2003»
13 years 11 months ago
Exact and Efficient Verification of Parameterized Cache Coherence Protocols
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
E. Allen Emerson, Vineet Kahlon
ISTA
2004
13 years 8 months ago
Evidential Paradigm and Intelligent Mathematical Text Processing
Abstract: This paper presents the evidential paradigm of computer-supported mathematical assistance in "doing" mathematics and in reasoning activity. At present, the evid...
Alexander V. Lyaletski, Anatoly E. Doroshenko, And...
APSEC
2008
IEEE
14 years 1 months ago
A Heap Model for Java Bytecode to Support Separation Logic
Memory usage analysis is an important problem for resource-constrained mobile devices, especially under mission- or safety-critical circumstances. Program codes running on or bein...
Chenguang Luo, Guanhua He, Shengchao Qin
ENTCS
2006
112views more  ENTCS 2006»
13 years 7 months ago
Modeling Web Applications by the Multiple Levels of Integrity Policy
We propose a formal method to validate the reliability of a web application, by modeling interactions among its constituent objects. Modeling exploits the recent "Multiple Le...
Gianluca Amato, Massimo Coppola, Stefania Gnesi, F...
SIAMCOMP
2002
90views more  SIAMCOMP 2002»
13 years 7 months ago
A Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach
This paper presents a formal design for a novel group communication service targeted for WANs. The service provides Virtual Synchrony semantics. Such semantics facilitate the desi...
Idit Keidar, Roger Khazan