Sciweavers

501 search results - page 32 / 101
» Using Abstraction to Verify Arbitrary Temporal Properties
Sort
View
CHARME
2005
Springer
176views Hardware» more  CHARME 2005»
15 years 3 months ago
An Analysis of SAT-Based Model Checking Techniques in an Industrial Environment
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
Nina Amla, Xiaoqun Du, Andreas Kuehlmann, Robert P...
88
Voted
SIGSOFT
2006
ACM
15 years 10 months ago
SYNERGY: a new algorithm for property checking
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
Bhargav S. Gulavani, Thomas A. Henzinger, Yamini K...
COMPSEC
2010
124views more  COMPSEC 2010»
14 years 8 months ago
A provably secure secret handshake with dynamic controlled matching
Abstract A Secret Handshake is a protocol that allows two users to mutually verify one another’s properties, and in case of simultaneous matching, to share a key used to secure s...
Alessandro Sorniotti, Refik Molva
JAVACARD
2000
15 years 1 months ago
Formal Specification and Verification of JavaCard's Application Identifier Class
Abstract This note discusses a verification in PVS of the AID (Application Identifier) class from JavaCard's API. The properties that are verified are formulated in the interf...
Joachim van den Berg, Bart Jacobs, Erik Poll
MEMOCODE
2010
IEEE
14 years 7 months ago
Proving transaction and system-level properties of untimed SystemC TLM designs
Electronic System Level (ESL) design manages the complexity of todays systems by using abstract models. In this context Transaction Level Modeling (TLM) is state-of-theart for desc...
Daniel Große, Hoang M. Le, Rolf Drechsler