6274 search results - page 184 / 1255 » Proofs, Programs, Processes |
174
click to vote
WOLLIC
2010
Springer
15 years 11 months ago
2010
Springer
The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting were shown in [5] to be in NExpTime. This paper presents ...
160
click to vote
JAR
2008
15 years 6 months ago
2008
This article describes the formal verification of a compilation algorithm that transforms parallel moves (parallel assignments between variables) into a semanticallyequivalent sequ...
181
click to vote
AMAST
2010
Springer
15 years 1 months ago
2010
Springer
Fusion is an indispensable tool in the arsenal of techniques for program derivation. Less well-known, but equally valuable is type fusion, which states conditions for fusing an app...
195
click to vote
IEEEPACT
2006
IEEE
16 years 13 days ago
2006
IEEE
This paper describes a compiler for stream programs that efficiently schedules computational kernels and stream memory operations, and allocates on-chip storage. Our compiler uses...
175
click to vote
SP
2009
IEEE
16 years 1 months ago
2009
IEEE
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...