東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Foundations of software science and ...

FOSSACS (Conference) (2018 :)

FindBook

Google Book

Amazon

博客來

Foundations of software science and computation structures = 21st International Conference, FOSSACS 2018, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Foundations of software science and computation structures/ edited by Christel Baier, Ugo Dal Lago.
其他題名:	21st International Conference, FOSSACS 2018, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018 : proceedings /
其他題名:	FOSSACS 2018
其他作者:	Baier, Christel.
團體作者:	FOSSACS (Conference)
出版者:	Cham :Springer International Publishing : : 2018.,
面頁冊數:	xv, 583 p. :ill., digital ;24 cm.
內容註:	Semantics -- Non-angelic Concurrent Game Semantics -- A Trace Semantics for System F Parametric Polymorphism -- Categorical Combinatorics for Non Deterministic Strategies on Simple Games -- A Syntactic View of Computational Adequacy -- Linearity -- A New Linear Logic for Deadlock-Free Session-Typed Processes -- A Double Category Theoretic Analysis of Graded Linear Exponential Comonads -- Depending on Session-Typed Processes -- FabULous Interoperability for ML and a Linear Language -- Concurrency -- Automata for True Concurrency Properties -- A Theory of Encodings and Expressiveness -- A Framework for Parameterized Monitorability -- Logics for Bisimulation and Divergence -- Lambda-Calculi and Types -- Call-by-need, Neededness and All That -- Fitch-Style Modal Lambda Calculi -- Realizability Interpretation and Normalization of Typed Call-by-Need -- Quotient Inductive-Inductive Types -- Category Theory and Quantum Control -- Guarded Traced Categories -- Proper Semirings and Proper Convex Functors -- From Symmetric Pattern-Matching to Quantum Control -- Quantitative Models -- The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes -- A Hierarchy of Scheduler Classes for Stochastic Automata -- Symbolically Quantifying Response Time in Stochastic Models using Moments and Semirings -- Comparator Automata in Quantitative Verification -- Logics and Equational Theories -- Modular Tableaux Calculi for Separation Theories -- Differential Calculus with Imprecise Input and its Logical Framework -- The Effects of Adding Reachability Predicates in Propositional Separation Logic -- The Equational Theory of the Natural Join and of Inner Union is Decidable -- Graphs and Automata -- Minimization of Graph Weighted Models over Circular Strings -- Games on Graphs with a Public Signal Monitoring -- WQO Dichotomy for 3-Graphs -- Verifying Higher-Order Functions with Tree Automata.
Contained By:	Springer eBooks
標題:	Computer software - Congresses. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-89366-2
ISBN:	9783319893662

Foundations of software science and computation structures = 21st International Conference, FOSSACS 2018, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018 : proceedings /
Foundations of software science and computation structures21st International Conference, FOSSACS 2018, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018 : proceedings /[electronic resource] :FOSSACS 2018edited by Christel Baier, Ugo Dal Lago. - Cham :Springer International Publishing :2018. - xv, 583 p. :ill., digital ;24 cm. - Lecture notes in computer science,108030302-9743 ;. - Lecture notes in computer science ;10803..

Semantics -- Non-angelic Concurrent Game Semantics -- A Trace Semantics for System F Parametric Polymorphism -- Categorical Combinatorics for Non Deterministic Strategies on Simple Games -- A Syntactic View of Computational Adequacy -- Linearity -- A New Linear Logic for Deadlock-Free Session-Typed Processes -- A Double Category Theoretic Analysis of Graded Linear Exponential Comonads -- Depending on Session-Typed Processes -- FabULous Interoperability for ML and a Linear Language -- Concurrency -- Automata for True Concurrency Properties -- A Theory of Encodings and Expressiveness -- A Framework for Parameterized Monitorability -- Logics for Bisimulation and Divergence -- Lambda-Calculi and Types -- Call-by-need, Neededness and All That -- Fitch-Style Modal Lambda Calculi -- Realizability Interpretation and Normalization of Typed Call-by-Need -- Quotient Inductive-Inductive Types -- Category Theory and Quantum Control -- Guarded Traced Categories -- Proper Semirings and Proper Convex Functors -- From Symmetric Pattern-Matching to Quantum Control -- Quantitative Models -- The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes -- A Hierarchy of Scheduler Classes for Stochastic Automata -- Symbolically Quantifying Response Time in Stochastic Models using Moments and Semirings -- Comparator Automata in Quantitative Verification -- Logics and Equational Theories -- Modular Tableaux Calculi for Separation Theories -- Differential Calculus with Imprecise Input and its Logical Framework -- The Effects of Adding Reachability Predicates in Propositional Separation Logic -- The Equational Theory of the Natural Join and of Inner Union is Decidable -- Graphs and Automata -- Minimization of Graph Weighted Models over Circular Strings -- Games on Graphs with a Public Signal Monitoring -- WQO Dichotomy for 3-Graphs -- Verifying Higher-Order Functions with Tree Automata.

Open access.

This book is Open Access under a CC BY licence.

ISBN: 9783319893662

Standard No.: 10.1007/978-3-319-89366-2doiSubjects--Topical Terms:

696751
Computer software
--Congresses.

LC Class. No.: QA76.751 / .F67 2018

Dewey Class. No.: 005.1

Foundations of software science and computation structures = 21st International Conference, FOSSACS 2018, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018 : proceedings /
LDR:03342nmm a2200385 a 4500 001 2142022
003 DE-He213
005 20180414015650.0
006 m d
007 cr nn 008maaau
008 181214s2018 gw s 0 eng d
020 $a 9783319893662 $q (electronic bk.)
020 $a 9783319893655 $q (paper)
024 7 $a 10.1007/978-3-319-89366-2 $2 doi
035 $a 978-3-319-89366-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.751 $b .F67 2018
072 7 $a UM $2 bicssc
072 7 $a UYF $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a COM036000 $2 bisacsh
082 0 4 $a 005.1 $2 23
090 $a QA76.751 $b .F751 2018
111 2 $a FOSSACS (Conference) $n (21st : $d 2018 : $c Thessalonike, Greece) $3 3321266
245 1 0 $a Foundations of software science and computation structures $h [electronic resource] : $b 21st International Conference, FOSSACS 2018, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018 : proceedings / $c edited by Christel Baier, Ugo Dal Lago.
246 3 $a FOSSACS 2018
246 3 $a ETAPS 2018
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xv, 583 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10803
505 0 $a Semantics -- Non-angelic Concurrent Game Semantics -- A Trace Semantics for System F Parametric Polymorphism -- Categorical Combinatorics for Non Deterministic Strategies on Simple Games -- A Syntactic View of Computational Adequacy -- Linearity -- A New Linear Logic for Deadlock-Free Session-Typed Processes -- A Double Category Theoretic Analysis of Graded Linear Exponential Comonads -- Depending on Session-Typed Processes -- FabULous Interoperability for ML and a Linear Language -- Concurrency -- Automata for True Concurrency Properties -- A Theory of Encodings and Expressiveness -- A Framework for Parameterized Monitorability -- Logics for Bisimulation and Divergence -- Lambda-Calculi and Types -- Call-by-need, Neededness and All That -- Fitch-Style Modal Lambda Calculi -- Realizability Interpretation and Normalization of Typed Call-by-Need -- Quotient Inductive-Inductive Types -- Category Theory and Quantum Control -- Guarded Traced Categories -- Proper Semirings and Proper Convex Functors -- From Symmetric Pattern-Matching to Quantum Control -- Quantitative Models -- The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes -- A Hierarchy of Scheduler Classes for Stochastic Automata -- Symbolically Quantifying Response Time in Stochastic Models using Moments and Semirings -- Comparator Automata in Quantitative Verification -- Logics and Equational Theories -- Modular Tableaux Calculi for Separation Theories -- Differential Calculus with Imprecise Input and its Logical Framework -- The Effects of Adding Reachability Predicates in Propositional Separation Logic -- The Equational Theory of the Natural Join and of Inner Union is Decidable -- Graphs and Automata -- Minimization of Graph Weighted Models over Circular Strings -- Games on Graphs with a Public Signal Monitoring -- WQO Dichotomy for 3-Graphs -- Verifying Higher-Order Functions with Tree Automata.
506 $a Open access.
520 $a This book is Open Access under a CC BY licence.
650 0 $a Computer software $x Congresses. $3 696751
650 0 $a Software engineering $x Congresses. $3 696781
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Logics and Meanings of Programs. $3 892495
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 891214
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 890894
650 2 4 $a System Performance and Evaluation. $3 891353
650 2 4 $a The Computing Profession. $3 895946
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
700 1 $a Baier, Christel. $3 926242
700 1 $a Dal Lago, Ugo. $3 2108798
710 2 $a SpringerLink (Online service) $3 836513
711 2 $a ETAPS (Conference) $n (21st : $d 2018 : $c Thessalonike, Greece) $3 3308053
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 10803. $3 3321267
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-89366-2
950 $a Computer Science (Springer-11645)