Sciweavers

229 search results - page 8 / 46
» How Efficient Can Memory Checking Be
Sort
View
IOLTS
2008
IEEE
117views Hardware» more  IOLTS 2008»
14 years 2 months ago
Verification and Analysis of Self-Checking Properties through ATPG
Present and future semiconductor technologies are characterized by increasing parameters variations as well as an increasing susceptibility to external disturbances. Transient err...
Marc Hunger, Sybille Hellebrand
AMAST
2004
Springer
14 years 1 months 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
CORR
2006
Springer
124views Education» more  CORR 2006»
13 years 7 months ago
Linear Encodings of Bounded LTL Model Checking
Abstract. We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthe...
Armin Biere, Keijo Heljanko, Tommi A. Junttila, Ti...
ENTCS
2007
156views more  ENTCS 2007»
13 years 7 months ago
Bounded Model Checking with Parametric Data Structures
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
Erika Ábrahám, Marc Herbstritt, Bern...
HOTOS
2007
IEEE
13 years 11 months ago
HotComments: How to Make Program Comments More Useful?
Program comments have long been used as a common practice for improving inter-programmer communication and code readability, by explicitly specifying programmers' intentions ...
Lin Tan, Ding Yuan, Yuanyuan Zhou