Grammar semantics, analysis and parsing by abstract interpretation

We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata. The result is a hierarchy of bottom-up or top-down semantics refining the classical equational and derivational l...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 412; číslo 44; s. 6135 - 6192
Hlavní autoři: Cousot, Patrick, Cousot, Radhia
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford Elsevier B.V 14.10.2011
Elsevier
Témata:
Abstract interpretation
Abstract semantics
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Automation
Bottom-up semantics
Computer science; control theory; systems
Context-free grammar
Derivation
Exact sciences and technology
Grammar flow analysis
Grammar problem
Grammars
Hierarchies
Language theory and syntactical analysis
Logic and foundations
Mathematical logic, foundations, set theory
Mathematics
Miscellaneous
Parsing
Parsing algorithms
Recursion theory
Refining
Sciences and techniques of general use
Semantics
Theoretical computing
Top-down semantics
Top-down semantics
Grammar problem
Parsing
Context-free grammar
Bottom-up semantics
Grammar flow analysis
Abstract interpretation
Abstract semantics
Automaton
Computer theory
Semantic analysis
Flow
Context free grammar
Algorithm analysis
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata. The result is a hierarchy of bottom-up or top-down semantics refining the classical equational and derivational language semantics and including Knuth grammar problems, classical grammar flow analysis algorithms and parsing algorithms.
AbstractList We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata. The result is a hierarchy of bottom-up or top-down semantics refining the classical equational and derivational language semantics and including Knuth grammar problems, classical grammar flow analysis algorithms and parsing algorithms.
Author Cousot, Patrick
Cousot, Radhia
Author_xml – sequence: 1
  givenname: Patrick
  surname: Cousot
  fullname: Cousot, Patrick
  organization: Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10012, United States
– sequence: 2
  givenname: Radhia
  surname: Cousot
  fullname: Cousot, Radhia
  organization: École normale supérieure, 45 rue d’Ulm, 75230 Paris Cedex 05, France
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=24587266$$DView record in Pascal Francis
BookMark eNp9kE1LxDAQhoMouH78AG-9iBdbk7RJGzyp-AWCFz2HaTqVLN10zURh_72R1YsH5zJzeJ-B9zlgu2EOyNiJ4JXgQl8sq-SoklyIiuuKc7XDFqJrTSmlaXbZgte8KWvTqn12QLTkeVSrF-z6PsJqBbEgXEFI3tF5AQGmDXnKx1CsIZIPb0W_KaCnFMGlwoeEcR0xQfJzOGJ7I0yExz_7kL3e3b7cPJRPz_ePN1dPpauVSSWCkr0ZOIyG904K4LzGjrte6b52oxYDSt2aZkSFom0H10Hdiw4UCCMbMPUhO9v-Xcf5_QMp2ZUnh9MEAecPskbqWuiukzl5-pMEcjCNEYLzZNfR56YbKxvVtVLrnGu3ORdnooijdX7bKff0kxXcfsu1S5vl2m-5lmubzWVS_CF_n__HXG4ZzJI-PUZLzmNwOPiILtlh9v_QX7SSlJM
CODEN TCSCDI
CitedBy_id crossref_primary_10_1016_j_future_2018_04_059
crossref_primary_10_1016_j_cola_2019_02_005
crossref_primary_10_1016_j_eswa_2021_116207
Cites_doi 10.1006/jagm.1996.0046
10.1016/S0019-9958(63)90306-1
10.1007/BF02009622
10.1016/S1571-0661(05)82573-3
10.1109/TIT.1956.1056813
10.1016/S0304-3975(00)00313-3
10.1090/psapm/012/9975
10.1145/321127.321132
10.1016/j.tcs.2009.07.040
10.1016/S0019-9958(67)80007-X
10.1007/BF01386390
10.1016/0020-0190(77)90002-3
10.2307/2034080
10.2140/pjm.1979.82.43
10.1007/978-94-015-8969-7
10.1090/psapm/019/0242403
ContentType Journal Article
Copyright 2011 Elsevier B.V.
2015 INIST-CNRS
Copyright_xml – notice: 2011 Elsevier B.V.
– notice: 2015 INIST-CNRS
DBID 6I.
AAFTH
AAYXX
CITATION
IQODW
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.tcs.2011.06.005
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
Applied Sciences
EISSN 1879-2294
EndPage 6192
ExternalDocumentID 24587266
10_1016_j_tcs_2011_06_005
S0304397511004919
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
29Q
4.4
457
4G.
5VS
6I.
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABAOU
ABBOA
ABEFU
ABFNM
ABJNI
ABMAC
ABTAH
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADMUD
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HVGLF
HZ~
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SCC
SDF
SDG
SES
SEW
SPC
SPCBC
SSV
SSW
SSZ
T5K
TAE
TN5
WH7
WUQ
XJT
YNT
ZMT
ZY4
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
BNPGV
IQODW
SSH
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c359t-ea52b9d0af90bc21a003e80cb56b3cf61de26794fe5e177dc8a3b18a5a1924a93
ISICitedReferencesCount 7
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000296108000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0304-3975
IngestDate Sun Nov 09 12:57:14 EST 2025
Wed Apr 02 07:17:06 EDT 2025
Sat Nov 29 05:15:07 EST 2025
Tue Nov 18 22:05:59 EST 2025
Fri Feb 23 02:16:40 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 44
Keywords Top-down semantics
Grammar problem
Parsing
Context-free grammar
Bottom-up semantics
Grammar flow analysis
Abstract interpretation
Abstract semantics
Automaton
Computer theory
Semantic analysis
Flow
Context free grammar
Algorithm analysis
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c359t-ea52b9d0af90bc21a003e80cb56b3cf61de26794fe5e177dc8a3b18a5a1924a93
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
OpenAccessLink https://dx.doi.org/10.1016/j.tcs.2011.06.005
PQID 926316882
PQPubID 23500
PageCount 58
ParticipantIDs proquest_miscellaneous_926316882
pascalfrancis_primary_24587266
crossref_citationtrail_10_1016_j_tcs_2011_06_005
crossref_primary_10_1016_j_tcs_2011_06_005
elsevier_sciencedirect_doi_10_1016_j_tcs_2011_06_005
PublicationCentury 2000
PublicationDate 2011-10-14
PublicationDateYYYYMMDD 2011-10-14
PublicationDate_xml – month: 10
  year: 2011
  text: 2011-10-14
  day: 14
PublicationDecade 2010
PublicationPlace Oxford
PublicationPlace_xml – name: Oxford
PublicationTitle Theoretical computer science
PublicationYear 2011
Publisher Elsevier B.V
Elsevier
Publisher_xml – name: Elsevier B.V
– name: Elsevier
References Ginsburg, Rice (br000145) 1962; 9
F. Bauer, K. Samuelson, Verfahren zur automatischen Verarbeitung von kodierten Daten und Rechenmaschine zur Ausübung des Verfahrens, deutsches Patentamt, Auslegeschrift 1094019, B441221X/42m. Anmeldetag: 30. März 1957. Bekanntmachung der Anmeldung und Ausgabe der Auslegeschrift: 1.Dezember 1960. Dr. Friedrich Ludwig Bauer und Dr. Klaus Samuelson, München, sind als Erfinder genannt worden. Erteilt 12.8.1971, DE-PS 1094019, 1957.
Cousot (br000130) 1981
Aho, Sethi, Ullman (br000160) 1986
Chomsky (br000055) 1957
Knuth (br000005) 1977; 6
U. Möncke, Generierung von systemen zur transformation attributierter operatorbäume; komponenten des systems und mechanismen der generierung, Diplomarbeit, Universität des Saarlandes, Saarbrücken, 1985.
Ehrenfeucht, Päun, Rozenberg (br000220) 1997
Samuelson, Bauer (br000080) 1959; 1
A. Oettinger, Automatic syntactic analysis and the pushdown store, in: Proceedings of Symposia in Applied Math. 12.
Bauer (br000085) 2002
Möncke, Wilhelm (br000025) 1982
Chomsky, Schützenberger (br000155) 1963
Dijkstra (br000165) 1959; 1
Leroy (br000195) 2006; vol. 3924
Aho, Ullman, Parsing (br000020) 1972
T. Kasami, An efficient recognition and syntax analysis algorithm for context-free languages, Tech. Rep., Air Force Cambridge Research Laboratory, Bedford, August 1965.
Wilhelm, Maurer (br000040) 1992
McCarthy, Painter (br000185) 1967; vol. 19
N. Chomsky, Context free grammars and pushdown storage, quarterly Progress Report 65, MIT Research Laboratory in Electronics, Cambridge, 1962.
Schützenberger (br000150) 1962; 13
Boullier (br000225) 2001; 53
Evey (br000100) 1963
Möncke, Wilhelm (br000035) 1991; vol. 545
Hays (br000170) 1967
Päun (br000215) 1997
Cousot (br000200) 1999; vol. 173
Naur (br000090) 1978
Boehm (br000070) 1954; 4
Rutishauser (br000065) 1952; 32
Schützenberger (br000105) 1963; 6
Cousot (br000125) 2002; 277
Autebert, Berstel, Boasson (br000115) 1997; vol.~1
Leroy (br000190) 2006
Davey, Priestley (br000230) 2002
D. Pichardie, Interprétation abstraite en logique intuitionniste: extraction d’analyseurs Java certifiés, Ph.D. Thesis, Université de Rennes I, December 2005.
Cousot, Cousot (br000140) 1979; 82
Younger (br000175) 1967; 10
Chomsky (br000050) 1956; 2
Bar-Hillel, Perles, Shamir (br000015) 1961; 14
Cousot, Cousot (br000135) 1979
Cousot, Cousot, Giacobazzi (br000210) 2009; 410
Cousot, Cousot (br000045) 1977
Ginsburg (br000120) 1966
Ramalingam, Reps (br000010) 1996; 21
Hoogeboom, Engelfriet (br000110) 2004; vol. 148
10.1016/j.tcs.2011.06.005_br000180
Ginsburg (10.1016/j.tcs.2011.06.005_br000145) 1962; 9
10.1016/j.tcs.2011.06.005_br000060
Wilhelm (10.1016/j.tcs.2011.06.005_br000040) 1992
Cousot (10.1016/j.tcs.2011.06.005_br000125) 2002; 277
Möncke (10.1016/j.tcs.2011.06.005_br000025) 1982
Ginsburg (10.1016/j.tcs.2011.06.005_br000120) 1966
Schützenberger (10.1016/j.tcs.2011.06.005_br000150) 1962; 13
Cousot (10.1016/j.tcs.2011.06.005_br000130) 1981
Cousot (10.1016/j.tcs.2011.06.005_br000210) 2009; 410
Younger (10.1016/j.tcs.2011.06.005_br000175) 1967; 10
Päun (10.1016/j.tcs.2011.06.005_br000215) 1997
Chomsky (10.1016/j.tcs.2011.06.005_br000050) 1956; 2
Aho (10.1016/j.tcs.2011.06.005_br000160) 1986
Evey (10.1016/j.tcs.2011.06.005_br000100) 1963
Chomsky (10.1016/j.tcs.2011.06.005_br000155) 1963
Samuelson (10.1016/j.tcs.2011.06.005_br000080) 1959; 1
Leroy (10.1016/j.tcs.2011.06.005_br000195) 2006; vol. 3924
Bar-Hillel (10.1016/j.tcs.2011.06.005_br000015) 1961; 14
Cousot (10.1016/j.tcs.2011.06.005_br000045) 1977
Ramalingam (10.1016/j.tcs.2011.06.005_br000010) 1996; 21
Rutishauser (10.1016/j.tcs.2011.06.005_br000065) 1952; 32
McCarthy (10.1016/j.tcs.2011.06.005_br000185) 1967; vol. 19
Knuth (10.1016/j.tcs.2011.06.005_br000005) 1977; 6
Naur (10.1016/j.tcs.2011.06.005_br000090) 1978
Dijkstra (10.1016/j.tcs.2011.06.005_br000165) 1959; 1
Aho (10.1016/j.tcs.2011.06.005_br000020) 1972
10.1016/j.tcs.2011.06.005_br000030
10.1016/j.tcs.2011.06.005_br000095
Cousot (10.1016/j.tcs.2011.06.005_br000135) 1979
Leroy (10.1016/j.tcs.2011.06.005_br000190) 2006
Ehrenfeucht (10.1016/j.tcs.2011.06.005_br000220) 1997
Davey (10.1016/j.tcs.2011.06.005_br000230) 2002
10.1016/j.tcs.2011.06.005_br000075
Hoogeboom (10.1016/j.tcs.2011.06.005_br000110) 2004; vol. 148
Boehm (10.1016/j.tcs.2011.06.005_br000070) 1954; 4
Schützenberger (10.1016/j.tcs.2011.06.005_br000105) 1963; 6
Cousot (10.1016/j.tcs.2011.06.005_br000200) 1999; vol. 173
10.1016/j.tcs.2011.06.005_br000205
Autebert (10.1016/j.tcs.2011.06.005_br000115) 1997; vol.~1
Hays (10.1016/j.tcs.2011.06.005_br000170) 1967
Boullier (10.1016/j.tcs.2011.06.005_br000225) 2001; 53
Chomsky (10.1016/j.tcs.2011.06.005_br000055) 1957
Bauer (10.1016/j.tcs.2011.06.005_br000085) 2002
Cousot (10.1016/j.tcs.2011.06.005_br000140) 1979; 82
Möncke (10.1016/j.tcs.2011.06.005_br000035) 1991; vol. 545
References_xml – reference: D. Pichardie, Interprétation abstraite en logique intuitionniste: extraction d’analyseurs Java certifiés, Ph.D. Thesis, Université de Rennes I, December 2005.
– volume: 13
  start-page: 885
  year: 1962
  end-page: 889
  ident: br000150
  article-title: On a theorem of R. Jungen
  publication-title: Proceedings of the American Mathematical Society
