Sciweavers

107 search results - page 8 / 22
» Specifying the Correctness of Binding-Time Analysis
Sort
View
KBSE
2007
IEEE
14 years 1 months ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
DAC
2008
ACM
14 years 8 months ago
Model checking based analysis of end-to-end latency in embedded, real-time systems with clock drifts
End-to-end latency of messages is an important design parameter that needs to be within specified bounds for the correct functioning of distributed real-time control systems. In t...
Swarup Mohalik, A. C. Rajeev, Manoj G. Dixit, S. R...
ICFEM
2004
Springer
14 years 22 days ago
Memory-Model-Sensitive Data Race Analysis
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom
CSFW
2005
IEEE
14 years 29 days ago
Game-Based Analysis of Denial-of-Service Prevention Protocols
Availability is a critical issue in modern distributed systems. While many techniques and protocols for preventing denial of service (DoS) attacks have been proposed and deployed ...
Ajay Mahimkar, Vitaly Shmatikov
RTSS
2008
IEEE
14 years 1 months ago
Schedulability and Compatibility of Real Time Asynchronous Objects
Abstract—We apply automata theory to specifying behavioral interfaces of objects and show how to check schedulability and compatibility of real time asynchronous objects. The beh...
Mohammad Mahdi Jaghoori, Delphine Longuet, Frank S...