Sciweavers

1895 search results - page 326 / 379
» Using ATL for Checking Models
Sort
View
FC
2010
Springer
169views Cryptology» more  FC 2010»
15 years 3 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea
ICWS
2008
IEEE
15 years 2 months ago
A Framework for Verifying SLA Compliance in Composed Services
Service level agreements (SLAs) impose many nonfunctional requirements on services. Business analysts specify and check these requirements in business process models using tools s...
Hua Xiao, Brian Chan, Ying Zou, Jay W. Benayon, Bi...
DAC
2007
ACM
16 years 1 months ago
A System For Coarse Grained Memory Protection In Tiny Embedded Processors
Many embedded systems contain resource constrained microcontrollers where applications, operating system components and device drivers reside within a single address space with no...
Ram Kumar, Akhilesh Singhania, Andrew Castner, Edd...
87
Voted
SIGSOFT
2005
ACM
16 years 1 months ago
Permissive interfaces
A modular program analysis considers components independently and provides succinct summaries for each component, which can be used when checking the rest of the system. Consider ...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar
116
Voted
TCC
2009
Springer
255views Cryptology» more  TCC 2009»
16 years 1 months ago
LEGO for Two-Party Secure Computation
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
Jesper Buus Nielsen, Claudio Orlandi