– volume: vol. 3924
  start-page: 54
  year: 2006
  end-page: 68
  ident: br000195
  article-title: Coinductive big-step operational semantics
  publication-title: Proceedings of the Fifteenth European Symposium on Programming Languages and Systems
– volume: 32
  start-page: 312
  year: 1952
  end-page: 313
  ident: br000065
  article-title: Automatische Rechenplanfertigung bei programmgesteuerten Rechenmaschinen
  publication-title: Zeitschrift für Angewandte Mathematik und
– volume: 2
  start-page: 113
  year: 1956
  end-page: 124
  ident: br000050
  article-title: Three models for the description of language
  publication-title: IEEE Transactions on Information Theory
– start-page: 303
  year: 1981
  end-page: 342
  ident: br000130
  article-title: Semantic foundations of program analysis, invited chapter
  publication-title: Program Flow Analysis: Theory and Applications
– volume: 277
  start-page: 47
  year: 2002
  end-page: 103
  ident: br000125
  article-title: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
  publication-title: Theoretical Computer Science
– reference: U. Möncke, Generierung von systemen zur transformation attributierter operatorbäume; komponenten des systems und mechanismen der generierung, Diplomarbeit, Universität des Saarlandes, Saarbrücken, 1985.
– year: 1986
  ident: br000160
  article-title: Compilers. Principles, Technique and Tools
– start-page: 42
  year: 2006
  end-page: 54
  ident: br000190
  article-title: Formal certification of a compiler back-end or: programming a compiler with a proof assistant
  publication-title: Conference Record of the Thirtythird Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
– volume: 6
  start-page: 1
  year: 1977
  end-page: 5
  ident: br000005
  article-title: A generalization of Dijkstra’s algorithm
  publication-title: Information Processing Letters
– volume: 410
  start-page: 4724
  year: 2009
  end-page: 4746
  ident: br000210
  article-title: Abstract interpretation of resolution-based semantics
  publication-title: Theoretical Computer Science
– volume: 6
  start-page: 246
  year: 1963
  end-page: 264
  ident: br000105
  article-title: On context free languages and pushdown automata
  publication-title: Information and Control
– year: 2002
  ident: br000230
  article-title: Introduction to Lattices and Order
– volume: 1
  start-page: 176
  year: 1959
  end-page: 182
  ident: br000080
  article-title: Sequentielle formelübersetzung
  publication-title: Elektronische Rechenanlagen
– start-page: 26
  year: 2002
  end-page: 42
  ident: br000085
  article-title: From the stack principle to ALGOL
  publication-title: Software Pioneers: Contributions to Software Engineering
– year: 1963
  ident: br000100
  article-title: Application of pushdown store machines
  publication-title: Proceedings of the 1963 Fall Joint Computer Conference
– volume: 21
  start-page: 267
  year: 1996
  end-page: 305
  ident: br000010
  article-title: An incremental algorithm for a generalization of the shortest-path problem
  publication-title: Journal of Algorithms
– volume: 14
  start-page: 143
  year: 1961
  end-page: 172
  ident: br000015
  article-title: On formal properties of simple phrase structure grammars
  publication-title: Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationforschung
– volume: 53
  start-page: 41
  year: 2001
  end-page: 52
  ident: br000225
  article-title: From contextual grammars to range concatenation grammars
  publication-title: Electronic Notes in Theoretical Computer Science
– year: 1992
  ident: br000040
  article-title: Übersetzerbau. Theorie, Konstruktion, Generierung
– volume: 1
  start-page: 269
  year: 1959
  end-page: 271
  ident: br000165
  article-title: A note on two problems in connexion with graphs
  publication-title: Numerische Mathematik
– start-page: 238
  year: 1977
  end-page: 252
  ident: br000045
  article-title: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
  publication-title: Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
– volume: vol. 173
  start-page: 421
  year: 1999
  end-page: 505
  ident: br000200
  article-title: The calculational design of a generic abstract interpreter, invited chapter
  publication-title: Calculational System Design
– volume: vol.~1
  year: 1997
  ident: br000115
  article-title: Context-free languages and pushdown automata
  publication-title: Word, Language, Grammar
– volume: 10
  start-page: 609
  year: 1967
  end-page: 617
  ident: br000175
  article-title: Recognition and parsing of context-free languages in time
  publication-title: Information and Control
– volume: vol. 19
  start-page: 33
  year: 1967
  end-page: 41
  ident: br000185
  article-title: Correctness of a compiler for arithmetic expressions
  publication-title: Proceedings of the Symposium in Applied Mathematics
– year: 1972
  ident: br000020
  article-title: The Theory of Parsing, Translation and Compiling, vol.~1
– start-page: 92
  year: 1978
  end-page: 139
  ident: br000090
  article-title: The European side of the last phase of the development of ALGOL 60
  publication-title: History of Programming Languages I
– year: 1967
  ident: br000170
  article-title: Introduction to Computational Linguistics
– year: 1997
  ident: br000215
  article-title: Marcus Contextual Grammars, Studies in Linguistics and Philosophy
– year: 1966
  ident: br000120
  article-title: The Mathematical Theory of Context-Free Languages
– reference: T. Kasami, An efficient recognition and syntax analysis algorithm for context-free languages, Tech. Rep., Air Force Cambridge Research Laboratory, Bedford, August 1965.
– volume: vol. 545
  start-page: 151
  year: 1991
  end-page: 186
  ident: br000035
  article-title: Grammar flow analysis
  publication-title: Proceedings of the Attribute Grammars, Applications and Systems, International Summer School SAGA, Prague, 4–13 June, 1991
– reference: A. Oettinger, Automatic syntactic analysis and the pushdown store, in: Proceedings of Symposia in Applied Math. 12.
– start-page: 177
  year: 1982
  end-page: 194
  ident: br000025
  article-title: Iterative algorithms on grammar graphs
  publication-title: Proceedings of the Eight Conference on Graphtheoretic Concepts in Computer Science, WG’82
– volume: 9
  start-page: 350
  year: 1962
  end-page: 371
  ident: br000145
  article-title: Two families of languages related to ALGOL
  publication-title: Journal of the Association for Computing Machinery
– start-page: 118
  year: 1963
  end-page: 161
  ident: br000155
  article-title: The algebraic theory of context-free languages
  publication-title: Computer programming and Formal Systems
– volume: 4
  start-page: 5
  year: 1954
  end-page: 47
  ident: br000070
  article-title: Calculatrices digitales. du déchiffrage de formules logico-mathématiques par la machine même dans la conception du programme. dissertation eth zürich (1952)
  publication-title: Annali di Matematica Pura ed Applicata
– start-page: 269
  year: 1979
  end-page: 282
  ident: br000135
  article-title: Systematic design of program analysis frameworks
  publication-title: Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
