|
|
|
|
| LEADER |
06342cam a22010812 4500 |
| 001 |
0-1649077270 |
| 003 |
DE-627 |
| 005 |
20240122105323.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
100427s2010 gw |||||o 00| ||eng c |
| 020 |
|
|
|a 9783642120329
|9 978-3-642-12032-9
|
| 024 |
7 |
|
|a 10.1007/978-3-642-12032-9
|2 doi
|
| 035 |
|
|
|a (DE-627)1649077270
|
| 035 |
|
|
|a (DE-576)322305241
|
| 035 |
|
|
|a (DE-599)BSZ322305241
|
| 035 |
|
|
|a (OCoLC)643270216
|
| 035 |
|
|
|a (ZBM)1185.68013
|
| 035 |
|
|
|a (DE-He213)978-3-642-12032-9
|
| 035 |
|
|
|a (EBP)04051627X
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 044 |
|
|
|c XA-DE
|
| 050 |
|
0 |
|a QA8.9-QA10.3
|
| 072 |
|
7 |
|a COM051010
|2 bisacsh
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a MAT018000
|2 bisacsh
|
| 084 |
|
|
|a SS 4800
|2 rvk
|0 (DE-625)rvk/143528:
|
| 084 |
|
|
|a *68-06
|2 msc
|
| 084 |
|
|
|a 68Qxx
|2 msc
|
| 084 |
|
|
|a 00B25
|2 msc
|
| 084 |
|
|
|a 54.52
|2 bkl
|
| 084 |
|
|
|a 54.10
|2 bkl
|
| 100 |
1 |
|
|a Ong, Luke
|4 aut
|
| 245 |
1 |
0 |
|a Foundations of Software Science and Computational Structures
|b 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings
|c edited by Luke Ong
|
| 264 |
|
1 |
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2010
|
| 300 |
|
|
|a Online-Ressource (XV, 389p. 47 illus, digital)
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a Computermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a Online-Ressource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science
|v 6014
|
| 490 |
0 |
|
|a SpringerLink
|a Bücher
|
| 520 |
|
|
|a FoSSaCS 2010 Invited Talk -- to Decidability of Higher-Order Matching -- Semantics of Programming Languages -- A Semantic Foundation for Hidden State -- Linearly-Used Continuations in the Enriched Effect Calculus -- Block Structure vs. Scope Extrusion: Between Innocence and Omniscience -- Completeness for Algebraic Theories of Local State -- Probabilistic and Randomised Computation -- Fair Adversaries and Randomization in Two-Player Games -- Retaining the Probabilities in Probabilistic Testing Theory -- Concurrency and Process Theory -- Forward Analysis of Depth-Bounded Processes -- Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization -- Parameterised Multiparty Session Types -- On the Relationship between Spatial Logics and Behavioral Simulations -- Modal and Temporal Logics -- An Easy Completeness Proof for the Modal ?-Calculus on Finite Trees -- When Model-Checking Freeze LTL over Counter Machines Becomes Decidable -- Model Checking Is Static Analysis of Modal Logic -- Counting CTL -- Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems -- Verification -- Toward a Compositional Theory of Leftist Grammars and Transformations -- Degrees of Lookahead in Regular Infinite Games -- Reachability Analysis of Communicating Pushdown Systems -- The Complexity of Synchronous Notions of Information Flow Security -- Categorical and Coalgebraic Methods -- Monads Need Not Be Endofunctors -- CIA Structures and the Semantics of Recursion -- Coalgebraic Correspondence Theory -- Lambda Calculus and Types -- Untyped Recursion Schemes and Infinite Intersection Types -- Solvability in Resource Lambda-Calculus -- A Hierarchy for Delimited Continuations in Call-by-Name.
|
| 650 |
|
0 |
|a Logic design
|
| 650 |
|
0 |
|a Computer Science
|
| 650 |
|
0 |
|a Computer science
|
| 650 |
|
0 |
|a Software engineering
|
| 650 |
|
0 |
|a Compilers (Computer programs).
|
| 650 |
|
0 |
|a Machine theory.
|
| 655 |
|
7 |
|a Konferenzschrift
|y 2010
|z Paphos, Ktima
|0 (DE-588)1071861417
|0 (DE-627)826484824
|0 (DE-576)433375485
|2 gnd-content
|
| 689 |
0 |
0 |
|D s
|0 (DE-588)4196735-5
|0 (DE-627)105201693
|0 (DE-576)210109750
|a Theoretische Informatik
|2 gnd
|
| 689 |
0 |
|
|5 DE-101
|
| 689 |
1 |
0 |
|D s
|0 (DE-588)4076370-5
|0 (DE-627)106083031
|0 (DE-576)20920169X
|a Programmierung
|2 gnd
|
| 689 |
1 |
|
|5 DE-101
|
| 689 |
2 |
0 |
|D s
|0 (DE-588)4116521-4
|0 (DE-627)104616377
|0 (DE-576)20950224X
|a Software Engineering
|2 gnd
|
| 689 |
2 |
|
|5 DE-101
|
| 776 |
1 |
|
|z 9783642120312
|
| 776 |
0 |
8 |
|i Buchausg. u.d.T.
|t Foundations of software science and computational structures
|d Berlin : Springer, 2010
|h XV, 388 S.
|w (DE-627)619692499
|w (DE-576)321095723
|z 3642120318
|z 9783642120312
|
| 830 |
|
0 |
|a Lecture notes in computer science
|v 6014
|9 6014
|w (DE-627)316228877
|w (DE-576)093890923
|w (DE-600)2018930-8
|x 1611-3349
|7 ns
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-12032-9
|m X:SPRINGER
|x Verlag
|z lizenzpflichtig
|3 Volltext
|
| 856 |
4 |
2 |
|u https://zbmath.org/?q=an:1185.68013
|m B:ZBM
|v 2021-04-12
|x Verlag
|y Zentralblatt MATH
|3 Inhaltstext
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|b 2010
|
| 912 |
|
|
|a ZDB-2-SEB
|
| 912 |
|
|
|a ZDB-2-SCS
|b 2010
|
| 912 |
|
|
|a ZDB-2-SXCS
|b 2010
|
| 912 |
|
|
|a ZDB-2-SEB
|b 2010
|
| 936 |
r |
v |
|a SS 4800
|b Lecture notes in computer science
|k Informatik
|k Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen
|k Schriftenreihen (indiv. Sign.)
|k Lecture notes in computer science
|0 (DE-627)1271461242
|0 (DE-625)rvk/143528:
|0 (DE-576)201461242
|
| 936 |
b |
k |
|a 54.52
|j Software engineering
|q SEPA
|0 (DE-627)106418882
|
| 936 |
b |
k |
|a 54.10
|j Theoretische Informatik
|q SEPA
|0 (DE-627)106418815
|
| 951 |
|
|
|a BO
|
| 950 |
|
|
|a Software-Engineering
|
| 950 |
|
|
|a Softwaretechnologie
|
| 950 |
|
|
|a Softwaretechnik
|
| 950 |
|
|
|a Softwareentwicklung
|
| 950 |
|
|
|a Informatik
|
| 950 |
|
|
|a Theorie
|
| 950 |
|
|
|a Computer
|
| 950 |
|
|
|a Programmierung
|
| 950 |
|
|
|a Computerprogrammierung
|
| 950 |
|
|
|a Programmieren
|
| 950 |
|
|
|a Programmiertechnik
|
| 950 |
|
|
|a Datenverarbeitung
|
| 950 |
|
|
|a Программирование
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-12032-9
|9 DE-14
|
| 852 |
|
|
|a DE-14
|z 2011-07-20T14:58:25Z
|x epn:3332237802
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-12032-9
|9 DE-15
|
| 852 |
|
|
|a DE-15
|z 2011-05-16T16:34:36Z
|x epn:3332237853
|
| 976 |
|
|
|h Elektronischer Volltext - Campuslizenz
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-12032-9
|z Zum Online-Dokument
|9 DE-Zi4
|
| 852 |
|
|
|a DE-Zi4
|z 2011-01-26T14:28:50Z
|x epn:3332237950
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-12032-9
|9 DE-520
|
| 852 |
|
|
|a DE-520
|z 2012-11-10T03:09:15Z
|x epn:3332238000
|
| 980 |
|
|
|a 1649077270
|b 0
|k 1649077270
|o 322305241
|
SOLR
| _version_ |
1789363402367303680 |
| access_facet |
Electronic Resources |
| author |
Ong, Luke |
| author_facet |
Ong, Luke |
| author_role |
aut |
| author_sort |
Ong, Luke |
| author_variant |
l o lo |
| callnumber-first |
Q - Science |
| callnumber-label |
QA8 |
| callnumber-raw |
QA8.9-QA10.3 |
| callnumber-search |
QA8.9-QA10.3 |
| callnumber-sort |
QA 18.9 Q A10 13 |
| callnumber-subject |
QA - Mathematics |
| collection |
ZDB-2-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS |
| contents |
FoSSaCS 2010 Invited Talk -- to Decidability of Higher-Order Matching -- Semantics of Programming Languages -- A Semantic Foundation for Hidden State -- Linearly-Used Continuations in the Enriched Effect Calculus -- Block Structure vs. Scope Extrusion: Between Innocence and Omniscience -- Completeness for Algebraic Theories of Local State -- Probabilistic and Randomised Computation -- Fair Adversaries and Randomization in Two-Player Games -- Retaining the Probabilities in Probabilistic Testing Theory -- Concurrency and Process Theory -- Forward Analysis of Depth-Bounded Processes -- Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization -- Parameterised Multiparty Session Types -- On the Relationship between Spatial Logics and Behavioral Simulations -- Modal and Temporal Logics -- An Easy Completeness Proof for the Modal ?-Calculus on Finite Trees -- When Model-Checking Freeze LTL over Counter Machines Becomes Decidable -- Model Checking Is Static Analysis of Modal Logic -- Counting CTL -- Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems -- Verification -- Toward a Compositional Theory of Leftist Grammars and Transformations -- Degrees of Lookahead in Regular Infinite Games -- Reachability Analysis of Communicating Pushdown Systems -- The Complexity of Synchronous Notions of Information Flow Security -- Categorical and Coalgebraic Methods -- Monads Need Not Be Endofunctors -- CIA Structures and the Semantics of Recursion -- Coalgebraic Correspondence Theory -- Lambda Calculus and Types -- Untyped Recursion Schemes and Infinite Intersection Types -- Solvability in Resource Lambda-Calculus -- A Hierarchy for Delimited Continuations in Call-by-Name. |
| ctrlnum |
(DE-627)1649077270, (DE-576)322305241, (DE-599)BSZ322305241, (OCoLC)643270216, (ZBM)1185.68013, (DE-He213)978-3-642-12032-9, (EBP)04051627X |
| de15_date |
2011-05-16T16:34:36Z |
| doi_str_mv |
10.1007/978-3-642-12032-9 |
| era_facet |
2010 |
| facet_912a |
ZDB-2-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS |
| facet_avail |
Online |
| facet_local_del330 |
Theoretische Informatik, Programmierung, Software Engineering |
| finc_class_facet |
Informatik, Mathematik |
| finc_id_str |
0000857939 |
| fincclass_txtF_mv |
science-computerscience |
| format |
eBook, ConferenceProceedings |
| format_access_txtF_mv |
Book, E-Book |
| format_de105 |
Ebook |
| format_de14 |
Book, E-Book |
| format_de15 |
Book, E-Book |
| format_del152 |
Buch |
| format_detail_txtF_mv |
text-online-monograph-independent-conference |
| format_dezi4 |
e-Book |
| format_finc |
Book, E-Book |
| format_legacy |
ElectronicBook |
| format_legacy_nrw |
Book, E-Book |
| format_nrw |
Book, E-Book |
| format_strict_txtF_mv |
E-Book |
| genre |
Konferenzschrift 2010 Paphos, Ktima (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content |
| genre_facet |
Konferenzschrift |
| geogr_code |
not assigned |
| geogr_code_person |
not assigned |
| geographic_facet |
Paphos, Ktima |
| hierarchy_parent_id |
0-316228877 |
| hierarchy_parent_title |
Lecture notes in computer science |
| hierarchy_sequence |
6014 |
| hierarchy_top_id |
0-316228877 |
| hierarchy_top_title |
Lecture notes in computer science |
| id |
0-1649077270 |
| illustrated |
Not Illustrated |
| imprint |
Berlin, Heidelberg, Springer Berlin Heidelberg, 2010 |
| imprint_str_mv |
Berlin, Heidelberg: Springer Berlin Heidelberg, 2010 |
| institution |
DE-14, DE-Zi4, DE-520, DE-15 |
| is_hierarchy_id |
0-1649077270 |
| is_hierarchy_title |
Foundations of Software Science and Computational Structures: 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings |
| isbn |
9783642120329 |
| isbn_isn_mv |
9783642120312, 3642120318 |
| issn_isn_mv |
1611-3349 |
| kxp_id_str |
1649077270 |
| language |
English |
| last_indexed |
2024-01-28T19:25:19.176Z |
| local_heading_facet_dezwi2 |
Logic design, Computer Science, Computer science, Software engineering, Compilers (Computer programs)., Machine theory., Theoretische Informatik, Programmierung, Software Engineering |
| marc024a_ct_mv |
10.1007/978-3-642-12032-9 |
| match_str |
ong2010foundationsofsoftwarescienceandcomputationalstructures13thinternationalconferencefossacs2010heldaspartofthejointeuropeanconferencesontheoryandpracticeofsoftwareetaps2010paphoscyprusmarch20282010proceedings |
| mega_collection |
Verbunddaten SWB |
| multipart_link |
093890923 |
| multipart_part |
(093890923)6014 |
| oclc_num |
643270216 |
| physical |
Online-Ressource (XV, 389p. 47 illus, digital) |
| publishDate |
2010 |
| publishDateSort |
2010 |
| publishPlace |
Berlin, Heidelberg |
| publisher |
Springer Berlin Heidelberg |
| record_format |
marcfinc |
| record_id |
322305241 |
| recordtype |
marcfinc |
| rsn_id_str_mv |
(DE-15)2459785 |
| rvk_facet |
SS 4800 |
| rvk_label |
Informatik, Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen, Schriftenreihen (indiv. Sign.), Lecture notes in computer science |
| rvk_path |
SS, SQ - SU, SS 4000 - SS 5999, SS 4800 |
| rvk_path_str_mv |
SS, SQ - SU, SS 4000 - SS 5999, SS 4800 |
| series |
Lecture notes in computer science, 6014 |
| series2 |
Lecture Notes in Computer Science ; 6014, SpringerLink ; Bücher |
| source_id |
0 |
| spelling |
Ong, Luke aut, Foundations of Software Science and Computational Structures 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings edited by Luke Ong, Berlin, Heidelberg Springer Berlin Heidelberg 2010, Online-Ressource (XV, 389p. 47 illus, digital), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, Lecture Notes in Computer Science 6014, SpringerLink Bücher, FoSSaCS 2010 Invited Talk -- to Decidability of Higher-Order Matching -- Semantics of Programming Languages -- A Semantic Foundation for Hidden State -- Linearly-Used Continuations in the Enriched Effect Calculus -- Block Structure vs. Scope Extrusion: Between Innocence and Omniscience -- Completeness for Algebraic Theories of Local State -- Probabilistic and Randomised Computation -- Fair Adversaries and Randomization in Two-Player Games -- Retaining the Probabilities in Probabilistic Testing Theory -- Concurrency and Process Theory -- Forward Analysis of Depth-Bounded Processes -- Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization -- Parameterised Multiparty Session Types -- On the Relationship between Spatial Logics and Behavioral Simulations -- Modal and Temporal Logics -- An Easy Completeness Proof for the Modal ?-Calculus on Finite Trees -- When Model-Checking Freeze LTL over Counter Machines Becomes Decidable -- Model Checking Is Static Analysis of Modal Logic -- Counting CTL -- Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems -- Verification -- Toward a Compositional Theory of Leftist Grammars and Transformations -- Degrees of Lookahead in Regular Infinite Games -- Reachability Analysis of Communicating Pushdown Systems -- The Complexity of Synchronous Notions of Information Flow Security -- Categorical and Coalgebraic Methods -- Monads Need Not Be Endofunctors -- CIA Structures and the Semantics of Recursion -- Coalgebraic Correspondence Theory -- Lambda Calculus and Types -- Untyped Recursion Schemes and Infinite Intersection Types -- Solvability in Resource Lambda-Calculus -- A Hierarchy for Delimited Continuations in Call-by-Name., Logic design, Computer Science, Computer science, Software engineering, Compilers (Computer programs)., Machine theory., Konferenzschrift 2010 Paphos, Ktima (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content, s (DE-588)4196735-5 (DE-627)105201693 (DE-576)210109750 Theoretische Informatik gnd, DE-101, s (DE-588)4076370-5 (DE-627)106083031 (DE-576)20920169X Programmierung gnd, s (DE-588)4116521-4 (DE-627)104616377 (DE-576)20950224X Software Engineering gnd, 9783642120312, Buchausg. u.d.T. Foundations of software science and computational structures Berlin : Springer, 2010 XV, 388 S. (DE-627)619692499 (DE-576)321095723 3642120318 9783642120312, Lecture notes in computer science 6014 6014 (DE-627)316228877 (DE-576)093890923 (DE-600)2018930-8 1611-3349 ns, https://doi.org/10.1007/978-3-642-12032-9 X:SPRINGER Verlag lizenzpflichtig Volltext, https://zbmath.org/?q=an:1185.68013 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext, http://dx.doi.org/10.1007/978-3-642-12032-9 DE-14, DE-14 2011-07-20T14:58:25Z epn:3332237802, http://dx.doi.org/10.1007/978-3-642-12032-9 DE-15, DE-15 2011-05-16T16:34:36Z epn:3332237853, http://dx.doi.org/10.1007/978-3-642-12032-9 Zum Online-Dokument DE-Zi4, DE-Zi4 2011-01-26T14:28:50Z epn:3332237950, http://dx.doi.org/10.1007/978-3-642-12032-9 DE-520, DE-520 2012-11-10T03:09:15Z epn:3332238000 |
| spellingShingle |
Ong, Luke, Foundations of Software Science and Computational Structures: 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings, Lecture notes in computer science, 6014, FoSSaCS 2010 Invited Talk -- to Decidability of Higher-Order Matching -- Semantics of Programming Languages -- A Semantic Foundation for Hidden State -- Linearly-Used Continuations in the Enriched Effect Calculus -- Block Structure vs. Scope Extrusion: Between Innocence and Omniscience -- Completeness for Algebraic Theories of Local State -- Probabilistic and Randomised Computation -- Fair Adversaries and Randomization in Two-Player Games -- Retaining the Probabilities in Probabilistic Testing Theory -- Concurrency and Process Theory -- Forward Analysis of Depth-Bounded Processes -- Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization -- Parameterised Multiparty Session Types -- On the Relationship between Spatial Logics and Behavioral Simulations -- Modal and Temporal Logics -- An Easy Completeness Proof for the Modal ?-Calculus on Finite Trees -- When Model-Checking Freeze LTL over Counter Machines Becomes Decidable -- Model Checking Is Static Analysis of Modal Logic -- Counting CTL -- Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems -- Verification -- Toward a Compositional Theory of Leftist Grammars and Transformations -- Degrees of Lookahead in Regular Infinite Games -- Reachability Analysis of Communicating Pushdown Systems -- The Complexity of Synchronous Notions of Information Flow Security -- Categorical and Coalgebraic Methods -- Monads Need Not Be Endofunctors -- CIA Structures and the Semantics of Recursion -- Coalgebraic Correspondence Theory -- Lambda Calculus and Types -- Untyped Recursion Schemes and Infinite Intersection Types -- Solvability in Resource Lambda-Calculus -- A Hierarchy for Delimited Continuations in Call-by-Name., Logic design, Computer Science, Computer science, Software engineering, Compilers (Computer programs)., Machine theory., Konferenzschrift 2010 Paphos, Ktima, Theoretische Informatik, Programmierung, Software Engineering |
| swb_id_str |
322305241 |
| title |
Foundations of Software Science and Computational Structures: 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings |
| title_auth |
Foundations of Software Science and Computational Structures 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings |
| title_full |
Foundations of Software Science and Computational Structures 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings edited by Luke Ong |
| title_fullStr |
Foundations of Software Science and Computational Structures 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings edited by Luke Ong |
| title_full_unstemmed |
Foundations of Software Science and Computational Structures 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings edited by Luke Ong |
| title_in_hierarchy |
6014. Foundations of Software Science and Computational Structures: 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings (2010) |
| title_short |
Foundations of Software Science and Computational Structures |
| title_sort |
foundations of software science and computational structures 13th international conference fossacs 2010 held as part of the joint european conferences on theory and practice of software etaps 2010 paphos cyprus march 20 28 2010 proceedings |
| title_sub |
13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings |
| title_unstemmed |
Foundations of Software Science and Computational Structures: 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings |
| topic |
Logic design, Computer Science, Computer science, Software engineering, Compilers (Computer programs)., Machine theory., Konferenzschrift 2010 Paphos, Ktima, Theoretische Informatik, Programmierung, Software Engineering |
| topic_facet |
Logic design, Computer Science, Computer science, Software engineering, Compilers (Computer programs)., Machine theory., Konferenzschrift, Theoretische Informatik, Programmierung, Software Engineering |
| url |
https://doi.org/10.1007/978-3-642-12032-9, https://zbmath.org/?q=an:1185.68013, http://dx.doi.org/10.1007/978-3-642-12032-9 |
