Computer Science Logic [electronic resource] : 13th International Workshop, CSL'99, 8th Annual Conference of t
User Rating: Be the first one!
Author: Flum, Jörg, Rodriguez-Artalejo, Mario, Springer-Verlag
Added by: sketch
Added Date: 2015-12-30
Language: eng
Publishers: New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540665366, 9783540665366
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 266.78 MB
PDF Size: 27.2 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 178
Views: 228
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 3 540 48168 0 archive t...torrent
Last Modified: 2022-03-09 08:52:09
Download
Size: 14.53 KB
Description
Computer Science Logic: 13th International Workshop, CSL’99 8th Annual Conference of the EACSL Madrid, Spain, September 20–25, 1999 Proceedings
Author: Jörg Flum, Mario Rodriguez-Artalejo
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66536-6
DOI: 10.1007/3-540-48168-0
Table of Contents:
Annotation
Author: Jörg Flum, Mario Rodriguez-Artalejo
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66536-6
DOI: 10.1007/3-540-48168-0
Table of Contents:
- Topological Queries in Spatial Databases
- The Consistency Dimension, Compactness, and Query Learning
- Descriptive and Parameterized Complexity
- Logical Specification of Operational Semantics
- Constraint-Based Analysis of Broadcast Protocols
- Descriptive Complexity Theory for Constraint Databases
- Applicative Control and Computational Complexity
- Applying Rewriting Techniques to the Verification of Erlang Processes
- Difference Decision Diagrams
- Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States
- Verifying Liveness by Augmented Abstraction
- Signed Interval Logic
- Quantitative Temporal Logic
- An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces
- Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting
- Closed Reductions in the λ-Calculus
- Kripke Resource Models of a Dependently-Typed, Bunched λ-Calculus (Extended Abstract)
- A Linear Logical View of Linear Type Isomorphisms
- Choice Logic Programs and Nash Equilibria in Strategic Games
- Resolution Method for Modal Logic with Well-Founded Frames
Annotation
You May Also Like
We will be happy to hear your thoughts