Advances in Computing Science - ASIAN'98
Springer Berlin (Verlag)
978-3-540-65388-2 (ISBN)
Invited Talk 1.- Testing Proofs by Examples.- Session 1.- Rigid Reachability.- Mechanizing Reasoning about Large Finite Tables in a Rewrite Based Theorem Prover.- A Polymorphic Language Which Is Typable and Poly-step.- Cut Elimination for Classical Proofs as Continuation Passing Style Computation.- Tutorial 1.- Semantics and Logic for Provable Fault-Tolerance, A Tutorial.- Invited Talk 2.- The Rewriting Calculus as a Semantics of ELAN.- Session 2.- Tried Linear Hashing.- A New Factoring Algorithm for Magic Predicates.- An Optimal Parallel Algorithm for the Perfect Dominating Set Problem on Distance-Hereditary Graphs.- Session 3.- Taxonomy and Expressiveness of Preemption: A Syntactic Approach.- Exploring Regional Locality in Distributed Shared Memory.- Guaranteed Mutually Consistent Checkpointing in Distributed Computations.- Session 4.- Type Inference for First-Class Messages with Feature Constraints.- Two Flavors of Offine Partial Evaluation.- First-Class Contexts in ML.- Keynote Address.- Formal Methods: Past, Present, and Future.- Session 5.- A Comparison of Petri Net Semantics under the Collective Token Philosophy.- Bisimulation Lattice of Chi Processes.- Eventuality in LOTOS with a Disjunction Operator.- Towards a Characterisation of Finite-State Message-Passing Systems.- Tutorial 2.- Mobile Computation: Calculus and Languages (A Tutorial).
Erscheint lt. Verlag | 23.11.1998 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | X, 314 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 420 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
Informatik ► Theorie / Studium ► Compilerbau | |
Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik | |
Schlagworte | algorithms • automated deduction • bisimulation • Formal Method • Informatik • Logic • Petri net • Proof theory • Semantics |
ISBN-10 | 3-540-65388-0 / 3540653880 |
ISBN-13 | 978-3-540-65388-2 / 9783540653882 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich