Towards a Characterisation of Finite-State Message-Passing Systems (English)
- New search for: Mukund, M.
- New search for: Narayan Kumar, K.
- New search for: Radhakrishnan, J.
- New search for: Sohoni, M.
- New search for: Mukund, M.
- New search for: Narayan Kumar, K.
- New search for: Radhakrishnan, J.
- New search for: Sohoni, M.
- New search for: Hsiang, J.
- New search for: Ohori, A.
In:
Advances in computing science - ASIAN'98
1538
;
282-299
;
1998
-
ISBN:
-
ISSN:
- Conference paper / Print
-
Title:Towards a Characterisation of Finite-State Message-Passing Systems
-
Contributors:Mukund, M. ( author ) / Narayan Kumar, K. ( author ) / Radhakrishnan, J. ( author ) / Sohoni, M. ( author ) / Hsiang, J. / Ohori, A.
-
Conference:Asian computing science conference; 4th, Advances in computing science - ASIAN'98 ; 1998 ; Manila
-
Published in:Advances in computing science - ASIAN'98 , 1538 ; 282-299LECTURE NOTES IN COMPUTER SCIENCE , 1538 ; 282-299
-
Publisher:
- New search for: Springer
-
Place of publication:Berlin , New York
-
Publication date:1998-01-01
-
Size:18 pages
-
ISBN:
-
ISSN:
-
Type of media:Conference paper
-
Type of material:Print
-
Language:English
-
Keywords:
-
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Testing Proofs by ExamplesHayashi, S. / Sumitomo, R. et al. | 1998
- 4
-
Rigid ReachabilityGanzinger, H. / Jacquemard, F. / Veanes, M. et al. | 1998
- 22
-
Mechanizing Reasoning about Large Finite Tables in a Rewrite Based Theorem ProverKapur, D. / Subramaniam, M. et al. | 1998
- 43
-
A Polymorphic Language Which Is Typable and Poly-stepRoversi, L. et al. | 1998
- 61
-
Cut Elimination for Classical Proofs as Continuation Passing Style ComputationOgata, I. et al. | 1998
- 79
-
Semantics and Logic for Provable Fault-Tolerance, A TutorialJanowski, T. et al. | 1998
- 84
-
The Rewriting Calculus as a Semantics of ELANCirstea, H. / Kirchner, C. et al. | 1998
- 86
-
Tried Linear HashingAng, C. H. / Tan, S. T. / Tan, T. C. et al. | 1998
- 95
-
A New Factoring Algorithm for Magic PredicatesDu, X. / Liu, Z. / Ishii, N. et al. | 1998
- 113
-
An Optimal Parallel Algorithm for the Perfect Dominating Set Problem on Distance-Hereditary GraphsHsieh, S.-Y. / Chen, G.-H. / Ho, C.-W. et al. | 1998
- 125
-
Taxonomy and Expressiveness of Preemption: A Syntactic ApproachPinchinat, S. / Rutten, E. / Shyamasundar, R. K. et al. | 1998
- 142
-
Exploring Regional Locality in Distributed Shared MemoryHuang, Z. / Sun, C. / Sattar, A. et al. | 1998
- 157
-
Guaranteed Mutually Consistent Checkpointing in Distributed ComputationsYang, Z. / Sun, C. / Sattar, A. / Yang, Y. et al. | 1998
- 169
-
Type Inference for First-Class Messages with Feature ConstraintsMueller, M. / Nishimura, S. et al. | 1998
- 188
-
Two Flavors of Offline Partial EvaluationHelsen, S. / Thiemann, P. et al. | 1998
- 206
-
First-Class Contexts in MLHashimoto, M. et al. | 1998
- 224
-
Formal Methods: Past, Present, and FutureWing, J. M. et al. | 1998
- 225
-
A Comparison of Petri Net Semantics under the Collective Token PhilosophyBruni, R. / Meseguer, J. / Montanari, U. / Sassone, V. et al. | 1998
- 263
-
Eventuality in LOTOS with a Disjunction OperatorIsobe, Y. / Sato, Y. / Ohmaki, K. et al. | 1998
- 282
-
Towards a Characterisation of Finite-State Message-Passing SystemsMukund, M. / Narayan Kumar, K. / Radhakrishnan, J. / Sohoni, M. et al. | 1998
- 300
-
Mobile Computation: Calculus and Languages (A Tutorial)Raja, N. / Shyamasundar, R. K. et al. | 1998
-
Bisimulation Lattice of Chi ProcessesFu, Y. et al. | 1998