Sciweavers

72 search results - page 14 / 15
» Secure function evaluation with ordered binary decision diag...
Sort
View
CAV
2010
Springer
172views Hardware» more  CAV 2010»
13 years 9 months ago
Symbolic Bounded Synthesis
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
Rüdiger Ehlers
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
13 years 3 months ago
Boxes: A Symbolic Abstract Domain of Boxes
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
Arie Gurfinkel, Sagar Chaki
SOSP
2003
ACM
14 years 2 months ago
Model-carrying code: a practical approach for safe execution of untrusted applications
This paper presents a new approach called model-carrying code (MCC) for safe execution of untrusted code. At the heart of MCC is the idea that untrusted code comes equipped with a...
R. Sekar, V. N. Venkatakrishnan, Samik Basu, Sande...
CP
2001
Springer
13 years 9 months ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi
ICCAD
2002
IEEE
124views Hardware» more  ICCAD 2002»
14 years 2 months ago
Symbolic pointer analysis
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
Jianwen Zhu