Advances in computing science - ASIAN '97 : Third Asian Computing Science Conference Kathmandu, Nepal, December 9 11, 1997 : proceedings
This book constitutes the refereed proceedings of the Third Asian Computing Science Conference, ASIAN'97, held in Kathmandu, Nepal, in December 1997. The volume presents 24 revised full papers selected from a total of 94 submissions. Also included are an abstract of the keynote by Michael O. Ra...
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
1345 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Advances in computing science-ASIAN ±97, Third Asian Computing Science Conference, Kathmandu, Nepal, December 1997, proceedings, R.K. Shyamasundar, K. Ueda (eds.), 1997, Berlin, Springer, 1 vol. (XIII-386 p.), Lecture notes in computer science, 3-540-63875-X • Advances in Computing Science - ASIAN'97, Texte imprimé, 9783662199053 |
Indholdsfortegnelse:
- Correctness of programs and protocols through randomization
- Medical image analysis and simulation
- Verification of pipelined microprocessors by comparing memory execution sequences in symbolic simulation
- Rules for abstraction
- Combining Z and temporal interval logics for the formalization of properties and behaviors of embedded systems
- Rules for trace consistent reasoning
- Sensitivity analysis of real-time task sets
- Dynamic multiprocessor scheduling for supporting real-time constraints
- Heuristic Diff Acquiring in lazy release consistency model
- Representation of discretely controlled continuous systems in software-oriented formal analysis
- A generalised framework for reasoning with multi-point events
- Implementing constraint retraction for finite domains
- INSTANCE: The intermediate storage node concept
- Checking hybrid automata for linear duration invariants
- Hierarchical automata as model for statecharts
- Proof discovery in LK system by analogy
- Efficient induction of executable logic programs from examples
- Automated verification of behavioural properties of prolog programs
- Typing the use of resources in a concurrent calculus
- An imperative language with read/write type modes
- Efficient goal scheduling in a concurrent logic language using type-based dependency analysis
- An analysis of divisibility orderings and recursive path orderings
- Share-where maintenance in visual algebraic specifications
- A fault tolerant broadcast scheme in star graphs
- Calculus of classical proofs I
- Tracing the evaluation of lazy functional languages: A model and its implementation
- Basic results in automatic transformations of shared memory parallel programs into sequential programs
- Recurrent oscillatory self-organizing map: Adapting to complex environmental periodicities
- Basic binary decision diagram operations for image processing
- Adaptive object storage system for mobile computing environments
- Structure of user interface module for practical internet messages
- Software specification using LASS
- Nepi2: a two-level calculus for network programming based on the ?-calculus
- On semantics of reactive rule-based systems
- The non-standard semantics of Esterel
- Hybrid support for lenient implementation of Array-comprehension
- Solver for hierarchical CSP containing several constraint types and multi-output constraints.