Foundations of Software Science and Computation Structures
Springer Berlin (Verlag)
978-3-540-41864-1 (ISBN)
Invited Paper.- Adequacy for Algebraic Effects.- Contributed Papers.- Secrecy Types for Asymmetric Communication.- Axiomatizing Tropical Semirings.- Type Isomorphisms and Proof Reuse in Dependent Type Theory.- On the Duality between Observability and Reachability.- The Finite Graph Problem for Two-Way Alternating Automata.- High-Level Petri Nets as Type Theories in the Join Calculus.- Temporary Data in Shared Dataspace Coordination Languages.- On Garbage and Program Logic.- The Complexity of Model Checking Mobile Ambients.- The Rho Cube.- Type Inference with Recursive Type Equations.- On the Modularity of Deciding Call-by-Need.- Synchronized Tree Languages Revisited and New Applications.- Computational Completeness of Programming Languages Based on Graph Transformation.- Axioms for Recursion in Call-by-Value.- Class Analysis of Object-Oriented Programs through Abstract Interpretation.- On the Complexity of Parity Word Automata.- Foundations for a Graph-Based Approach to the Specification of Access Control Policies.- Categories of Processes Enriched in Final Coalgebras.- Model Checking CTL+ and FCTL Is Hard.- On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory.- Verified Bytecode Verifiers.- Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the ?-Calculus and Mechanizing the Theory of Contexts.- Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes.- An Axiomatic Semantics for the Synchronous Language Gentzen.- Tool Presentation.- Marrella and the Verification of an Embedded System.
Erscheint lt. Verlag | 21.3.2001 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XII, 420 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 603 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Software Entwicklung |
Informatik ► Theorie / Studium ► Compilerbau | |
Schlagworte | Automata • Complexity • Complexity theory • Computational Structures • formal methods • Formal Verification • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Logic • Mathematical Foundations • Model Checking • Petri net • program analysis • Program Logics • programming • Programming language • Programming Theory • Software engineering • software science • verification |
ISBN-10 | 3-540-41864-4 / 3540418644 |
ISBN-13 | 978-3-540-41864-1 / 9783540418641 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich