Sciweavers

219 search results - page 27 / 44
» Context-aware counter abstraction
Sort
View
FMICS
2006
Springer
15 years 3 months ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang
ATVA
2006
Springer
109views Hardware» more  ATVA 2006»
15 years 1 months ago
Proactive Leader Election in Asynchronous Shared Memory Systems
Abstract. In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speakin...
M. C. Dharmadeep, K. Gopinath
ICALP
2009
Springer
16 years 2 days ago
Forward Analysis for WSTS, Part II: Complete WSTS
Abstract. We describe a simple, conceptual forward analysis procedure for complete WSTS S. This computes the clover of a state s0, i.e., a finite description of the closure of the ...
Alain Finkel, Jean Goubault-Larrecq
FASE
2009
Springer
15 years 6 months ago
Finding Loop Invariants for Programs over Arrays Using a Theorem Prover
Abstract. We present a new method for automatic generation of loop invariants for programs containing arrays. Unlike all previously known methods, our method allows one to generate...
Laura Kovács, Andrei Voronkov
ICC
2008
IEEE
106views Communications» more  ICC 2008»
15 years 6 months ago
Lightweight Security for Network Coding
Abstract—Under the emerging network coding paradigm, intermediate nodes in the network are allowed not only to store and forward packets but also to process and mix different dat...
João P. Vilela, Luísa Lima, Jo&atild...