Sciweavers

2661 search results - page 247 / 533
» Model Checking Performability Properties
Sort
View
DATE
2003
IEEE
85views Hardware» more  DATE 2003»
15 years 6 months ago
Set Manipulation with Boolean Functional Vectors for Symbolic Reachability Analysis
Symbolic techniques usually use characteristic functions for representing sets of states. Boolean functional vectors provide an alternate set representation which is suitable for ...
Amit Goel, Randal E. Bryant
JSA
2006
81views more  JSA 2006»
15 years 1 months ago
Deferred locking with shadow transaction for client-server DBMSs
Data-shipping systems that allow inter-transaction caching raise the need of a transactional cache consistency maintenance (CCM) protocol because each client is able to cache a po...
Hyeokmin Kwon, Songchun Moon
SIGSOFT
2005
ACM
16 years 1 months ago
Reasoning about confidentiality at requirements engineering time
Growing attention is being paid to application security at requirements engineering time. Confidentiality is a particular subclass of security concerns that requires sensitive inf...
Renaud De Landtsheer, Axel van Lamsweerde
PPOPP
2009
ACM
16 years 1 months ago
Formal verification of practical MPI programs
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
Anh Vo, Sarvani S. Vakkalanka, Michael Delisi, Gan...
131
Voted
JACM
2002
163views more  JACM 2002»
15 years 25 days ago
Formal verification of standards for distance vector routing protocols
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...