– reference: F. Bauer, K. Samuelson, Verfahren zur automatischen Verarbeitung von kodierten Daten und Rechenmaschine zur Ausübung des Verfahrens, deutsches Patentamt, Auslegeschrift 1094019, B441221X/42m. Anmeldetag: 30. März 1957. Bekanntmachung der Anmeldung und Ausgabe der Auslegeschrift: 1.Dezember 1960. Dr. Friedrich Ludwig Bauer und Dr. Klaus Samuelson, München, sind als Erfinder genannt worden. Erteilt 12.8.1971, DE-PS 1094019, 1957.
– reference: N. Chomsky, Context free grammars and pushdown storage, quarterly Progress Report 65, MIT Research Laboratory in Electronics, Cambridge, 1962.
– volume: vol. 148
  start-page: 117
  year: 2004
  end-page: 138
  ident: br000110
  article-title: Pushdown automata
  publication-title: Formal Languages and Applications
– start-page: 237
  year: 1997
  end-page: 293
  ident: br000220
  article-title: Contextual grammars and formal languages
  publication-title: Handbook of Formal Languages, vol.~2
– year: 1957
  ident: br000055
– volume: 82
  start-page: 43
  year: 1979
  end-page: 57
  ident: br000140
  article-title: Constructive versions of Tarski’s fixed point theorems
  publication-title: Pacific Journal of Mathematics
– volume: vol.~1
  year: 1997
  ident: 10.1016/j.tcs.2011.06.005_br000115
  article-title: Context-free languages and pushdown automata
– start-page: 118
  year: 1963
  ident: 10.1016/j.tcs.2011.06.005_br000155
  article-title: The algebraic theory of context-free languages
– volume: 21
  start-page: 267
  issue: 2
  year: 1996
  ident: 10.1016/j.tcs.2011.06.005_br000010
  article-title: An incremental algorithm for a generalization of the shortest-path problem
  publication-title: Journal of Algorithms
  doi: 10.1006/jagm.1996.0046
– volume: vol. 3924
  start-page: 54
  year: 2006
  ident: 10.1016/j.tcs.2011.06.005_br000195
  article-title: Coinductive big-step operational semantics
– start-page: 237
  year: 1997
  ident: 10.1016/j.tcs.2011.06.005_br000220
  article-title: Contextual grammars and formal languages
– volume: 6
  start-page: 246
  year: 1963
  ident: 10.1016/j.tcs.2011.06.005_br000105
  article-title: On context free languages and pushdown automata
  publication-title: Information and Control
  doi: 10.1016/S0019-9958(63)90306-1
– ident: 10.1016/j.tcs.2011.06.005_br000075
– volume: 32
  start-page: 312
  year: 1952
  ident: 10.1016/j.tcs.2011.06.005_br000065
  article-title: Automatische Rechenplanfertigung bei programmgesteuerten Rechenmaschinen
  publication-title: Zeitschrift für Angewandte Mathematik und
  doi: 10.1007/BF02009622
– ident: 10.1016/j.tcs.2011.06.005_br000030
– volume: 53
  start-page: 41
  year: 2001
  ident: 10.1016/j.tcs.2011.06.005_br000225
  article-title: From contextual grammars to range concatenation grammars
  publication-title: Electronic Notes in Theoretical Computer Science
  doi: 10.1016/S1571-0661(05)82573-3
– start-page: 238
  year: 1977
  ident: 10.1016/j.tcs.2011.06.005_br000045
  article-title: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
– volume: 2
  start-page: 113
  issue: 3
  year: 1956
  ident: 10.1016/j.tcs.2011.06.005_br000050
  article-title: Three models for the description of language
  publication-title: IEEE Transactions on Information Theory
  doi: 10.1109/TIT.1956.1056813
– year: 1957
  ident: 10.1016/j.tcs.2011.06.005_br000055
– volume: 277
  start-page: 47
  issue: 1—2
  year: 2002
  ident: 10.1016/j.tcs.2011.06.005_br000125
  article-title: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
  publication-title: Theoretical Computer Science
  doi: 10.1016/S0304-3975(00)00313-3
– start-page: 303
  year: 1981
  ident: 10.1016/j.tcs.2011.06.005_br000130
  article-title: Semantic foundations of program analysis, invited chapter
– year: 2002
  ident: 10.1016/j.tcs.2011.06.005_br000230
– volume: 1
  start-page: 176
  issue: 4
  year: 1959
  ident: 10.1016/j.tcs.2011.06.005_br000080
  article-title: Sequentielle formelübersetzung
  publication-title: Elektronische Rechenanlagen
– ident: 10.1016/j.tcs.2011.06.005_br000060
  doi: 10.1090/psapm/012/9975
