Model checking tracebased information flow properties: For finite state systems and pushdown systems,Used

Model checking tracebased information flow properties: For finite state systems and pushdown systems,Used

In Stock
SKU: DADAX383837780X
Brand: LAP Lambert Academic Publishing
$82.28 $117.54
Save $35.26
Quantity
Add to wishlist
Add to compare

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Information flow properties are a way of specifying security properties of systems. A system is viewed as generating traces containing confidential and visible events (only the latter being observable by a lowlevel user) and the information flow properties specify restrictions on the kind of traces the system may generate, so as to restrict the amount of information a lowlevel user can infer about confidential events having taken place (or not) in an execution. Mantel identifies "basic security predicates or BSPs and shows them to be the building blocks of most of the known tracebased properties in the literature. Traditionally BSPs have been reasoned about via unwinding conditions that capture whether a system satisfies a particular BSP. First, we show that the checking of unwinding conditions can be simplified to checking conditions on a maximal simulation relation. Second, we show that the BSPs can be characterized in terms of regularity preserving languagetheoretic operations. This leads to a decision procedure for checking whether a finite state system satisfies a given BSP. Finally, we prove that the problem of verifying BSPs for pushdown systems is undecidable.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed