Foundations of Software Science and Computation Structures

Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/558

Full metadata record

DC Field	Value	Language
dc.contributor.author	Baier, Christel. ;	en_US
dc.contributor.author	Dal Lago, Ugo. ;	en_US
dc.date.accessioned	2013	en_US
dc.date.accessioned	2020-05-17T08:18:51Z	-
dc.date.available	2020-05-17T08:18:51Z	-
dc.date.issued	2018	en_US
dc.identifier.isbn	9783319893662 ;	en_US
dc.identifier.isbn	9783319893655 (print) ;	en_US
dc.identifier.uri	http://localhost/handle/Hannan/558	-
dc.description	SpringerLink (Online service) ;	en_US
dc.description		en_US
dc.description	Printed edition: ; 9783319893655. ;	en_US
dc.description		en_US
dc.description		en_US
dc.description		en_US
dc.description.abstract	This book is Open Access under a CC BY licence. ;	en_US
dc.description.statementofresponsibility	edited by Christel Baier, Ugo Dal Lago.	en_US
dc.description.tableofcontents	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. ;	en_US
dc.format.extent	XV, 583 p. 75 illus. ; online resource. ;	en_US
dc.publisher	Springer International Publishing :	en_US
dc.publisher	Imprint: Springer,	en_US
dc.relation.ispartofseries	Lecture Notes in Computer Science, ; 0302-9743 ; ; 10803. ;	en_US
dc.relation.ispartofseries	Lecture Notes in Computer Science, ; 0302-9743 ; ; 10803. ;	en_US
dc.relation.haspart	9783319893662.pdf	en_US
dc.subject	Computer Science	en_US
dc.subject	Computer system failures. ;	en_US
dc.subject	Software Engineering	en_US
dc.subject	Computer logic. ;	en_US
dc.subject	Computer Science and Mathematics	en_US
dc.subject	Artificial Intelligence	en_US
dc.subject	Computers	en_US
dc.subject	Computer Science	en_US
dc.subject	Logics and Meanings of Programs. ;	en_US
dc.subject	Software Engineering/Programming and Operating Systems. ;	en_US
dc.subject	Artificial Intelligence and Robotics	en_US
dc.subject	System Performance and Evaluation. ;	en_US
dc.subject	The Computing Profession. ;	en_US
dc.subject	Discrete Mathematics in Computer Science. ;	en_US
dc.subject.ddc	005.1015113 ; 23 ;	en_US
dc.subject.lcc	QA76.63 ;	en_US
dc.title	Foundations of Software Science and Computation Structures	en_US
dc.title.alternative	21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14ee20, 2018. Proceedings /	en_US
dc.type	Book	en_US
dc.publisher.place	Cham :	en_US
Appears in Collections:	مدیریت فناوری اطلاعات

Files in This Item:

File	Description	Size	Format
9783319893662.pdf		17.4 MB	Adobe PDF	Preview File

Full metadata record

DC Field	Value	Language
dc.contributor.author	Baier, Christel. ;	en_US
dc.contributor.author	Dal Lago, Ugo. ;	en_US
dc.date.accessioned	2013	en_US
dc.date.accessioned	2020-05-17T08:18:51Z	-
dc.date.available	2020-05-17T08:18:51Z	-
dc.date.issued	2018	en_US
dc.identifier.isbn	9783319893662 ;	en_US
dc.identifier.isbn	9783319893655 (print) ;	en_US
dc.identifier.uri	http://localhost/handle/Hannan/558	-
dc.description	SpringerLink (Online service) ;	en_US
dc.description		en_US
dc.description	Printed edition: ; 9783319893655. ;	en_US
dc.description		en_US
dc.description		en_US
dc.description		en_US
dc.description.abstract	This book is Open Access under a CC BY licence. ;	en_US
dc.description.statementofresponsibility	edited by Christel Baier, Ugo Dal Lago.	en_US
dc.description.tableofcontents	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. ;	en_US
dc.format.extent	XV, 583 p. 75 illus. ; online resource. ;	en_US
dc.publisher	Springer International Publishing :	en_US
dc.publisher	Imprint: Springer,	en_US
dc.relation.ispartofseries	Lecture Notes in Computer Science, ; 0302-9743 ; ; 10803. ;	en_US
dc.relation.ispartofseries	Lecture Notes in Computer Science, ; 0302-9743 ; ; 10803. ;	en_US
dc.relation.haspart	9783319893662.pdf	en_US
dc.subject	Computer Science	en_US
dc.subject	Computer system failures. ;	en_US
dc.subject	Software Engineering	en_US
dc.subject	Computer logic. ;	en_US
dc.subject	Computer Science and Mathematics	en_US
dc.subject	Artificial Intelligence	en_US
dc.subject	Computers	en_US
dc.subject	Computer Science	en_US
dc.subject	Logics and Meanings of Programs. ;	en_US
dc.subject	Software Engineering/Programming and Operating Systems. ;	en_US
dc.subject	Artificial Intelligence and Robotics	en_US
dc.subject	System Performance and Evaluation. ;	en_US
dc.subject	The Computing Profession. ;	en_US
dc.subject	Discrete Mathematics in Computer Science. ;	en_US
dc.subject.ddc	005.1015113 ; 23 ;	en_US
dc.subject.lcc	QA76.63 ;	en_US
dc.title	Foundations of Software Science and Computation Structures	en_US
dc.title.alternative	21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14ee20, 2018. Proceedings /	en_US
dc.type	Book	en_US
dc.publisher.place	Cham :	en_US
Appears in Collections:	مدیریت فناوری اطلاعات

Files in This Item:

File	Description	Size	Format
9783319893662.pdf		17.4 MB	Adobe PDF	Preview File

Full metadata record

DC Field	Value	Language
dc.contributor.author	Baier, Christel. ;	en_US
dc.contributor.author	Dal Lago, Ugo. ;	en_US
dc.date.accessioned	2013	en_US
dc.date.accessioned	2020-05-17T08:18:51Z	-
dc.date.available	2020-05-17T08:18:51Z	-
dc.date.issued	2018	en_US
dc.identifier.isbn	9783319893662 ;	en_US
dc.identifier.isbn	9783319893655 (print) ;	en_US
dc.identifier.uri	http://localhost/handle/Hannan/558	-
dc.description	SpringerLink (Online service) ;	en_US
dc.description		en_US
dc.description	Printed edition: ; 9783319893655. ;	en_US
dc.description		en_US
dc.description		en_US
dc.description		en_US
dc.description.abstract	This book is Open Access under a CC BY licence. ;	en_US
dc.description.statementofresponsibility	edited by Christel Baier, Ugo Dal Lago.	en_US
dc.description.tableofcontents	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. ;	en_US
dc.format.extent	XV, 583 p. 75 illus. ; online resource. ;	en_US
dc.publisher	Springer International Publishing :	en_US
dc.publisher	Imprint: Springer,	en_US
dc.relation.ispartofseries	Lecture Notes in Computer Science, ; 0302-9743 ; ; 10803. ;	en_US
dc.relation.ispartofseries	Lecture Notes in Computer Science, ; 0302-9743 ; ; 10803. ;	en_US
dc.relation.haspart	9783319893662.pdf	en_US
dc.subject	Computer Science	en_US
dc.subject	Computer system failures. ;	en_US
dc.subject	Software Engineering	en_US
dc.subject	Computer logic. ;	en_US
dc.subject	Computer Science and Mathematics	en_US
dc.subject	Artificial Intelligence	en_US
dc.subject	Computers	en_US
dc.subject	Computer Science	en_US
dc.subject	Logics and Meanings of Programs. ;	en_US
dc.subject	Software Engineering/Programming and Operating Systems. ;	en_US
dc.subject	Artificial Intelligence and Robotics	en_US
dc.subject	System Performance and Evaluation. ;	en_US
dc.subject	The Computing Profession. ;	en_US
dc.subject	Discrete Mathematics in Computer Science. ;	en_US
dc.subject.ddc	005.1015113 ; 23 ;	en_US
dc.subject.lcc	QA76.63 ;	en_US
dc.title	Foundations of Software Science and Computation Structures	en_US
dc.title.alternative	21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14ee20, 2018. Proceedings /	en_US
dc.type	Book	en_US
dc.publisher.place	Cham :	en_US
Appears in Collections:	مدیریت فناوری اطلاعات

Files in This Item:

File	Description	Size	Format
9783319893662.pdf		17.4 MB	Adobe PDF	Preview File