000 05425nam a22005895i 4500
001 978-3-540-31987-0
003 DE-He213
005 20240423125804.0
007 cr nn 008mamaa
008 101220s2005 gw | s |||| 0|eng d
020 _a9783540319870
_9978-3-540-31987-0
024 7 _a10.1007/b107380
_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 _aProgramming Languages and Systems
_h[electronic resource] :
_b14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings /
_cedited by Mooly Sagiv.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXIV, 442 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3444
505 0 _aProgramming with Explicit Security Policies -- Trace Partitioning in Abstract Interpretation Based Static Analyzers -- The ASTREÉ Analyzer -- Interprocedural Herbrand Equalities -- Analysis of Modular Arithmetic -- Forward Slicing by Conjunctive Partial Deduction and Argument Filtering -- A New Foundation for Control-Dependence and Slicing for Modern Program Structures -- Summaries for While Programs with Recursion -- Determinacy Inference for Logic Programs -- Automatic Verification of Pointer Programs Using Grammar-Based Shape Analysis -- A Type Discipline for Authorization Policies -- Computationally Sound, Automated Proofs for Security Protocols -- Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries -- Analysis of an Electronic Voting Protocol in the Applied Pi Calculus -- Streams with a Bottom in Functional Languages -- Bottom-Up ?-Reduction: Uplinks and ?-DAGs -- BI Hyperdoctrines and Higher-Order Separation Logic -- Deciding Reachability in Mobile Ambients -- Denotational Semantics for Abadi and Leino’s Logic of Objects -- A Design for a Security-Typed Language with Certificate-Based Declassification -- Adjoining Declassification and Attack Models by Abstract Interpretation -- Enforcing Resource Bounds via Static Verification of Dynamic Checks -- Asserting Bytecode Safety -- Subtyping First-Class Polymorphic Components -- Complexity of Subtype Satisfiability over Posets -- A Type System Equivalent to a Model Checker -- Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close -- Towards a Type System for Analyzing JavaScript Programs -- Java JR: Fully Abstract Trace Semantics for a Core Java Language.
520 _aETAPS 2005 was the eighth 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 conf- ences. This year it comprised ?ve conferences (CC, ESOP, FASE, FOSSACS, TACAS), 17 satellite workshops (AVIS, BYTECODE, CEES, CLASE, CMSB, COCV, FAC, FESCA, FINCO, GCW-DSE, GLPL, LDTA, QAPL, SC, SLAP, TGC, UITP), seven invited lectures (not including those that were speci?c to the satellite events), and several tutorials. We received over 550 submissions to the ?ve conferences this year, giving acceptance rates below 30% for each one. Congratulations to all the authors who made it to the ?nal program! I hope that most of the other authors still found a way of participating in this exciting event and I hope you will continue submitting. 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 which 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 involved in software design apply to systems in general, including hardware s- tems,andtheemphasisonsoftwareisnotintendedtobeexclusive.
650 0 _aSoftware engineering.
650 0 _aCompilers (Computer programs).
650 0 _aComputer programming.
650 0 _aComputer science.
650 0 _aMachine theory.
650 1 4 _aSoftware Engineering.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aProgramming Techniques.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
700 1 _aSagiv, Mooly.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540254355
776 0 8 _iPrinted edition:
_z9783540809531
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3444
856 4 0 _uhttps://doi.org/10.1007/b107380
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c181718
_d181718