Tuesday, September 2, 2014

Foundations of Software Sbience and Computational Structures






Foundations of Software Sbience and Computational Structures (Dasar-dasar Ilmu Software dan Struktur Komputasi)

Buku Ini pertama kali diterbitkan pertama kali tahun 2011 oleh Springer-Verlag Berlin Heidelberg.


Judul: Foundations of Software Sbience and Computational Structures (Dasar-dasar Ilmu Software dan Struktur Komputasi)
Oleh: Martin Hoftman (Editor)
Penerbit: Springer-Verlag Berlin Heidelberg
Tahun: 2011
Jumlah Halaman: 489 hal.


Editor:
Martin Hofmann
Ludwig-Maximilians-Universität München
Institut für Informatik
Oettingenstr. 67, 80538 München, Germany
E-mail: hofmann@ifi.lmu.de
ISSN

Lingkup Pembahasan:
Buku ini terdiri atas 8 bagian yang meliputi: Coalgebra dan komputabilitas, Tipe Teori, Proses Bate, Teori Automata, Semantic, Binding, Pengamanan, Program Analisis.Dari masing-masing bagian ini terdiri dari beberapa topic.

Daftar isi:
The Search for Structure in Quantum Computation (Invited Talk)  1
Prakash Panangaden

Coalgebra and Computability
Coalgebraic Walks, in Quantum and Turing Computation  12
Bart Jacobs
Similarity Quotients as Final Coalgebras  27
Paul Blain Levy
What Do Reversible Programs Compute? 42
Holger Bock Axelsen and Robert Gl¨uck
Type Theory
Irrelevance in Type Theory with a Heterogeneous Equality Judgement 57
Andreas Abel
When Is a Type Refinement an Inductive Type?  72
Robert Atkey, Patricia Johann, and Neil Ghani
Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types  88
Alexis Bernadet and St´ephane Lengrand
Realizability and Parametricity in Pure Type Systems  108
Jean-Philippe Bernardy and Marc Lasson
Process Calculi
Sound Bisimulations for Higher-Order Distributed Process Calculus  123
Adrien Pi´erard and Eijiro Sumii
Deriving Labels and Bisimilarity for Concurrent Constraint Programming  138
Andr´es Aristiz´abal, Filippo Bonchi, Catuscia Palamidessi, Luis Pino, and Frank Valencia  Ordinal Theory for Expressiveness of Well Structured Transition Systems  153       
Remi Bonnet, Alain Finkel, Serge Haddad, and Fernando Rosa-Velardo

Automata Theory
Alternation Elimination for Automata over Nested Words 168
Christian Dax and Felix Klaedtke
Co-B¨uching Them All  184
Udi Boker and Orna Kupferman
Minimizing Deterministic Lattice Automata  199
Shulamit Halamish and Orna Kupferman
Regularity and Context-Freeness over Word Rewriting Systems 214
Didier Caucal and Trong Hieu Dinh
Quantitative Robustness Analysis of Flat Timed Automata  229
R´emi Jaubert and Pierre-Alain Reynier
A Game Approach to Determinize Timed Automata  245
Nathalie Bertrand, Am´elie Stainer, Thierry J´eron, and Moez Krichen
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes  260
Naoki Kobayashi
Church Synthesis Problem for Noisy Input  275
Yaron Velner and Alexander Rabinovich
Probabilistic Modal μ-Calculus with Independent Product  290
Matteo Mio

Semantics
A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces  305
Jan Schwinghammer, Lars Birkedal, and Kristian Støvring
A Modified GoI Interpretation for a Linear Functional Programming Language and Its   320
Naohiko Hoshino
Estimation of the Length of Interactions in Arena Game Semantics  335
Pierre Clairambault
Synchronous Game Semantics via Round Abstraction 350
Dan R. Ghica and Mohamed N. Menaa

Binding
Freshness and Name-Restriction in Sets of Traces with Names  365
Murdoch J. Gabbay and Vincenzo Ciancia
Polymorphic Abstract Syntax via Grothendieck Construction  381
Makoto Hamana

Security
Asymptotic Information Leakage under One-Try Attacks  396
Michele Boreale, Francesca Pampaloni, and Michela Paolini
A Trace-Based View on Operating Guidelines  411
Christian Stahl and Walter Vogler

Program Analysis
HTML Validation of Context-Free Languages  426
Anders Møller and Mathias Schwarz
On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks  441
Giorgio Delzanno, Arnaud Sangnier, and Gianluigi Zavattaro
The Reduced Product of Abstract Domains and the Combination of Decision Procedures  456
Patrick Cousot, Radhia Cousot, and Laurent Mauborgne
Author Index   473
  
Berminat?
Email: zanetapm@gmail.com





Foundations of Software Sbience and Computational Structures Rating: 4.5 Diposkan Oleh: Unknown

0 comments:

Post a Comment