大葉大學圖書館 |

Foundations of software science and computation structures[electronic resource] :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 /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	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 // edited by Bart Jacobs, Christof Loding.
其他題名:	FOSSACS 2016
其他作者:	Jacobs, Bart.
團體作者:	Clark Conference
出版者:	Berlin, Heidelberg : : Springer Berlin Heidelberg :, 2016.
面頁冊數:	xi, 550 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Computer software
標題:	Software engineering
標題:	Computer Science.
標題:	Logics and Meanings of Programs.
標題:	Mathematical Logic and Formal Languages.
標題:	Programming Languages, Compilers, Interpreters.
標題:	Software Engineering.
標題:	Computation by Abstract Devices.
ISBN:	9783662496305
ISBN:	9783662496299
內容註:	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.
電子資源:	http://dx.doi.org/10.1007/978-3-662-49630-5

Foundations of software science and computation structures[electronic resource] :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 ;7103..

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:

135372
Computer software

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

Dewey Class. No.: 005.1

Foundations of software science and computation structures[electronic resource] :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:03836nam a2200361 a 4500 001 446586
003 DE-He213
005 20160913102846.0
006 m d
007 cr nn 008maaau
008 161201s2016 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
111 2 $a Clark Conference $d (2005 : $c Sterling and Francine Clark Art Institute) $3 347558
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 $3 135372
650 0 $a Software engineering $3 135422
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Logics and Meanings of Programs. $3 466905
650 2 4 $a Mathematical Logic and Formal Languages. $3 463478
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 466913
650 2 4 $a Software Engineering. $3 464601
650 2 4 $a Computation by Abstract Devices. $3 463641
700 1 $a Jacobs, Bart. $3 486674
700 1 $a Loding, Christof. $3 639308
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 7103. $3 466200
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-49630-5
950 $a Computer Science (Springer-11645)