rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Foundations of Software Science and Computation Structures
    sub 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
  name:
    name part: Jacobs, Bart.
    role:
      role term: editor.
  name:
    name part: Löding, Christof.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2016
    edition: 1st ed. 2016.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XI, 550 p. 78 illus. online resource.
  abstract: 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.
  table of contents: 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.
  note: edited by Bart Jacobs, Christof Löding.
  subject:
    topic: Computer science
  subject:
    topic: Software engineering
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Computers
  subject:
    topic: Computer logic
  subject:
    topic: Mathematical logic
  subject:
    topic: Computer Science
  subject:
    topic: Logics and Meanings of Programs
  subject:
    topic: Mathematical Logic and Formal Languages
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Software Engineering
  subject:
    topic: Computation by Abstract Devices
  classification: QA76.9.L63
  classification: QA76.5913
  classification: QA76.63
  classification: 005.1015113
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 9634
  identifier: 9783662496305
  identifier: http://dx.doi.org/10.1007/978-3-662-49630-5
  record info:
    record creation date: 160330
    record change date: 20161012195008.0
    record identifier: 978-3-662-49630-5