Sciweavers

1914 search results - page 134 / 383
» Verification by Abstract Interpretation
Sort
View
AMCS
2011
341views Mathematics» more  AMCS 2011»
14 years 11 months ago
FSP and FLTL framework for specification and verification of middle-agents
Agents are a useful abstraction frequently employed as a basic building block in modeling service, information and resource sharing in global environments. The connecting of reques...
Amelia Badica, Costin Badica
CORR
2010
Springer
208views Education» more  CORR 2010»
15 years 4 months ago
Bounded Model Checking of Multi-threaded Software using SMT solvers
The transition from single-core to multi-core processors has made multi-threaded software an important subject in computer aided verification. Here, we describe and evaluate an ex...
Lucas Cordeiro, Bernd Fischer 0002
CAV
2009
Springer
209views Hardware» more  CAV 2009»
16 years 5 months ago
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamari...
CADE
2006
Springer
16 years 4 months ago
Towards Self-verification of HOL Light
The HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly functional OCaml, whose complete formal verification seems to be quite feasible. We would ...
John Harrison
144
Voted
ICCAD
1996
IEEE
141views Hardware» more  ICCAD 1996»
15 years 8 months ago
An observability-based code coverage metric for functional simulation
Functional simulation is the most widely used method for design verification. At various levels of abstraction, e.g., behavioral, register-transfer level and gate level, the design...
Srinivas Devadas, Abhijit Ghosh, Kurt Keutzer