Sciweavers

558 search results - page 58 / 112
» Optimizing Symbolic Model Checking for Constraint-Rich Model...
Sort
View
TSE
2010
110views more  TSE 2010»
13 years 7 months ago
Proofs from Tests
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
Nels E. Beckman, Aditya V. Nori, Sriram K. Rajaman...
TSMC
2010
13 years 3 months ago
Active Learning of Plans for Safety and Reachability Goals With Partial Observability
Traditional planning assumes reachability goals and/or full observability. In this paper, we propose a novel solution for safety and reachability planning with partial observabilit...
Wonhong Nam, Rajeev Alur
CHARME
2005
Springer
136views Hardware» more  CHARME 2005»
14 years 2 months 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,...
FMICS
2007
Springer
14 years 3 months ago
Machine Checked Formal Proof of a Scheduling Protocol for Smartcard Personalization
Using PVS (Prototype Verification System), we prove that an industry designed scheduler for a smartcard personalization machine is safe and optimal. This scheduler has previously ...
Leonard Lensink, Sjaak Smetsers, Marko C. J. D. va...
DAC
2006
ACM
14 years 10 months ago
Early cutpoint insertion for high-level software vs. RTL formal combinational equivalence verification
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
Xiushan Feng, Alan J. Hu