Sciweavers

696 search results - page 11 / 140
» Explaining abstract counterexamples
Sort
View
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...
DATE
2009
IEEE
100views Hardware» more  DATE 2009»
14 years 2 months ago
Increasing the accuracy of SAT-based debugging
Equivalence checking and property checking are powerful techniques to detect error traces. Debugging these traces is a time consuming design task where automation provides help. I...
André Sülflow, Görschwin Fey, C&e...
CAL
2007
13 years 7 months ago
Explaining Dynamic Cache Partitioning Speed Ups
Abstract— Cache Partitioning has been proposed as an interesting alternative to traditional eviction policies of shared cache levels in modern CMP architectures: throughput is im...
Miquel Moretó, Francisco J. Cazorla, Alex R...
CORR
2010
Springer
74views Education» more  CORR 2010»
13 years 7 months ago
Formats of Winning Strategies for Six Types of Pushdown Games
ndence fails. In the conclusion we address the question of an abstract criterion that explains the results.
Wladimir Fridman
CAI
2006
Springer
13 years 7 months ago
A Logical Framework for Identifying and Explaining Unexpected News
The number of news reports published online is now so great that it is impossible for any person to read all of them. Not all of these reports are equally interesting. Automating ...
Emma Byrne