566 search results - page 45 / 114 » Array Abstractions from Proofs |
ENTCS
2008
13 years 7 months ago
2008
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...
TAP
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
Two important signal processing problems in the display side of a holographic 3DTV are the computation of the diffraction field of a 3D object from its abstract representation, an...
ICVS
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. At the first ICVS, we presented SA-C (“sassy”), a singleassignment variant of the C programming language designed to exploit both coarse-grain and fine-grain parallel...
APL
1993
ACM
13 years 11 months ago
1993
ACM
Although multicomputers are becoming feasible for solving large problems, they are difficult to program: Extraction of parallelism from scalar languages is possible, but limited....