Sciweavers

481 search results - page 44 / 97
» Executing Higher Order Logic
Sort
View
CADE
2008
Springer
14 years 10 months ago
Linear Quantifier Elimination
Abstract. This paper presents verified quantifier elimination procedures for dense linear orders (DLO), for real and for integer linear arithmetic. The DLO procedures are new. All ...
Tobias Nipkow
FCCM
1999
IEEE
134views VLSI» more  FCCM 1999»
14 years 2 months ago
Runlength Compression Techniques for FPGA Configurations
The time it takes to reconfigure FPGAs can be a significant overhead for reconfigurable computing. In this paper we develop new compression algorithms for FPGA configurations that...
Scott Hauck, William D. Wilson
OPODIS
2003
13 years 11 months ago
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Alper Sen, Vijay K. Garg
JFP
2006
113views more  JFP 2006»
13 years 10 months ago
Consistency of the theory of contexts
The Theory of Contexts is a type-theoretic axiomatization aiming to give a metalogical account of the fundamental notions of variable and context as they appear in Higher stract S...
Anna Bucalo, Furio Honsell, Marino Miculan, Ivan S...
TC
2010
13 years 8 months ago
Formal Reliability Analysis Using Theorem Proving
—Reliability analysis has become a tool of fundamental importance to virtually all electrical and computer engineers because of the extensive usage of hardware systems in safety ...
Osman Hasan, Sofiène Tahar, Naeem Abbasi