– volume: 9
  start-page: 350
  year: 1962
  ident: 10.1016/j.tcs.2011.06.005_br000145
  article-title: Two families of languages related to ALGOL
  publication-title: Journal of the Association for Computing Machinery
  doi: 10.1145/321127.321132
– volume: vol. 173
  start-page: 421
  year: 1999
  ident: 10.1016/j.tcs.2011.06.005_br000200
  article-title: The calculational design of a generic abstract interpreter, invited chapter
– year: 1967
  ident: 10.1016/j.tcs.2011.06.005_br000170
– start-page: 42
  year: 2006
  ident: 10.1016/j.tcs.2011.06.005_br000190
  article-title: Formal certification of a compiler back-end or: programming a compiler with a proof assistant
– year: 1992
  ident: 10.1016/j.tcs.2011.06.005_br000040
– volume: vol. 148
  start-page: 117
  year: 2004
  ident: 10.1016/j.tcs.2011.06.005_br000110
  article-title: Pushdown automata
– volume: 410
  start-page: 4724
  issue: 46
  year: 2009
  ident: 10.1016/j.tcs.2011.06.005_br000210
  article-title: Abstract interpretation of resolution-based semantics
  publication-title: Theoretical Computer Science
  doi: 10.1016/j.tcs.2009.07.040
– volume: 10
  start-page: 609
  issue: 2
  year: 1967
  ident: 10.1016/j.tcs.2011.06.005_br000175
  article-title: Recognition and parsing of context-free languages in time n3
  publication-title: Information and Control
  doi: 10.1016/S0019-9958(67)80007-X
– start-page: 177
  year: 1982
  ident: 10.1016/j.tcs.2011.06.005_br000025
  article-title: Iterative algorithms on grammar graphs
– start-page: 26
  year: 2002
  ident: 10.1016/j.tcs.2011.06.005_br000085
  article-title: From the stack principle to ALGOL
– volume: 1
  start-page: 269
  year: 1959
  ident: 10.1016/j.tcs.2011.06.005_br000165
  article-title: A note on two problems in connexion with graphs
  publication-title: Numerische Mathematik
  doi: 10.1007/BF01386390
– volume: vol. 545
  start-page: 151
  year: 1991
  ident: 10.1016/j.tcs.2011.06.005_br000035
  article-title: Grammar flow analysis
– volume: 6
  start-page: 1
  issue: 1
  year: 1977
  ident: 10.1016/j.tcs.2011.06.005_br000005
  article-title: A generalization of Dijkstra’s algorithm
  publication-title: Information Processing Letters
  doi: 10.1016/0020-0190(77)90002-3
– start-page: 92
  year: 1978
  ident: 10.1016/j.tcs.2011.06.005_br000090
  article-title: The European side of the last phase of the development of ALGOL 60
– start-page: 269
  year: 1979
  ident: 10.1016/j.tcs.2011.06.005_br000135
  article-title: Systematic design of program analysis frameworks
– volume: 13
  start-page: 885
  year: 1962
  ident: 10.1016/j.tcs.2011.06.005_br000150
  article-title: On a theorem of R. Jungen
  publication-title: Proceedings of the American Mathematical Society
  doi: 10.2307/2034080
– ident: 10.1016/j.tcs.2011.06.005_br000205
– volume: 14
  start-page: 143
  year: 1961
  ident: 10.1016/j.tcs.2011.06.005_br000015
  article-title: On formal properties of simple phrase structure grammars
  publication-title: Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationforschung
– ident: 10.1016/j.tcs.2011.06.005_br000095
– year: 1972
  ident: 10.1016/j.tcs.2011.06.005_br000020
– volume: 82
  start-page: 43
  issue: 1
  year: 1979
  ident: 10.1016/j.tcs.2011.06.005_br000140
  article-title: Constructive versions of Tarski’s fixed point theorems
  publication-title: Pacific Journal of Mathematics
  doi: 10.2140/pjm.1979.82.43
– year: 1997
  ident: 10.1016/j.tcs.2011.06.005_br000215
  doi: 10.1007/978-94-015-8969-7
– year: 1963
  ident: 10.1016/j.tcs.2011.06.005_br000100
  article-title: Application of pushdown store machines
– volume: 4
  start-page: 5
  issue: 37
  year: 1954
  ident: 10.1016/j.tcs.2011.06.005_br000070
  article-title: Calculatrices digitales. du déchiffrage de formules logico-mathématiques par la machine même dans la conception du programme. dissertation eth zürich (1952)
  publication-title: Annali di Matematica Pura ed Applicata
– ident: 10.1016/j.tcs.2011.06.005_br000180
– year: 1966
  ident: 10.1016/j.tcs.2011.06.005_br000120
– volume: vol. 19
  start-page: 33
  year: 1967
  ident: 10.1016/j.tcs.2011.06.005_br000185
  article-title: Correctness of a compiler for arithmetic expressions
  doi: 10.1090/psapm/019/0242403
– year: 1986
  ident: 10.1016/j.tcs.2011.06.005_br000160
SSID ssj0000576
Score 2.0313165
Snippet We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars...
SourceID proquest
pascalfrancis
crossref
elsevier
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 6135
SubjectTerms Abstract interpretation
Abstract semantics
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Automation
Bottom-up semantics
Computer science; control theory; systems
Context-free grammar
Derivation
Exact sciences and technology
Grammar flow analysis
Grammar problem
Grammars
Hierarchies
Language theory and syntactical analysis
Logic and foundations
Mathematical logic, foundations, set theory
Mathematics
Miscellaneous
Parsing
Parsing algorithms
Recursion theory
Refining
Sciences and techniques of general use
Semantics
Theoretical computing
Top-down semantics
Title Grammar semantics, analysis and parsing by abstract interpretation
URI https://dx.doi.org/10.1016/j.tcs.2011.06.005
https://www.proquest.com/docview/926316882
Volume 412
WOSCitedRecordID wos000296108000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 20180131
  omitProxy: false
  ssIdentifier: ssj0000576
  issn: 0304-3975
  databaseCode: AIEXJ
  dateStart: 19950109
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELag5QBCBQqI5VH5wIkSlDj2Jj6WqrwkWgRbaW-WXxGt2nS1SVH594xjO8kWKHDgEiXexNH6-zIz9oxnEHqeKpuDHW8SpihNqNZpwpXOE5mpvLA5JcbIrthEsb9fzuf8U0io0HTlBIq6Li8u-OK_Qg1tALbbOvsPcPedQgOcA-hwBNjh-FfAv11Ktx9tu7GnMGohDkjG3CNdXgDpVwjA8pTKLXXotksbMQQfjk3W2Wirow41ILaD4uw9GAeHXw5m3iJt-0T7Kz98lubrkRwvMvgot2xYZIy7X0bCKXceFe6rnkRJSjMyogylI8EIVgMbKVk3bfulAPdrCcevWt2E_KrOWcQGbRU99JeUWB9aSCgrC7A6rqN1UjAOsnp95_3e_MOgnlnhHdjhD0RXdxf0d-m1vzNWbi9kA6Ne-donP6nxzjaZ3UUbYVKBdzwZ7qFrtt5Ed8IEAwfx3UBTrOER2zbRrY993t7mPnodyIN78rzEkTpwYnCgDlbfcaQOXqXOA3T4Zm-2-y4JVTYSnTPeJlYyorhJZcVTpUkmQc7bMtWKTVWuq2lmLJmC1K4ss1lRGF3KXGWlZNLN3SXPH6K1-qy2jxAG4W6NoWAUVppWzEjohWu4hj6trsgEpXE4hQ4p6F0llBMRYw2PBSAgHAKii7dkE_Sif2Th869cdTONGInwHXjDUAC9rnpsawXP_kWRSxOEI8ACpK9zqcnanp03gpOpq_xWksd_6uMJujl8WE_RWrs8t8_QDf2tPWqWW4GkPwBrNqXt
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Grammar+semantics%2C+analysis+and+parsing+by+abstract+interpretation&rft.jtitle=Theoretical+computer+science&rft.au=COUSOT%2C+Patrick&rft.au=COUSOT%2C+Radhia&rft.date=2011-10-14&rft.pub=Elsevier&rft.issn=0304-3975&rft.volume=412&rft.issue=44&rft.spage=6135&rft.epage=6192&rft_id=info:doi/10.1016%2Fj.tcs.2011.06.005&rft.externalDBID=n%2Fa&rft.externalDocID=24587266
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon