6167 search results - page 77 / 1234 » Can Refinement be Automated |
DAC
2004
ACM
15 years 3 days ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
SIGMOD
2008
ACM
13 years 11 months ago
2008
ACM
The UQBE is a mashup tool for non-programmers that supports query-by-example (QBE) over a schema made up by the user without knowing the schema of the original sources. Based on a...
DSVIS
2000
Springer
14 years 3 months ago
2000
Springer
This paper presents an example of how software architectures can encode temporal properties as well as the traditional structural ones. In the context of expressing concurrency con...
DATE
2006
IEEE
14 years 2 months ago
2006
IEEE
We introduce collapsed flushing, a new flushing-based refinement map for automatically verifying safety and liveness properties of term-level pipelined machine models. We also pre...
DAGSTUHL
2007
14 years 18 days ago
2007
Major hardware and software vendors are curious about transactional memory (TM), but are understandably cautious about committing to hardware changes. Our thesis is that deconstru...