Foundations of Software Science and Computation Structures
Editat de Mogens Nielsen, Uffe Engbergen Limba Engleză Paperback – 22 mar 2002
Preț: 329.14 lei
Preț vechi: 411.42 lei
-20% Nou
Puncte Express: 494
Preț estimativ în valută:
58.23€ • 67.95$ • 50.91£
58.23€ • 67.95$ • 50.91£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540433668
ISBN-10: 354043366X
Pagini: 456
Ilustrații: XIII, 443 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.69 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354043366X
Pagini: 456
Ilustrații: XIII, 443 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.69 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Paper.- Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations.- Contributed Papers.- Verification for Java’s Reentrant Multithreading Concept.- On the Integration of Observability and Reachability Concepts.- Proving Correctness of Timed Concurrent Constraint Programs.- Generalised Regular MSC Languages.- On Compositional Reasoning in the Spi-calculus.- On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability.- A First-Order One-Pass CPS Transformation.- The Demonic Product of Probabilistic Relations.- Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation.- Varieties of Effects.- A Characterization of Families of Graphs in Which Election Is Possible.- Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds*.- Efficient Type Matching.- Higher-Order Pushdown Trees Are Easy.- Conflict Detection and Resolution in Access Control Policy Specifications.- Logics Admitting Final Semantics.- Model Checking Fixed Point Logic with Chop.- On Model Checking Durational Kripke Structures.- Model-Checking Infinite Systems Generated by Ground Tree Rewriting.- Bounded MSC Communication.- The Informatic Derivative at a Compact Element.- Heterogeneous Development Graphs and Heterogeneous Borrowing.- Notions of Computation Determine Monads.- A Calculus of Circular Proofs and Its Categorical Semantics.- Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes.- Note on the Tableau Technique for Commutative Transition Systems.- A Semantic Basis for Local Reasoning.- Linearity and Bisimulation.
Caracteristici
Includes supplementary material: sn.pub/extras