6274 search results - page 136 / 1255 » Proofs, Programs, Processes |
137
click to vote
ACTA
2010
15 years 6 months ago
2010
Abstract This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones...
179
click to vote
IPPS
2007
IEEE
16 years 19 days ago
2007
IEEE
This paper presents a new and retargetable method to identify patterns of instructions with direct support in coarsegrained processing elements (PEs). The method uses a three-addr...
137
click to vote
SIBGRAPI
1999
IEEE
15 years 10 months ago
1999
IEEE
Abstract. In this work we study the problem of reconstructing an image from a perceptual segmentation based on a geometric classification of its points using non-linear curvature f...
190
click to vote
LICS
1991
IEEE
15 years 9 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
185
click to vote
CL
2000
Springer
15 years 10 months ago
2000
Springer
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...