|
|
|
|
LEADER |
05293nam a22005775i 4500 |
001 |
978-3-540-24727-2 |
003 |
DE-He213 |
005 |
20151204144946.0 |
007 |
cr nn 008mamaa |
008 |
121227s2004 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540247272
|9 978-3-540-24727-2
|
024 |
7 |
|
|a 10.1007/b95995
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.758
|
072 |
|
7 |
|a UMZ
|2 bicssc
|
072 |
|
7 |
|a UL
|2 bicssc
|
072 |
|
7 |
|a COM051230
|2 bisacsh
|
082 |
0 |
4 |
|a 005.1
|2 23
|
245 |
1 |
0 |
|a Foundations of Software Science and Computation Structures
|h [electronic resource] :
|b 7th International Conference, FOSSACS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 – April 2, 2004. Proceedings /
|c edited by Igor Walukiewicz.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2004.
|
300 |
|
|
|a XIV, 530 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2987
|
505 |
0 |
|
|a Invited Contributions -- Intruder Theories (Ongoing Work) -- Theories for the Global Ubiquitous Computer -- Contributed Papers -- Choice in Dynamic Linking -- Soft lambda-Calculus: A Language for Polynomial Time Computation -- On the Existence of an Effective and Complete Inference System for Cryptographic Protocols -- Hypergraphs and Degrees of Parallelism: A Completeness Result -- Behavioral and Spatial Observations in a Logic for the ?-Calculus -- Election and Local Computations on Edges -- Decidability of Freshness, Undecidability of Revelation -- LTL over Integer Periodicity Constraints -- Unifying Recursive and Co-recursive Definitions in Sheaf Categories -- Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting -- A Denotational Account of Untyped Normalization by Evaluation -- On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds -- Specifying and Verifying Partial Order Properties Using Template MSCs -- Angelic Semantics of Fine-Grained Concurrency -- On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi -- safeDpi: A Language for Controlling Mobile Code -- Distance Desert Automata and the Star Height One Problem -- Adhesive Categories -- A Game Semantics of Local Names and Good Variables -- Partial Correctness Assertions Provable in Dynamic Logics -- Polynomials for Proving Termination of Context-Sensitive Rewriting -- Bisimulation on Speed: Lower Time Bounds -- On Recognizable Timed Languages -- Tree Transducers and Tree Compressions -- On Term Rewriting Systems Having a Rational Derivation -- Duality for Labelled Markov Processes -- Electoral Systems in Ambient Calculi -- Strong Normalization of -Calculus with Explicit Substitutions -- Canonical Models for Computational Effects -- Reasoning about Dynamic Policies -- Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols -- Strong Bisimulation for the Explicit Fusion Calculus -- Perfect-Information Stochastic Parity Games -- A Note on the Perfect Encryption Assumption in a Process Calculus.
|
520 |
|
|
|a ETAPS 2004 was the seventh instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprised ?ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), 23 satellite workshops, 1 tutorial, and 7 invited lectures (not including those that are speci?c to the satellite events). The events that comprise ETAPS address various aspects of the system - velopment process, including speci?cation, design, implementation, analysis and improvement. The languages, methodologies and tools that support these - tivities are all well within its scope. Di?erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on the one hand and soundly based practice on the other. Many of the issues inv- ved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Programming languages (Electronic computers).
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Computer logic.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Software Engineering/Programming and Operating Systems.
|
650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
650 |
2 |
4 |
|a Software Engineering.
|
650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
700 |
1 |
|
|a Walukiewicz, Igor.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540212980
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2987
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/b95995
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|