Sciweavers

3333 search results - page 256 / 667
» Abstract Proof Search
Sort
View
ISCAS
2003
IEEE
135views Hardware» more  ISCAS 2003»
15 years 12 months ago
Formal verification of LTL formulas for SystemC designs
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
Daniel Große, Rolf Drechsler
APLAS
2007
ACM
15 years 10 months ago
Complete Lattices and Up-To Techniques
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
Damien Pous
CAV
2009
Springer
165views Hardware» more  CAV 2009»
15 years 10 months ago
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. The transformations should preserve the fu...
Sven Verdoolaege, Gerda Janssens, Maurice Bruynoog...
PET
2010
Springer
15 years 10 months ago
Anonymous Webs of Trust
Abstract. Webs of trust constitute a decentralized infrastructure for establishing the authenticity of the binding between public keys and users and, more generally, trust relation...
Michael Backes, Stefan Lorenz, Matteo Maffei, Kim ...
ESOP
2006
Springer
15 years 10 months ago
Type-Based Amortised Heap-Space Analysis
Abstract. We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on a...
Martin Hofmann, Steffen Jost