Sciweavers

4036 search results - page 515 / 808
» Formal Methods
Sort
View
ICFP
2005
ACM
16 years 6 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
CAV
2007
Springer
173views Hardware» more  CAV 2007»
16 years 25 days ago
Array Abstractions from Proofs
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
Ranjit Jhala, Kenneth L. McMillan
FMCAD
2007
Springer
16 years 25 days ago
Exploiting Resolution Proofs to Speed Up LTL Vacuity Detection for BMC
—When model-checking reports that a property holds on a model, vacuity detection increases user confidence in this result by checking that the property is satisfied in the inte...
Jocelyn Simmonds, Jessica Davies, Arie Gurfinkel, ...
IFM
2007
Springer
16 years 24 days ago
Qualitative Probabilistic Modelling in Event-B
Abstract. Event-B is a notation and method for discrete systems modelling by refinement. We introduce a small but very useful construction: qualitative probabilistic choice. It ex...
Stefan Hallerstede, Thai Son Hoang
CAV
2004
Springer
99views Hardware» more  CAV 2004»
16 years 1 days ago
Range Allocation for Separation Logic
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
Muralidhar Talupur, Nishant Sinha, Ofer Strichman,...