Sciweavers

504 search results - page 91 / 101
» Explaining Verification Conditions
Sort
View
DAC
2003
ACM
14 years 10 months ago
Behavioral consistency of C and verilog programs using bounded model checking
We present an algorithm that checks behavioral consistency between an ANSI-C program and a circuit given in Verilog using Bounded Model Checking. Both the circuit and the program ...
Edmund M. Clarke, Daniel Kroening, Karen Yorav
ICSE
2008
IEEE-ACM
14 years 9 months ago
DySy: dynamic symbolic execution for invariant inference
Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software engineering technique. Dynamic invariant inference has t...
Christoph Csallner, Nikolai Tillmann, Yannis Smara...
WWW
2006
ACM
14 years 9 months ago
Relaxed: on the way towards true validation of compound documents
To maintain interoperability in the Web environment it is necessary to comply with Web standards. Current specifications of HTML and XHTML languages define conformance conditions ...
Jirka Kosek, Petr Nálevka
HPCA
2005
IEEE
14 years 9 months ago
Improving Multiple-CMP Systems Using Token Coherence
Improvements in semiconductor technology now enable Chip Multiprocessors (CMPs). As many future computer systems will use one or more CMPs and support shared memory, such systems ...
Michael R. Marty, Jesse D. Bingham, Mark D. Hill, ...
POPL
2006
ACM
14 years 9 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan