Entry Amagbegnon:1995:IDS from sigplan1990.bib
Last update: Thu Apr 12 03:37:15 MDT 2012
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Amagbegnon:1995:IDS,
author = "Pascalin Amagb{\'e}gnon and Lo{\"\i}c Besnard and Paul
Le Guernic",
title = "Implementation of the data-flow synchronous language
{SIGNAL}",
journal = j-SIGPLAN,
volume = "30",
number = "6",
pages = "163--173",
month = jun,
year = "1995",
CODEN = "SINODQ",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
ISSN-L = "0362-1340",
bibdate = "Thu May 13 12:37:27 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p163-amagbegnon/",
abstract = "This paper presents the techniques used for the
compilation of the data-flow, synchronous language
SIGNAL. The key feature of the compiler is that it
performs formal calculus on systems of boolean
equations. The originality of the implementation of the
compiler lies in the use of a tree structure to solve
the equations.",
acknowledgement = ack-nhfb,
affiliation = "IRISA, Rennes, France",
annote = "Published as part of the Proceedings of PLDI'95.",
classification = "C4210 (Formal logic); C6110P (Parallel programming);
C6120 (File organisation); C6140D (High level
languages); C6150C (Compilers, interpreters and other
processors); C6150N (Distributed systems software)",
keywords = "algorithms; Boolean equations; Compilation; Equation
solving; Formal calculus; languages; SIGNAL data-flow
synchronous language; Tree structure",
subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language
Classifications, Data-flow languages. {\bf G.2.2}
Mathematics of Computing, DISCRETE MATHEMATICS, Graph
Theory, Trees. {\bf D.3.4} Software, PROGRAMMING
LANGUAGES, Processors, Compilers. {\bf D.3.3} Software,
PROGRAMMING LANGUAGES, Language Constructs and
Features, Data types and structures. {\bf D.3.1}
Software, PROGRAMMING LANGUAGES, Formal Definitions and
Theory, Semantics. {\bf F.3.3} Theory of Computation,
LOGICS AND MEANINGS OF PROGRAMS, Studies of Program
Constructs, Functional constructs.",
thesaurus = "Boolean algebra; Parallel languages; Process algebra;
Program compilers; Tree data structures",
}
Related entries
- Amagbégnon, Pascalin,
30(6)163
- Besnard, Loïc,
30(6)163
- boolean,
25(5)95,
25(7)95,
28(3)363,
30(11)79,
33(7)1
- C4210,
27(6)54,
28(6)156,
29(1)13,
29(1)20,
29(1)37,
29(1)46,
29(1)54,
29(2)13,
29(2)25,
29(5)41-1,
29(7)42,
29(7)54,
29(9)56,
29(9)115,
29(10)388
- C6110P,
28(3)1,
28(3)353,
28(6)68,
28(6)100,
28(6)112,
28(6)126,
28(6)258,
28(6)278,
28(7)1,
28(7)13,
28(7)23,
28(7)33,
28(7)44,
28(7)54-1,
28(7)64,
28(7)73,
28(7)83,
28(7)92,
28(7)102,
28(7)112,
28(7)119,
28(7)129,
28(7)139,
28(7)149,
28(7)159,
28(7)169,
28(7)179,
28(7)187,
28(7)198,
28(7)208,
28(7)218,
28(7)229,
28(7)239,
28(7)249,
28(12)169,
29(1)54,
29(2)19,
29(2)25,
29(3)12,
29(4)31,
29(5)17-1,
29(6)36,
29(6)73,
29(6)97,
29(6)107,
29(6)135,
29(6)218,
29(6)266,
29(7)61,
29(9)17,
29(9)105,
29(9)140,
29(10)31,
29(10)113,
29(11)61,
29(11)208,
29(11)232,
29(11)242,
29(11)286,
29(11)328,
29(12)66,
30(3)83,
30(6)196,
30(6)205,
30(6)218,
30(6)258,
30(8)1,
30(8)11,
30(8)19,
30(8)29,
30(8)39,
30(8)48,
30(8)58,
30(8)68,
30(8)102,
30(8)123,
30(8)134,
30(8)144,
30(8)156,
30(8)189,
30(8)207,
30(11)50,
30(11)60,
30(11)134
- C6150N,
28(7)23,
28(7)64,
28(7)73,
29(5)41-1,
29(6)36,
29(6)107,
29(8)119,
29(10)113,
29(10)301,
29(11)2,
29(11)12,
29(11)25,
29(11)38,
29(11)51,
29(11)61,
29(11)183,
29(11)232,
29(11)286,
29(11)319,
29(11)328,
29(12)48,
29(12)66,
30(3)83,
30(3)103,
30(3)111,
30(6)13,
30(6)23,
30(6)67,
30(6)139,
30(6)151,
30(8)1,
30(8)11,
30(8)29,
30(8)39,
30(8)68,
30(8)102,
30(8)134,
30(8)156,
30(8)179,
30(8)189,
30(8)199,
30(8)207,
30(8)217,
30(11)1,
30(11)50,
30(11)60,
30(11)70,
30(11)108,
30(11)134
- compilation,
24(3)34,
25(6)16,
25(6)137,
25(6)150,
25(6)283,
27(1)13,
27(7)68,
27(7)94,
27(7)200,
28(6)166,
28(6)237,
29(6)13,
29(6)36,
29(10)229,
30(3)13,
30(3)119,
30(6)116,
30(6)258,
30(8)1,
30(10)124,
30(11)41,
30(11)125,
31(5)149,
31(5)206,
31(6)34,
32(5)215,
32(7)180,
32(8)309,
32(8)309,
32(12)1,
32(12)107,
34(1)141,
34(9)160
- D.3.1,
25(6)197,
25(6)209,
25(6)234,
27(7)116,
28(3)365,
28(6)166,
29(8)129,
31(5)99
- data-flow,
27(7)82,
28(6)126,
30(3)50,
30(3)83,
30(6)32,
30(6)163,
33(5)72,
34(8)84
- DISCRETE,
25(6)16,
25(6)40,
25(6)85-1,
25(6)223,
25(6)234,
25(6)246,
25(6)272,
25(6)283,
25(6)296,
25(6)337,
26(6)130,
26(6)177-1,
26(6)192,
26(6)204,
26(6)241,
26(6)256,
27(7)162,
27(7)300,
27(7)311,
27(7)331,
28(6)78-1,
28(6)112,
28(6)126,
28(6)248,
28(6)268,
28(6)278,
28(6)290,
28(6)300,
29(6)135,
29(6)266,
30(3)1,
30(3)23,
30(3)35,
30(3)50,
30(6)32,
30(6)47,
30(6)186,
30(6)246,
30(11)70,
31(5)54,
31(5)278,
31(5)291,
31(9)222-1,
31(9)234,
32(5)85,
32(5)171,
32(5)235,
32(5)249,
32(5)261,
32(5)287,
32(5)296-1,
33(5)15,
33(5)26-1,
33(5)60,
33(5)85-1,
33(5)97,
33(5)142,
33(11)218,
34(3)57
- equation,
25(6)1,
27(7)152,
27(8)43,
28(6)78-1,
28(7)159,
28(7)179,
30(8)48,
30(8)80-1,
32(12)90,
32(12)90
- flow, Data-,
27(7)82,
30(3)50,
30(3)83,
30(6)32,
33(5)72
- flow, data-,
27(7)82,
28(6)126,
30(3)83,
30(6)163,
34(8)84
- G.2.2,
25(6)16,
25(6)40,
25(6)85-1,
25(6)223,
25(6)234,
25(6)246,
25(6)272,
25(6)283,
25(6)296,
25(6)337,
26(6)130,
26(6)177-1,
26(6)192,
26(6)204,
26(6)241,
26(6)256,
27(7)162,
27(7)300,
27(7)311,
27(7)331,
28(6)78-1,
28(6)112,
28(6)126,
28(6)248,
28(6)268,
28(6)278,
28(6)290,
28(6)300,
29(6)135,
29(6)266,
30(3)1,
30(3)23,
30(3)35,
30(3)50,
30(6)32,
30(6)47,
30(6)186,
30(6)246,
31(5)54,
31(5)278,
31(5)291,
31(9)222-1,
31(9)234,
32(5)85,
33(5)15,
33(5)26-1,
33(5)60,
33(5)85-1,
33(5)97,
33(5)142
- Guernic, Paul Le,
30(6)163
- key,
25(6)112,
26(11)33,
27(7)152,
27(7)311,
28(3)271,
28(7)33,
29(6)230,
29(11)2,
29(11)38,
29(11)319,
30(3)94
- lies,
27(7)116
- MATHEMATICS,
25(6)16,
25(6)40,
25(6)85-1,
25(6)223,
25(6)234,
25(6)246,
25(6)272,
25(6)283,
25(6)296,
25(6)337,
26(6)130,
26(6)177-1,
26(6)192,
26(6)204,
26(6)241,
26(6)256,
27(7)162,
27(7)300,
27(7)311,
27(7)331,
28(6)78-1,
28(6)112,
28(6)126,
28(6)248,
28(6)268,
28(6)278,
28(6)290,
28(6)300,
29(6)135,
29(6)266,
30(3)1,
30(3)23,
30(3)35,
30(3)50,
30(6)32,
30(6)47,
30(6)186,
30(6)246,
30(11)70,
31(5)54,
31(5)278,
31(5)291,
31(9)222-1,
31(9)234,
32(5)85,
32(5)171,
32(5)235,
32(5)249,
32(5)261,
32(5)287,
32(5)296-1,
33(5)15,
33(5)26-1,
33(5)60,
33(5)85-1,
33(5)97,
33(5)142,
33(11)218,
34(3)57
- originality,
30(3)103
- perform,
26(6)219,
27(7)12,
27(7)32,
27(7)82,
27(7)200,
28(6)156,
28(6)177,
28(6)237,
28(6)300,
28(8)90,
29(6)49,
29(6)206,
29(11)25,
29(11)145,
29(11)158,
29(11)171,
29(11)319,
30(3)94,
30(6)151,
30(6)186,
30(6)205,
30(8)48,
30(8)80-1,
30(8)123,
30(8)217,
30(11)7,
30(11)20-1
- PLDI'95.,
30(6)1,
30(6)13,
30(6)23,
30(6)32,
30(6)47,
30(6)56,
30(6)67,
30(6)79-1,
30(6)93,
30(6)103,
30(6)116,
30(6)130,
30(6)139,
30(6)151,
30(6)174,
30(6)186,
30(6)196,
30(6)205,
30(6)218,
30(6)233,
30(6)246,
30(6)258,
30(6)270,
30(6)279,
30(6)291,
30(6)301,
30(6)315
- SIGNAL,
30(3)83,
30(6)163
- solve,
25(6)223,
27(7)152,
28(3)177,
28(6)126,
28(6)156,
29(6)73,
29(6)107
- solving,
25(6)1,
25(6)296,
25(6)337,
27(7)188-1,
28(7)179,
29(6)349,
29(6)349-1,
29(8)46,
29(9)29,
29(11)196,
30(6)174,
30(8)48,
32(5)134,
33(7)51
- synchronous,
29(11)110,
30(3)83,
30(6)163,
30(11)79,
31(6)226,
31(8)43,
32(8)322,
32(8)377,
34(1)261
- tree,
25(4)51,
25(6)9,
25(6)296,
26(6)177-1,
26(6)192,
27(4)68,
27(7)82,
27(7)331,
28(3)363,
28(3)367,
28(6)126,
28(6)156,
29(6)135,
29(6)171,
29(6)218,
29(6)337,
29(6)337-1,
29(8)59,
29(9)51,
29(12)94,
30(3)1,
30(6)32,
30(6)47,
30(6)246,
30(8)29,
30(10)251,
31(1)28,
31(5)54,
31(9)222-1,
32(5)85,
33(9)87,
34(1)204,
34(4)19,
34(4)19-1