Mathematical foundations of computer science 1996 : 21st international symposium, MFCS '96, Craków, Poland, September 2-6, 1996 : proceedings
This book constitutes the refereed proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, MFCS '96, held in Crakow, Poland in September 1996. The volume presents 35 revised full papers selected from a total of 95 submissions together with 8 invited pape...
Zapisane w:
| Korporacja: | |
|---|---|
| Kolejni autorzy: | , |
| Format: | Livre numérique |
| Język: | Anglais |
| Wydane: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seria: | Lecture notes in computer science
1113 |
| Hasła przedmiotowe: | |
| Dostęp online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Komentarz: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Mathematical foundations of computer science 1996, 21st international symposium, MFCS '96, Craków, Poland, September 2-6, 1996, proceedings, Wojciech Penczek, Andrzej Szałas, eds, 1996, Berlin, Springer, 1 vol. (X-592 p.), Lecture notes in computer science, 3-540-61550-4 • Mathematical Foundations of Computer Science 1996, Texte imprimé, 9783662188781 |
Spis treści:
- Word level model checking
- Code problems on traces
- Models of DNA computation
- Theory and practice of action semantics
- Linear time temporal logics over Mazurkiewicz traces
- Partial order reduction: Model-checking using representatives
- Nonmonotonic rule systems: Forward chaining, constraints, and complexity
- Mind the gap! Abstract versus concrete models of specifications
- A sequent calculus for subtyping polymorphic types
- Kolmogorov complexity: Recent research in Moscow
- A modal logic for data analysis
- From specifications to programs: A fork-algebraic approach to bridge the gap
- Logic of predicates with explicit substitutions
- On the query complexity of sets
- A Lambda Calculus of incomplete objects
- Bisimilarity problems requiring exponential time (Extended abstract)
- Linear dynamic Kahn networks are deterministic
- Shortest path problems with time constraints
- Parallel Alternating-Direction Access Machine
- Specification and verification of timed lazy systems
- A class of information logics with a decidable validity problem
- On the power of nonconservative PRAM
- Self-similarity viewed as a local property via tile sets
- Simulation of specification statements in Hoare logic
- Equational properties of iteration in algebraically complete categories
- On unconditional transfer
- (poly(log log n), poly(log log n)) Restricted verifiers are unlikely to exist for languages in