Entry Gabric:1999:SAF from lncs1999a.bib
Last update: Sun Jun 12 03:08:01 2016
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{Gabric:1999:SAF,
author = "Tihomir Gabric and Kevin Glynn and Harald
S{\o}ndergaard",
title = "Strictness Analysis as Finite-Domain Constraint
Solving",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1559",
pages = "255--270",
year = "1999",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Feb 5 11:53:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1559.htm;
http://www.math.utah.edu/pub/tex/bib/lncs1999a.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1559/15590255.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1559/15590255.pdf",
acknowledgement = ack-nhfb,
keywords = "computer science; logic-based program synthesis;
program transformation",
}
Related entries
- analysis,
1542(0)180,
1542(0)273,
1542(0)293,
1548(0)124,
1548(0)389,
1550(0)1,
1550(0)13,
1550(0)13,
1552(0)474,
1557(0)163,
1557(0)163,
1557(0)594,
1558(0)282,
1558(0)318,
1560(0)235,
1562(0)230,
1563(0)414,
1567(0)70,
1567(0)70,
1567(0)163,
1567(0)390,
1568(0)242,
1569(0)2,
1569(0)3,
1569(0)103,
1569(0)209,
1569(0)256,
1573(0)250,
1573(0)378,
1573(0)480,
1573(0)534,
1574(0)420,
1574(0)479,
1575(0)63,
1576(0)20,
1576(0)59,
1576(0)177,
1578(0)14,
1578(0)120,
1579(0)134,
1579(0)148,
1579(0)178,
1579(0)375,
1579(0)390,
1579(0)420,
1582(0)132,
1585(0)349,
1586(0)248,
1586(0)1036,
1587(0)281,
1590(0)184,
1592(0)375,
1593(0)430,
1593(0)493,
1593(0)919,
1594(0)323
- based, logic-,
1559(0)1,
1559(0)21,
1559(0)41,
1559(0)61,
1559(0)81,
1559(0)101,
1559(0)124,
1559(0)143,
1559(0)159,
1559(0)179,
1559(0)199,
1559(0)219,
1559(0)240,
1559(0)271,
1559(0)289,
1559(0)308,
1559(0)309,
1559(0)313,
1559(0)316,
1559(0)319,
1559(0)322,
1559(0)325,
1559(0)328
- constraint,
1540(0)39,
1540(0)199,
1540(0)453,
1551(0)320,
1551(0)350,
1551(0)350,
1555(0)397,
1559(0)240,
1576(0)177,
1584(0)73,
1584(0)385
- logic-based,
1559(0)1,
1559(0)21,
1559(0)41,
1559(0)61,
1559(0)81,
1559(0)101,
1559(0)124,
1559(0)143,
1559(0)159,
1559(0)179,
1559(0)199,
1559(0)219,
1559(0)240,
1559(0)271,
1559(0)289,
1559(0)308,
1559(0)309,
1559(0)313,
1559(0)316,
1559(0)319,
1559(0)322,
1559(0)325,
1559(0)328
- Solving,
1509(0)160,
1551(0)16,
1555(0)397,
1557(0)78,
1557(0)117,
1557(0)236,
1570(0)157,
1573(0)58,
1573(0)85,
1573(0)100,
1573(0)128,
1584(0)385,
1585(0)18,
1585(0)58,
1585(0)421,
1586(0)652,
1586(0)709,
1586(0)911,
1586(0)964,
1593(0)191,
1593(0)1087
- synthesis,
1542(0)273,
1559(0)1,
1559(0)21,
1559(0)41,
1559(0)61,
1559(0)81,
1559(0)101,
1559(0)124,
1559(0)143,
1559(0)143,
1559(0)159,
1559(0)179,
1559(0)199,
1559(0)219,
1559(0)240,
1559(0)271,
1559(0)289,
1559(0)308,
1559(0)309,
1559(0)313,
1559(0)316,
1559(0)319,
1559(0)322,
1559(0)325,
1559(0)328,
1567(0)1,
1569(0)152,
1573(0)563,
1583(0)41,
1585(0)373,
1586(0)588
- transformation,
1552(0)434,
1557(0)226,
1559(0)1,
1559(0)21,
1559(0)41,
1559(0)61,
1559(0)81,
1559(0)101,
1559(0)124,
1559(0)143,
1559(0)159,
1559(0)179,
1559(0)199,
1559(0)219,
1559(0)240,
1559(0)271,
1559(0)289,
1559(0)308,
1559(0)309,
1559(0)313,
1559(0)316,
1559(0)319,
1559(0)319,
1559(0)322,
1559(0)325,
1559(0)328,
1575(0)244,
1575(0)292,
1586(0)108,
1589(0)138,
1593(0)653