國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Foundations of software science and ...

(1998 :)

Foundations of software science and computation structures18th International Conference, FOSSACS 2015, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Foundations of software science and computation structuresedited by Andrew Pitts.
其他題名:	18th International Conference, FOSSACS 2015, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015 : proceedings /
其他題名:	FOSSACS 2015
其他作者:	Pitts, Andrew.
團體作者:
出版者:	Berlin, Heidelberg :Springer Berlin Heidelberg :2015.
面頁冊數:	xvi, 465 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computer software
電子資源:	http://dx.doi.org/10.1007/978-3-662-46678-0
ISBN:	9783662466780 (electronic bk.)

Foundations of software science and computation structures18th International Conference, FOSSACS 2015, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015 : proceedings /
Foundations of software science and computation structures18th International Conference, FOSSACS 2015, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015 : proceedings /[electronic resource] :FOSSACS 2015edited by Andrew Pitts. - Berlin, Heidelberg :Springer Berlin Heidelberg :2015. - xvi, 465 p. :ill., digital ;24 cm. - Lecture notes in computer science,90340302-9743 ;. - Lecture notes in computer science ;4891..

Invited Talk -- Polarized Substructural Session Types -- Semantics of Programming Languages I -- Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism -- An Infinitary Model of Linear Logic -- Game Semantics and Normalization by Evaluation -- Foundations of Differential Dataflow -- Categorical Models and Logics -- States of Convex Sets -- A Categorical Semantics for Linear Logical Frameworks -- A Completeness Result for Finite λ-bisimulations -- Sequent Calculus in the Topos of Trees -- Modal and Temporal Logics -- Coalgebraic Trace Semantics via Forgetful Logics -- Unifying Hyper and Epistemic Temporal Logics -- Concurrent, Probabilistic and Timed Systems On the Total Variation Distance of Semi-Markov Chains -- Decidable and Expressive Classes of Probabilistic Automata -- Knowledge = Observation + Memory + Computation -- Compositional Metric Reasoning with Probabilistic Process Calculi -- Semantics of Programming Languages II -- Fragments of ML Decidable by Nested Data Class Memory Automata -- Operational Nominal Game Semantics -- Step-Indexed Logical Relations for Probability -- Automata, Games, Verification -- Minimisation of Multiplicity Tree Automata -- Robust Multidimensional Mean-Payoff Games are Undecidable -- The Cyclic-Routing UAV Problem Is PSPACE-Complete -- Typing Weak MSOL Properties -- Logical Aspects of Computational Complexity Three Variables Suffice for Real-Time Logic -- On Presburger Arithmetic Extended with Modulo Counting Quantifiers -- Parity Games of Bounded Tree- and Clique-Width -- Type Theory, Proof Theory and Implicit Computational Complexity -- Programming and Reasoning with Guarded Recursion for Coinductive Types -- The Computational Contents of Ramified Corecurrence -- On the Dependencies of Logical Rules -- On the Mints Hierarchy in First-Order Intuitionistic Logic.

This book constitutes the proceedings of the 18th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2015, held in London, UK, in April 2015, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015. The 28 full papers presented in this volume were carefully reviewed and selected from 93 submissions. They are organized in topical sections named: semantics of programming languages; categorical models and logics; concurrent, probabilistic and timed systems; automata, games, verification; logical aspects of computational complexity; and type theory, proof theory and implicit computational complexity. The book also contains one full paper invited talk.

ISBN: 9783662466780 (electronic bk.)

Standard No.: 10.1007/978-3-662-46678-0doiSubjects--Topical Terms:

252618
Computer software

LC Class. No.: QA76.751

Dewey Class. No.: 005.1

Foundations of software science and computation structures18th International Conference, FOSSACS 2015, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015 : proceedings /
LDR:03900nmm a2200373 a 4500 001 462578
003 DE-He213
005 20151023141437.0
006 m d
007 cr nn 008maaau
008 151119s2015 gw s 0 eng d
020 $a 9783662466780 (electronic bk.)
020 $a 9783662466773 (paper)
024 7 $a 10.1007/978-3-662-46678-0 $2 doi
035 $a 978-3-662-46678-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.751
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 2015
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Foundations of software science and computation structures $h [electronic resource] : $b 18th International Conference, FOSSACS 2015, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015 : proceedings / $c edited by Andrew Pitts.
246 3 $a FOSSACS 2015
246 3 $a ETAPS 2015
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2015.
300 $a xvi, 465 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9034
505 0 $a Invited Talk -- Polarized Substructural Session Types -- Semantics of Programming Languages I -- Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism -- An Infinitary Model of Linear Logic -- Game Semantics and Normalization by Evaluation -- Foundations of Differential Dataflow -- Categorical Models and Logics -- States of Convex Sets -- A Categorical Semantics for Linear Logical Frameworks -- A Completeness Result for Finite λ-bisimulations -- Sequent Calculus in the Topos of Trees -- Modal and Temporal Logics -- Coalgebraic Trace Semantics via Forgetful Logics -- Unifying Hyper and Epistemic Temporal Logics -- Concurrent, Probabilistic and Timed Systems On the Total Variation Distance of Semi-Markov Chains -- Decidable and Expressive Classes of Probabilistic Automata -- Knowledge = Observation + Memory + Computation -- Compositional Metric Reasoning with Probabilistic Process Calculi -- Semantics of Programming Languages II -- Fragments of ML Decidable by Nested Data Class Memory Automata -- Operational Nominal Game Semantics -- Step-Indexed Logical Relations for Probability -- Automata, Games, Verification -- Minimisation of Multiplicity Tree Automata -- Robust Multidimensional Mean-Payoff Games are Undecidable -- The Cyclic-Routing UAV Problem Is PSPACE-Complete -- Typing Weak MSOL Properties -- Logical Aspects of Computational Complexity Three Variables Suffice for Real-Time Logic -- On Presburger Arithmetic Extended with Modulo Counting Quantifiers -- Parity Games of Bounded Tree- and Clique-Width -- Type Theory, Proof Theory and Implicit Computational Complexity -- Programming and Reasoning with Guarded Recursion for Coinductive Types -- The Computational Contents of Ramified Corecurrence -- On the Dependencies of Logical Rules -- On the Mints Hierarchy in First-Order Intuitionistic Logic.
520 $a This book constitutes the proceedings of the 18th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2015, held in London, UK, in April 2015, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015. The 28 full papers presented in this volume were carefully reviewed and selected from 93 submissions. They are organized in topical sections named: semantics of programming languages; categorical models and logics; concurrent, probabilistic and timed systems; automata, games, verification; logical aspects of computational complexity; and type theory, proof theory and implicit computational complexity. The book also contains one full paper invited talk.
650 0 $a Computer software $3 252618
650 0 $a Software engineering $3 253562
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Logics and Meanings of Programs. $3 275357
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 274102
650 2 4 $a Software Engineering. $3 274511
650 2 4 $a Computation by Abstract Devices. $3 273703
700 1 $a Pitts, Andrew. $3 715592
710 2 $a SpringerLink (Online service) $3 273601
711 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-46678-0
950 $a Computer Science (Springer-11645)