Sciweavers

2137 search results - page 3 / 428
» Proving Abstract Non-interference
Sort
View
MEMOCODE
2010
IEEE
14 years 7 months ago
Proving transaction and system-level properties of untimed SystemC TLM designs
Electronic System Level (ESL) design manages the complexity of todays systems by using abstract models. In this context Transaction Level Modeling (TLM) is state-of-theart for desc...
Daniel Große, Hoang M. Le, Rolf Drechsler
IFIP
2009
Springer
15 years 4 months ago
A Calculus of Trustworthy Ad Hoc Networks
We propose a process calculus for mobile ad hoc networks which embodies a behaviour-based multilevel decentralised trust model. Our trust model supports both direct trust, by monit...
Massimo Merro, Eleonora Sibilio
ISSTA
2006
ACM
15 years 3 months ago
Testing, abstraction, theorem proving: better together!
Greta Yorsh, Thomas Ball, Mooly Sagiv
CAV
2004
Springer
89views Hardware» more  CAV 2004»
15 years 3 months ago
Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement
Thomas Ball, Byron Cook, Shuvendu K. Lahiri, Linta...