Sciweavers

566 search results - page 3 / 114
» Array Abstractions from Proofs
Sort
View
TPHOL
2005
IEEE
14 years 1 months ago
Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof
We discuss methods for dealing effectively with let-bindings in proofs. Our contribution is a small set of unconditional rewrite rules, found by the bracket abstraction translatio...
Michael Norrish, Konrad Slind
CADE
2008
Springer
14 years 7 months ago
Presenting TSTP Proofs with Inference Web Tools
Abstract. This paper describes the translation of proofs in the Thousands of Solutions from Theorem Provers (TSTP) solution library to the Proof Markup Language (PML), and the subs...
Paulo Pinheiro da Silva, Geoff Sutcliffe, Cynthia ...
FMCAD
2009
Springer
13 years 11 months ago
Generalized, efficient array decision procedures
Abstract--The theory of arrays is ubiquitous in the context of software and hardware verification and symbolic analysis. The basic array theory was introduced by McCarthy and allow...
Leonardo Mendonça de Moura, Nikolaj Bj&osla...
FM
2009
Springer
98views Formal Methods» more  FM 2009»
14 years 2 months ago
Recursive Abstractions for Parameterized Systems
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...
Joxan Jaffar, Andrew E. Santosa
AHS
2007
IEEE
222views Hardware» more  AHS 2007»
13 years 7 months ago
Programmable Analog VLSI Architecture Based upon Event Coding
Abstract— A programmable analog array inspired from neuronal spike event coding is presented. A configurable event block forms the basic building block of the programmable array...
Thomas Jacob Koickal, Alister Hamilton, Luiz C. P....