000 05312nam a22006135i 4500
001 978-3-540-45500-4
003 DE-He213
005 20240423132522.0
007 cr nn 008mamaa
008 121227s2001 gw | s |||| 0|eng d
020 _a9783540455004
_9978-3-540-45500-4
024 7 _a10.1007/3-540-45500-0
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aTheoretical Aspects of Computer Software
_h[electronic resource] :
_b4th International Symposium, TACS 2001, Sendai, Japan, October 29-31, 2001. Proceedings /
_cedited by Naoki Kobayashi, Benjamin C. Pierce.
250 _a1st ed. 2001.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2001.
300 _aXI, 565 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2215
505 0 _aInvited Talk 1 -- A Spatial Logic for Concurrency (Part I) -- Session 1 -- Boxed Ambients -- A Typed Process Calculus for Fine-Grained Resource Access Control in Distributed Computation -- Formal Eavesdropping and Its Computational Interpretation -- Invited Talk 2 -- Resource-Passing Concurrent Programming -- Session 2 -- Solo Diagrams -- Observational Equivalence for Synchronized Graph Rewriting with Mobility -- Session 3 -- Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness -- Termination Proofs and Complexity Certification -- A Renee Equation for Algorithmic Complexity -- Invited Talk 3 -- Nominal Logic: A First Order Theory of Names and Binding -- Session 4 -- A Logic Programming Language Based on Binding Algebras -- Proof-Search and Countermodel Generation in Propositional BI Logic -- Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders -- Invited Talk 4 -- Modelisation of Timed Automata in Coq -- Session 5 -- Model-Checking LTL with Regular Valuations for Pushdown Systems -- What Will Be Eventually True of Polynomial Hybrid Automata? -- Non-structural Subtype Entailment in Automata Theory -- Session 6 -- Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems -- Weakest Congruence Results Concerning “Any-Lock” -- Invited Talk 5 -- Design and Correctness of Program Transformations Based on Control-Flow Analysis -- Session 7 -- Infinite Intersection and Union Types for the Lazy Lambda Calculus -- Strong Normalization of Second Order Symmetric Lambda-mu Calculus -- The Girard-Reynolds Isomorphism -- Invited Talk 6 -- Lightweight Analysis of Object Interactions -- Session 8 -- Typing Assembly Programs with Explicit Forwarding -- The UDP Calculus: Rigorous Semantics for Real Networking -- TACS Open Lecture -- Unison: A FileSynchronizer and Its Specification.
520 _aThis volume constitutes the proceedings of the Fourth International Symposium on Theoretical Aspects of Computer Software (TACS 2001) held at Tohoku U- versity, Sendai, Japan in October 2001. The TACS symposium focuses on the theoretical foundations of progr- ming and their applications. As this volume shows, TACS is an international symposium, with participants from many di?erent institutions and countries. TACS 2001 was the fourth symposium in the TACS series, following TACS’91, TACS’94, and TACS’97, whose proceedings were published as Volumes 526, 789, and 1281, respectively, of Springer-Verlag’s Lecture Notes in Computer Science series. The TACS 2001 technical program consisted of invited talks and contributed talks. In conjunction with this program there was a special open lecture by Benjamin Pierce; this lecture was open to non-registrants. TACS 2001 bene?ted from the e?orts of many people; in particular, members of the Program Committee and the Organizing Committee. Our special thanks go to the Program Committee Co-chairs: Naoki Kobayashi (Tokyo Institute of Technology) Benjamin Pierce (University of Pennsylvania).
650 0 _aSoftware engineering.
650 0 _aApplication software.
650 0 _aCompilers (Computer programs).
650 0 _aComputer science.
650 0 _aMachine theory.
650 1 4 _aSoftware Engineering.
650 2 4 _aComputer and Information Systems Applications.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
700 1 _aKobayashi, Naoki.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPierce, Benjamin C.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540427360
776 0 8 _iPrinted edition:
_z9783662192504
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2215
856 4 0 _uhttps://doi.org/10.1007/3-540-45500-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188644
_d188644