Sciweavers

501 search results - page 47 / 101
» Using Abstraction to Verify Arbitrary Temporal Properties
Sort
View
ET
2010
98views more  ET 2010»
14 years 8 months ago
MONSOON: SAT-Based ATPG for Path Delay Faults Using Multiple-Valued Logics
Abstract As technology scales down into the nanometer era, delay testing of modern chips has become more and more important. Tests for the path delay fault model are widely used to...
Stephan Eggersglüß, Görschwin Fey,...
TWC
2008
109views more  TWC 2008»
14 years 9 months ago
Using the physical layer for wireless authentication in time-variant channels
Abstract--The wireless medium contains domain-specific information that can be used to complement and enhance traditional security mechanisms. In this paper we propose ways to expl...
Liang Xiao, Larry J. Greenstein, Narayan B. Manday...
PADL
2009
Springer
15 years 10 months ago
Declarative Network Verification
Abstract. In this paper, we present our initial design and implementation of a declarative network verifier (DNV). DNV utilizes theorem proving, a well established verification tec...
Anduo Wang, Prithwish Basu, Boon Thau Loo, Oleg So...
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 3 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
CI
2000
114views more  CI 2000»
14 years 9 months ago
A Guided Tour through Some Extensions of the Event Calculus
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...