Sciweavers

13383 search results - page 143 / 2677
» Abstractions from proofs
Sort
View
SOFSEM
2010
Springer
16 years 3 months ago
Finding and Certifying Loops
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
Harald Zankl, Christian Sternagel, Dieter Hofbauer...
TACAS
2009
Springer
99views Algorithms» more  TACAS 2009»
16 years 28 days ago
Ground Interpolation for the Theory of Equality
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
Alexander Fuchs, Amit Goel, Jim Grundy, Sava Krsti...
174
Voted
TPHOL
2008
IEEE
16 years 16 days ago
Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
Daniel Wasserrab, Andreas Lochbihler
177
Voted
SAMOS
2007
Springer
16 years 8 days ago
Evaluating Large System-on-Chip on Multi-FPGA Platform
This paper presents a configurable base architecture tailorable for different applications. It allows simple and rapid way to evaluate and prototype large Multi-Processor System-on...
Ari Kulmala, Erno Salminen, Timo D. Hämä...
LICS
2006
IEEE
16 years 5 days ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson