東華大學圖書館 |

Foundations of software science and computation structures = 19th International Conference, FOSSACS 2016, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, the Netherlands, April 2-8, 2016 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Foundations of software science and computation structures/ edited by Bart Jacobs, Christof Loding.
Reminder of title:	19th International Conference, FOSSACS 2016, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, the Netherlands, April 2-8, 2016 : proceedings /
remainder title:	FOSSACS 2016
other author:	Jacobs, Bart.
Published:	Berlin, Heidelberg :Springer Berlin Heidelberg : : 2016.,
Description:	xi, 550 p. :ill., digital ;24 cm.
[NT 15003449]:	Types -- Comprehensive parametric polymorphism: categorical models and type theory -- Guarded Dependent Type Theory with Coinductive Types -- Dependent Types and Fibred Computational Effects -- Game Semantics for Bounded Polymorphism -- Recursion and Fixed-Points Join Inverse Categories as Models of Reversible Recursion -- A Coalgebraic View of Bar Recursion and Bar Induction -- A New Foundation for Finitary Corecursion -- Fixed-point elimination in the Intuitionistic Propositional Calculus -- Verification and Program Analysis. A Theory of Monitors -- Contextual approximation and higher-order procedures -- A Theory of Slicing for Probabilistic Control Flow Graphs -- Verification of parameterized communicating automata via split-width -- Automata, Logic, Games - Robust Equilibria in Mean-Payoff Games -- Quantifier Alternation for Infinite Words -- Synchronizing automata over nested words -- On Freeze LTL with Ordered Attributes -- Regular transformations of data words through origin information -- Probabilistic and Timed Systems - Trace Refinement in Labelled Markov Decision Processes -- Qualitative Analysis of VASS-Induced MDPs -- Metric Temporal Logic with Counting -- Distributed Synthesis in Continuous Time -- Proof Theory and Lambda Calculus Unary Resolution: Characterizing Ptime -- Focused and Synthetic Nested Sequents -- Strong Normalizability as a Finiteness Structure via the Taylor Expansion of lambda-terms -- Reasoning about call-by-need by means of types -- Algorithms for Infinite Systems Coverability Trees for Petri Nets with Unordered Data -- Shortest paths in one-counter systems -- The Invariance Problem for Matrix Semigroups -- Order-Sorted Rewriting and Congruence Closure -- Monads -- Towards a formal theory of graded monads -- Profinite Monads, Profinite Equations, and Reiterman's Theorem.
Contained By:	Springer eBooks
Subject:	Computer software -
Online resource:	http://dx.doi.org/10.1007/978-3-662-49630-5
ISBN:	9783662496305

Foundations of software science and computation structures = 19th International Conference, FOSSACS 2016, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, the Netherlands, April 2-8, 2016 : proceedings /
Foundations of software science and computation structures19th International Conference, FOSSACS 2016, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, the Netherlands, April 2-8, 2016 : proceedings /[electronic resource] :FOSSACS 2016edited by Bart Jacobs, Christof Loding. - Berlin, Heidelberg :Springer Berlin Heidelberg :2016. - xi, 550 p. :ill., digital ;24 cm. - Lecture notes in computer science,96340302-9743 ;. - Lecture notes in computer science ;5353..

Types -- Comprehensive parametric polymorphism: categorical models and type theory -- Guarded Dependent Type Theory with Coinductive Types -- Dependent Types and Fibred Computational Effects -- Game Semantics for Bounded Polymorphism -- Recursion and Fixed-Points Join Inverse Categories as Models of Reversible Recursion -- A Coalgebraic View of Bar Recursion and Bar Induction -- A New Foundation for Finitary Corecursion -- Fixed-point elimination in the Intuitionistic Propositional Calculus -- Verification and Program Analysis. A Theory of Monitors -- Contextual approximation and higher-order procedures -- A Theory of Slicing for Probabilistic Control Flow Graphs -- Verification of parameterized communicating automata via split-width -- Automata, Logic, Games - Robust Equilibria in Mean-Payoff Games -- Quantifier Alternation for Infinite Words -- Synchronizing automata over nested words -- On Freeze LTL with Ordered Attributes -- Regular transformations of data words through origin information -- Probabilistic and Timed Systems - Trace Refinement in Labelled Markov Decision Processes -- Qualitative Analysis of VASS-Induced MDPs -- Metric Temporal Logic with Counting -- Distributed Synthesis in Continuous Time -- Proof Theory and Lambda Calculus Unary Resolution: Characterizing Ptime -- Focused and Synthetic Nested Sequents -- Strong Normalizability as a Finiteness Structure via the Taylor Expansion of lambda-terms -- Reasoning about call-by-need by means of types -- Algorithms for Infinite Systems Coverability Trees for Petri Nets with Unordered Data -- Shortest paths in one-counter systems -- The Invariance Problem for Matrix Semigroups -- Order-Sorted Rewriting and Congruence Closure -- Monads -- Towards a formal theory of graded monads -- Profinite Monads, Profinite Equations, and Reiterman's Theorem.

This book constitutes the proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2016, which took place in Eindhoven, The Netherlands, in April 2016, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016. The 31 full papers presented in this volume were carefully reviewed and selected from 85 submissions. They were organized in topical sections named: types; recursion and fixed-points; verification and program analysis; automata, logic, games; probabilistic and timed systems; proof theory and lambda calculus; algorithms for infinite systems; and monads.

ISBN: 9783662496305

Standard No.: 10.1007/978-3-662-49630-5doiSubjects--Topical Terms:

950579
Computer software

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

Dewey Class. No.: 005.1

Foundations of software science and computation structures = 19th International Conference, FOSSACS 2016, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, the Netherlands, April 2-8, 2016 : proceedings /
LDR:03836nmm m2200361 m 4500 001 2032537
003 DE-He213
005 20160913102846.0
006 m d
007 cr nn 008maaau
008 161011s2016 gw s 0 eng d
020 $a 9783662496305 $q (electronic bk.)
020 $a 9783662496299 $q (paper)
024 7 $a 10.1007/978-3-662-49630-5 $2 doi
035 $a 978-3-662-49630-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.751 $b .F67 2016
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 2016
245 1 0 $a Foundations of software science and computation structures $h [electronic resource] : $b 19th International Conference, FOSSACS 2016, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, the Netherlands, April 2-8, 2016 : proceedings / $c edited by Bart Jacobs, Christof Loding.
246 3 $a FOSSACS 2016
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2016.
300 $a xi, 550 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9634
505 0 $a Types -- Comprehensive parametric polymorphism: categorical models and type theory -- Guarded Dependent Type Theory with Coinductive Types -- Dependent Types and Fibred Computational Effects -- Game Semantics for Bounded Polymorphism -- Recursion and Fixed-Points Join Inverse Categories as Models of Reversible Recursion -- A Coalgebraic View of Bar Recursion and Bar Induction -- A New Foundation for Finitary Corecursion -- Fixed-point elimination in the Intuitionistic Propositional Calculus -- Verification and Program Analysis. A Theory of Monitors -- Contextual approximation and higher-order procedures -- A Theory of Slicing for Probabilistic Control Flow Graphs -- Verification of parameterized communicating automata via split-width -- Automata, Logic, Games - Robust Equilibria in Mean-Payoff Games -- Quantifier Alternation for Infinite Words -- Synchronizing automata over nested words -- On Freeze LTL with Ordered Attributes -- Regular transformations of data words through origin information -- Probabilistic and Timed Systems - Trace Refinement in Labelled Markov Decision Processes -- Qualitative Analysis of VASS-Induced MDPs -- Metric Temporal Logic with Counting -- Distributed Synthesis in Continuous Time -- Proof Theory and Lambda Calculus Unary Resolution: Characterizing Ptime -- Focused and Synthetic Nested Sequents -- Strong Normalizability as a Finiteness Structure via the Taylor Expansion of lambda-terms -- Reasoning about call-by-need by means of types -- Algorithms for Infinite Systems Coverability Trees for Petri Nets with Unordered Data -- Shortest paths in one-counter systems -- The Invariance Problem for Matrix Semigroups -- Order-Sorted Rewriting and Congruence Closure -- Monads -- Towards a formal theory of graded monads -- Profinite Monads, Profinite Equations, and Reiterman's Theorem.
520 $a This book constitutes the proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2016, which took place in Eindhoven, The Netherlands, in April 2016, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016. The 31 full papers presented in this volume were carefully reviewed and selected from 85 submissions. They were organized in topical sections named: types; recursion and fixed-points; verification and program analysis; automata, logic, games; probabilistic and timed systems; proof theory and lambda calculus; algorithms for infinite systems; and monads.
650 0 $a Computer software $2 sigle $3 950579
650 0 $a Software engineering $v Congresses. $3 1243492
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Logics and Meanings of Programs. $3 892495
650 2 4 $a Mathematical Logic and Formal Languages. $3 892517
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 891123
650 2 4 $a Software Engineering. $3 890874
650 2 4 $a Computation by Abstract Devices. $3 891207
700 1 $a Jacobs, Bart. $3 2186543
700 1 $a Loding, Christof. $3 2186544
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 5353. $x 0302-9743 $3 1274248
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-49630-5
950 $a Computer Science (Springer-11645)