Sciweavers

80 search results - page 9 / 16
» Tearing based automatic abstraction for CTL model checking
Sort
View
ICSE
2010
IEEE-ACM
13 years 9 months ago
SMT-based bounded model checking for multi-threaded software in embedded systems
The transition from single-core to multi-core processors has made multi-threaded software an important subject over the last years in computer-aided verification. Model checkers ...
Lucas Cordeiro
AMAST
2004
Springer
14 years 23 days ago
On Guard: Producing Run-Time Checks from Integrity Constraints
Abstract. Software applications are inevitably concerned with data integrity, whether the data is stored in a database, files, or program memory. An integrity guard is code execut...
Michael Benedikt, Glenn Bruns
CAV
2003
Springer
188views Hardware» more  CAV 2003»
13 years 11 months ago
Thread-Modular Abstraction Refinement
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
DDECS
2006
IEEE
146views Hardware» more  DDECS 2006»
13 years 11 months ago
Automatic Identification of Timing Anomalies for Cycle-Accurate Worst-Case Execution Time Analysis
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...
Jochen Eisinger, Ilia Polian, Bernd Becker, Alexan...
CHARME
2005
Springer
136views Hardware» more  CHARME 2005»
14 years 27 days ago
Predictive Reachability Using a Sample-Based Approach
Abstract. Unbounded model checking of invariant properties is typically solved using symbolic reachability. However, BDD based reachability methods suffer from lack of robustness ...
Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer,...