Kooperativer Bibliotheksverbund

UID:

Format: VI, 283 p. , online resource.

ISBN: 9783319226866

Series Statement: Trends in Logic, Studia Logica Library, 43

Content: This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory. The field of proof-theoretic semantics has existed for almost 50 years, but the term itself was proposed by Schroeder-Heister in the 1980s. Proof-theoretic semantics explains the meaning of linguistic expressions in general and of logical constants in particular in terms of the notion of proof. This volume emerges from presentations at the Second International Conference on Proof-Theoretic Semantics in Tübingen in 2013, where contributing authors were asked to provide a self-contained description and analysis of a significant research question in this area. The contributions are representative of the field and should be of interest to logicians, philosophers, and mathematicians alike.

Note: Chapter 1. Introduction; Thomas Piecha & Peter-Schroeder-Heister -- Chapter 2. On Brouwer-Heyting-Kolmogorov provability semantics; Sergei N. Artëmov -- Chapter 3. Two Ways of General Proof Theory; Kosta Došen -- Chapter 4. Generalised elimination rules; Roy Dyckhoff -- Chapter 5. On the proof theoretic foundations of set theory; Lars Hallnäs -- Chapter 6. The choice of semantics as a methodological question; Wilfrid Hodges -- Chapter 7. The mode of presentation; Reinhard Kahle -- Chapter 8. Remarks on relations between Gentzen and Heyting inspired PTS; Dag Prawitz -- Chapter 9. Unification of logics by reflection; Giovanni Sambin -- Chapter 10. BHK and Brouwer's Theory of the Creative Subject; Göran Sundholm -- Chapter 11. Compositional semantics for predicate logic: Eliminating bound variables from formulas and deductions; William W. Tait -- Chapter 12. Intuitionism, the Paradox of Knowability and Empirical Negation; Gabriele Usberti -- Chapter 13. Explicit composition and its application in normalization proofs; Jan von Plato -- Chapter 14. A two-sorted typed lambda-calculus; Heinrich Wansing -- Chapter 15. Kreisel's second clause and the Theory of Constructions; Walter Dean & Hidenori Kurokawa -- Chapter 16. On Paradoxes in Proof-Theoretic Semantics; Yoshihiro Maruyama.

In: Springer eBooks

Additional Edition: Printed edition: ISBN 9783319226859

Language: English

Keywords: Electronic books ; Electronic books.

DOI: 10.1007/978-3-319-22686-6

URL: http://dx.doi.org/10.1007/978-3-319-22686-6

URL: ProQuest Ebook Central

URL: ProQuest Ebook Central

URL: Full-text  ((OIS Credentials Required))

URL: Click to View

URL: Volltext  (kostenfrei)

URL: Inhaltsverzeichnis

URL: Abstract

URL: lizenzpflichtig

UID:

Format: XIII, 468 S.

ISBN: 1-57586-386-3 , 1-57586-385-5

Series Statement: Studies in constraint-based lexicalism

Note: Includes bibliographical references and index

Language: English

Subjects: German Studies

Keywords: Deutsch ; Mehrteiliges Prädikat

URL: Inhaltsverzeichnis

URL: http://www.loc.gov/catdir/description/uchi051/2002013483.html

URL: http://www.loc.gov/catdir/toc/uchi051/2002013483.html

UID:

Format: IX, 442 p. , online resource.

ISBN: 9783540477952

Series Statement: Lecture Notes in Computer Science, 270

Content: This volume contains 37 invited research papers collected in memory of Dieter Rödding, who is known for his work on the classification of recursive functions, on reduction classes, on the spectrum problem and on the complexity of cardinality quantifiers in predicate logic and in arithmetical hierarchy. He was one of the first to pursue the interaction of logic and computer science. The volume reflects the wide spectrum of Dieter Rödding's scientific interests.

Note: Minimal pairs for polynomial time reducibilities -- Primitive recursive word-functions of one variable -- Existential fixed-point logic -- Unsolvable decision problems for PROLOG programs -- You have not understood a sentence, unless you can prove it -- On the minimality of K, F, and D or: Why löten is non-trivial -- A 5-color-extension-theorem -- Closure relations, Buchberger's algorithm, and polynomials in infinitely many variables -- The benefit of microworlds in learning computer programming -- Skolem normal forms concerning the least fixpoint -- Spectral representation of recursively enumerable and coenumerable predicates -- Aggregating inductive expertise on partial recursive functions -- Domino threads and complexity -- Modelling of cooperative processes -- A setting for generalized computability -- First-order spectra with one variable -- On the early history of register machines -- Randomness, provability, and the separation of Monte Carlo Time and space -- Representation independent query and update operations on propositional definite Horn formulas -- Direct construction of mutually orthogonal latin squares -- Negative results about the length problem -- Some results on the complexity of powers -- The Turing complexity of AF C*-algebras with lattice-ordered KO -- Remarks on SASL and the verification of functional programming languages -- Numerical stability of simple geometric algorithms in the plane -- Communication with concurrent systems via I/0-procedures -- A class of exp-time machines which can be simulated by polytape machines -- ???-Automata realizing preferences -- Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen -- Grammars for terms and automata -- Relative konsistenz -- Segment translation systems -- First steps towards a theory of complexity over more general data structures -- On the power of single-valued nondeterministic polynomial time computations -- A concatenation game and the dot-depth hierarchy -- Do there exist languages with an arbitrarily small amount of context-sensitivity? -- The complexity of symmetric boolean functions.

In: Springer eBooks

Additional Edition: Printed edition: ISBN 9783540181705

Language: English

Subjects: Computer Science

Keywords: Aufsatzsammlung ; Festschrift

DOI: 10.1007/3-540-18170-9

URL: http://dx.doi.org/10.1007/3-540-18170-9

URL: Volltext

UID:

Format: 1 online resource (XIV, 868 p.)

ISBN: 9783110670844 , 9783110696271

Series Statement: Comparative Handbooks of Linguistics [CHL] ; 6

Content: This volume provides detailed studies of the crosslinguistically unusual mermaid construction in seventeen languages of Asia, including Modern Standard Japanese, and one language of Africa. This construction appears to be absent in languages of Europe, Oceania and the Americas. The name - mermaid construction - alludes to its paradoxical make-up, where the structure closely resembling a verb-predicate clause ends with what may look like a noun-predicate clause. Superficially it looks biclausal; however, syntactically it is monoclausal. It has a compound predicate which contains an independent noun, a clitic or an affix derived from a noun, or a nominalizer. Its compound predicate has a modal, evidential, aspectual, temporal, stylistic or discourse-related meaning. The paradox is resolved from a diachronic perspective insofar as a biclausal structure is reanalyzed as a monoclausal one. This volume shows how a noun may be reanalyzed to become a constituent of a predicate. It constitutes an important contribution to research on grammaticalization and in particular, the grammaticalization of nouns and more generally, to the typology of syntactic reanalysis.

Note: Frontmatter -- , Contents -- , Preface -- , List of authors -- , Maps -- , Genetic classification of languages examined or referred to -- , 1 Mermaid construction: An introduction and summary -- , I. SOV languages -- , 2 Modern Standard Japanese -- , 3 Mitsukaido dialect of Japanese -- , 4 Old and Early Middle Japanese -- , 5 Irabu Ryukyuan -- , 6 Korean -- , 7 Kolyma Yukaghir -- , 8 Sakha (Yakut) -- , 9 Khalkha Mongolian -- , 10 Amdo Tibetan -- , 11 nDrapa -- , 12 Kathmandu Newar -- , 13 Burmese -- , 14 Kurux -- , 15 Hindi -- , 16 Sidaama -- , II. SVO languages -- , 17 Thai -- , III. VSO/VOS languages -- , 18 Tagalog -- , IV Languages in which the order of S, O and V is not fixed -- , 19 Koryak -- , Index of names -- , Index of languages -- , Index of subjects , Mode of access: Internet via World Wide Web. , In English.

In: DG Ebook Package 2020, De Gruyter, 9783110696271

In: DG Ebook Package English 2020, De Gruyter, 9783110696288

In: De Gruyter English eBooks 2020 - UC, De Gruyter, 9783110659061

In: De Gruyter Mouton Frontlist 2020, De Gruyter, 9783110743166

In: EBOOK PACKAGE COMPLETE 2020 English, De Gruyter, 9783110704716

In: EBOOK PACKAGE COMPLETE 2020, De Gruyter, 9783110704518

In: EBOOK PACKAGE Linguistics 2020 English, De Gruyter, 9783110704761

In: EBOOK PACKAGE Linguistics 2020, De Gruyter, 9783110704563

Additional Edition: ISBN 9783110670875

Additional Edition: ISBN 9783110670806

Language: English

DOI: 10.1515/9783110670844

URL: https://doi.org/10.1515/9783110670844

URL: https://www.degruyter.com/isbn/9783110670844

URL: Cover

URL: https://doi.org/10.1515/9783110670844

URL: https://www.degruyter.com/isbn/9783110670844

URL: lizenzpflichtig

URL: lizenzpflichtig

URL: Cover

UID:

Format: 1 online resource (viii, 322 pages) : , digital, PDF file(s).

ISBN: 9780511712234 (ebook)

Content: Complex predicates are multipredicational, but monoclausal structures. They have proven problematic for linguistic theory, particularly for proposed distinctions between the lexicon, morphology, and syntax. This volume focuses on the mapping from morphosyntactic structures to event structure, and in particular the constraints on possible mappings. The volume showcases the 'coverb construction', a complex predicate construction which, though widespread, has received little attention in the literature. The coverb construction contrasts with more familiar serial verb constructions. The coverb construction generally maps only to event structures like those of monomorphemic verbs, whereas serial verb constructions map to a range of event structures differing from those of monomorphemic verbs. The volume coverage is truly cross-linguistic, including languages from Australia, Papua New Guinea, Southeast Asia, the Indian subcontinent, East Africa and North America. The volume establishes a new arena of research in event structure, syntax, and cross-linguistic typology.

Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , Machine generated contents note: 1. Introduction: complex predicates Mengistu Amberber, Brett Baker and Mark Harvey; 2. Complex predicate formation Brett Baker and Mark Harvey; 3. The light verb jungle: still hacking away Miriam Butt; 4. Events and serial verb constructions William A. Foley; 5. Cotemporal serial verb constructions in White Hmong Nerida Jarkey; 6. Activity incorporates in some Athabaskan languages Keren Rice; 7. Warlpiri verbs of change and causation: the thematic core Mary Laughren; 8. Complex predicates in Wambaya: detaching predicate composition from syntactic structure Rachel Nordlinger; 9. Compound verbs and ideophones in Wolaitta revisited Azeb Amha; 10. The structure of the light verb construction in Amharic Mengistu Amberber; Author index; Language index; Subject index.

Additional Edition: Print version: ISBN 9780521886673

Language: English

Subjects: Comparative Studies. Non-European Languages/Literatures

Keywords: Aufsatzsammlung

URL: https://doi.org/10.1017/CBO9780511712234

URL: Volltext  (URL des Erstveröffentlichers)

URL: lizenzpflichtig

URL: Volltext  (Access by subscription)

UID:

Format: 1 online resource (xix, 494 pages) : , digital, PDF file(s).

ISBN: 9781922064592

Content: Worrorra is a highly polysynthetic language, characterised by overarching concord and a high degree of morphological fusion. Verbal semantics involve a voicing opposition and an extensive system of evidentiality-marking. Worrorra has elaborate systems of pragmatic reference, a derivational morphology that projects agreement-class concord across most lexical categories and complex predicates that incorporate one verb within another. Nouns are distributed among five genders, the intensional properties of which define dynamic oppositions between men and women on the one hand, and earth and sky on the other.

Note: Title from publisher's bibliographic system (viewed on 02 Oct 2015). , Contents summary -- Introduction: Patsy Lulpunda, Amy Peters and Daisy Utemorrah; Geography; Worrorra society; History; How this grammar came to be written; Descriptive tools; What kind of language is Worrorra?; -- Segmental phonology -- Morphophonology -- Nouns and noun classes -- Indicative mood and basic verbal morphology -- Adjectives and inalienable nouns -- Pronouns, demonstratives, anaphors, deictics -- Optative, counterfactual and exercitive moods -- Number -- Adverbs and postpostional phrases -- Complex predicates -- Experiencer constructions -- Objects and possession -- Complement clauses -- Subjunctive verbs -- Middle voice -- Discourse cohesion -- Kinship terms -- Appendices: Texts : Amy Peters: extract from Dawarraweyi; Amy Peters: Kanunerri Warruwarlu -- Irregular verb paradigms ; Transitive verb paradigm; The role-and-reference account of predicate linkage. , Also available in print form. , English

Additional Edition: Print version: ISBN 9781922064561

Language: English

URL: Volltext

URL: Volltext  (lizenzpflichtig)

UID:

Format: 1 online resource (342 pages) : , digital, PDF file(s).

ISBN: 9780511570681 (ebook)

Content: This collection of essays offers a conspectus of major trends in the philosophy of logic and philosophy of mathematics. A distinguished group of philosophers addresses issues at the centre of contemporary debate: semantic and set-theoretic paradoxes, the set/class distinction, foundations of set theory, mathematical intuition and many others. The volume includes Hilary Putnam's 1995 Alfred Tarski lectures.

Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , Paradox revisited I: truth, Paradox revisited II: sets -- a case of all or none? / Hilary Putnam -- Truthlike and truthful operators / Arnold Koslow -- 'Everything' / Vann McGee -- On second-order logic and natural language / James Higginbotham -- The logical roots of indeterminacy / Gila Sher -- The logic of full belief / Isaac Levi -- Immediacy and the birth of reference in Kant: the case for space / Carl J. Posy -- Geometry, construction and intuition in Kant and his successors / Michael Friedman -- Parsons on mathematical intuition and obviousness / Michael D. Resnik -- Gödel and Quine on meaning and mathematics / Richard Tieszen -- Must we believe in set theory? / George Boolos -- Cantor's Grundlagen and the paradoxes of set theory / W.W. Tait -- Ferge, the natural numbers, and natural kinds / Mark Steiner -- A theory of sets and classes / Penelope Maddy -- Challenges to predicative foundations of arithmetic / Solomon Feferman and Geoffrey Hellman.

Additional Edition: Print version: ISBN 9780521650762

Language: English

Subjects: Philosophy

URL: https://doi.org/10.1017/CBO9780511570681

URL: https://doi.org/10.1017/CBO9780511570681

URL: Volltext  (lizenzpflichtig)

URL: Inhaltstext

UID:

Format: XXIV, 411 p. 88 illus. , online resource.

ISBN: 9783662545805

Series Statement: Lecture Notes in Computer Science, 10206

Content: The two-book set LNCS 10205 + 10206 constitutes the proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 48 full papers, 4 tool demonstration papers, and 12 software competition papers presented in these volumes were carefully reviewed and selected from 181 submissions to TACAS and 32 submissions to the software competition. They were organized in topical sections named: verification techniques; learning; synthesis; automata; concurrency and bisimulation; hybrid systems; security; run-time verification and logic; quantitative systems; SAT and SMT; and SV COMP. .

Note: Security -- Static Detection of DoS Vulnerabilities in Programs that use Regular Expressions -- Discriminating Traces with Time -- Directed Automated Memory Performance Testing -- Context-bounded Analysis for POWER -- Run-Time Verification and Logic. -Rewriting-Based Runtime Verification of Alternation-Free HyperLTL Formulas -- Almost Event-Rate Independent Monitoring of Metric Temporal Logic -- Optimal Translation of LTL to Limit Deterministic Automata -- Quantitative Systems -- Sequential Convex Programming for the Efficient Verification of Parametric MDPs -- JANI: Quantitative Model and Tool Interaction -- Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults -- Long-run Rewards for Markov Automata -- SAT and SMT -- HiFrog: SMT-based Function Summarization for Software Verification -- Congruence Closure with Free Variables -- On Optimization Modulo Theories, MaxSMT and Sorting Networks. - The automatic detection of token structures and invariants using SAT checking -- Maximizing the Conditional Expected Reward for Reaching the Goal. -ARES: Adaptive Receding-Horizon Synthesis of Optimal Plans. - FlyFast: A Mean Field Model Checker. -ERODE: A Tool for the Evaluation and Reduction of Ordinary Differential Equations -- SV COMP -- Software Verification with Validation of Results (Report on SV-COMP 2017) -- AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs (Competition Contribution) -- CPA-BAM-BnB: Block-Abstraction Memoization and Region-based Memory Models for Predicate Abstractions (Competition Contribution) -- DepthK: A k-Induction Verifier Based on Invariant Inference for C Programs (Competition Contribution) -- Forester: From Heap Shapes to Automata Predicates (Competition Contribution) -- HipTNT+: A Termination and Non-termination Analyzer by Second-order Abduction (Competition Contribution) -- Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation (Competition Contribution) -- Skink: Static Analysis of LLVM Intermediate Representation (Competition contribution) -- Symbiotic 4: Beyond Reachability (Competition Contribution) -- Optimizing and Caching SMT Queries in SymDIVINE (Competition Contribution) -- Ultimate Automizer with an On-demand Construction of Floyd-Hoare Automata (Competition Contribution) -- Ultimate Taipan: Trace Abstraction and Abstract Interpretation (Competition Contribution) -- VeriAbs : Verification by Abstraction (Competition Contribution). .

In: Springer eBooks

Additional Edition: Printed edition: ISBN 9783662545799

Language: English

Subjects: Computer Science

Keywords: Konferenzschrift ; Konferenzschrift

DOI: 10.1007/978-3-662-54580-5

URL: http://dx.doi.org/10.1007/978-3-662-54580-5

URL: Volltext  (URL des Erstveröffentlichers)

URL: Volltext  (URL des Erstveröffentlichers)

URL: Volltext  (lizenzpflichtig)

URL: Inhaltstext

UID:

Format: 1 online resource (XV, 772 p. 1 illus.)

Edition: 1st ed. 2020.

ISBN: 3-030-44914-9

Series Statement: Theoretical Computer Science and General Issues, 12075

Content: This open access book constitutes the proceedings of the 29th European Symposium on Programming, ESOP 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The papers deal with fundamental issues in the specification, design, analysis, and implementation of programming languages and systems. .

Note: Intro -- ETAPS Foreword -- Preface -- Organization -- Formal Methods for Evolving Database Applications (Abstract of Keynote Talk) -- Contents -- Trace-Relating Compiler Correctness and Secure Compilation -- Introduction -- Trace-Relating Compiler Correctness -- Property Mappings -- Trace Relations and Property Mappings -- Preservation of Subset-Closed Hyperproperties -- Instances of Trace-Relating Compiler Correctness -- Undefined Behavior -- Resource Exhaustion -- Different Source and Target Values -- Abstraction Mismatches -- Trace-Relating Compilation and Noninterference Preservation -- Trace-Relating Secure Compilation -- Trace-Relating Secure Compilation: A Spectrum of Trinities -- Instance of Trace-Relating Robust Preservation of Trace Properties -- Instances of Trace-Relating Robust Preservation of Safety and Hypersafety -- Related Work -- Conclusion and Future Work -- Acknowledgements -- Bibliography -- Runners in action -- 1 Introduction -- 2 Algebraic effects, handlers, and runners -- 2.1 Algebraic effects and handlers -- 2.2 Runners -- 3 Programming with runners -- 3.1 The user and kernel monads -- 3.2 Runners as a programming construct -- 4 A calculus for programming with runners -- 4.1 Types -- 4.2 Values and computations -- 4.3 Type system -- 4.4 Equational theory -- 5 Denotational semantics -- 5.1 Semantics of types -- 5.2 Semantics of values and computations -- 5.3 Coherence, soundness, and finalisation theorems -- 6 Runners in action -- 7 Implementation -- 8 Related work -- 9 Conclusion and future work -- References -- On the Versatility of Open Logical Relations -- 1 Introduction -- 2 The Playground -- 3 A Fundamental Gap -- 4 Warming Up: A Containment Theorem -- 5 Automatic Differentiation -- 6 On Refinement Types and Local Continuity -- 6.1 A Refinement Type System Ensuring Local Continuity -- 6.2 Basic Typing Rules. , 6.3 Typing Conditionals -- 6.4 Open-logical Predicates for Refinement Types -- 7 Related Work -- 8 Conclusion and Future Work -- References -- Constructive Game Logic -- 1 Introduction -- 2 Related Work -- 3 Syntax -- 3.1 Example Games -- 4 Semantics -- 4.1 Realizers -- 4.2 Formula and Game Semantics -- 4.3 Demonic Semantics -- 5 Proof Calculus -- 6 Theory: Soundness -- 7 Operational Semantics -- 8 Theory: Constructivity -- 9 Conclusion and Future Work -- References -- Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis -- 1 Introduction -- 2 Preliminaries -- 2.1 The IFDS Framework -- 2.2 Trees and Tree Decompositions -- 3 Problem definition -- 4 Treewidth-based Data-ow Analysis -- 4.1 Preprocessing -- 4.2 Word Tricks -- 4.3 Answering Queries -- 4.4 Parallelizability and Optimality -- 5 Experimental Results -- 6 Conclusion -- References -- Concise Read-Only Specifications for Better Synthesis of Programs with Pointers -- 1 Introduction -- 1.1 Correct Programs that Do Strange Things -- 1.2 Towards Simple Read-Only Specifications for Synthesis -- 1.3 Our Contributions -- 2 Program Synthesis with Read-Only Borrows -- 2.1 Basics of SSL-based Deductive Program Synthesis -- 2.2 Reducing Non-Determinism with Read-Only Annotations -- 2.3 Composing Read-Only Borrows -- 2.4 Borrow-Polymorphic Inductive Predicates -- 3 BoSSL: Borrowing Synthetic Separation Logic -- 3.1 BoSSL rules -- 3.2 Memory Model -- 3.3 Soundness -- 4 Implementation and Evaluation -- 4.1 Experimental Setup -- 4.2 Performance and Quality of the Borrowing-Aware Synthesis -- 4.3 Stronger Correctness Guarantees -- 4.4 Robustness under Synthesis Perturbations -- 5 Limitations and Discussion -- 6 Related Work -- 7 Conclusion -- References -- Soundness conditions for big-step semantics -- 1 Introduction -- 2 A meta-theory for big-step semantics -- 3 Extended semantics. , 3.1 Traces -- 3.2 Wrong -- 4 Expressing and proving soundness -- 4.1 Expressing soundness -- 4.2 Conditions ensuring soundness-must -- 4.3 Conditions ensuring soundness-may -- 5 Examples -- 5.1 Simply-typed -calculus with recursive types -- 5.2 MiniFJ& -- -λ -- 5.3 Intersection and union types -- 5.4 MiniFJ& -- O -- 6 The partial evaluation construction -- 7 Related work -- 8 Conclusion and future work -- Acknowledgments -- References -- Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap -- 1 Introduction -- 1.1 Examples -- 1.2 Generalizing the Approach -- 2 A-Normal Form λ- Calculus -- 3 Background -- 3.1 Semantic Domains -- 3.2 Concrete Semantics -- 3.3 Abstracting Abstract Machines with Garbage Collection -- 3.4 Stack-Precise CFA with Garbage Collection -- 3.5 The k-CFA Context Abstraction -- 4 From Threaded to Compositional Stores -- 4.1 Threaded-Store Semantics -- 4.2 Threaded-Store Semantics with Effect Log -- 4.3 Compositional-Store Semantics -- 4.4 Compositional-Store Semantics with Garbage Collection -- 5 Abstract Compositional-Store Semantics with Garbage Collection -- 6 Discussion -- 6.1 The Effects of Treating the Store Compositionally -- 6.2 The Effect of Treating the Time Compositionally -- 7 Related Work -- 8 Conclusion and Future Work -- References -- SMT-Friendly Formalization of the Solidity Memory Model -- 1 Introduction -- 2 Background -- 2.1 Ethereum -- 2.2 Solidity -- 2.3 SMT-Based Programs -- 3 Formalization -- 3.1 Types -- 3.2 Local Storage Pointers -- 3.3 Contracts, State Variables, Functions -- 3.4 Statements -- 3.5 Assignments -- 3.6 Expressions -- 4 Evaluation -- 5 Related Work -- 6 Conclusion -- References -- Exploring Type-Level Bisimilarity towards More Expressive Multiparty Session Types -- 1 Introduction -- 2 Overview of our Approach -- 3 An MPST Theory with +, ∃, and ll. , 3.1 Types as Process Algebraic Terms -- 3.2 Global Types and Local Types -- 3.3 End-Point Projection: from Global Types to Local Types -- 3.4 Weak Bisimilarity of Global Types, Local Types, and Groups -- 3.5 Well-formedness of Global Types -- 3.6 Correctness of Projection under Well-Formedness -- 3.7 Decidability of Checking Well-Formedness -- 3.8 Discussion of Challenges -- 4 Practical Experience with the Theory -- 4.1 Implementation -- 4.2 Evaluation of the Approach -- 5 Related Work -- 6 Conclusion -- References -- Verifying Visibility-Based Weak Consistency -- 1 Introduction -- 2 Weak Consistency -- 2.1 Weak-Visibility Specifications -- 2.2 Consistency against Weak-Visibility Specifications -- 3 Establishing Consistency with Forward Simulation -- 3.1 Reducing Consistency to Safety Verification -- 3.2 Verifying Implementations -- 4 Proof Methodology -- 5 Implementation and Evaluation -- 6 Related Work -- 7 Conclusion and Future Work -- A Appendix: Proofs to Theorems and Lemmas -- References -- Local Reasoning for Global Graph Properties -- 1 Introduction -- 2 The Foundational Flow Framework -- 2.1 Preliminaries and Notation -- 2.2 Flows -- 2.3 Flow Graph Composition and Abstraction -- 3 Proof Technique -- 3.1 Encoding Flow-based Proofs in SL -- 3.2 Proof of the PIP -- 4 Advanced Flow Reasoning and the Harris List -- 4.1 The Harris List Algorithm -- 4.2 Product Flows for Reasoning about Overlays -- 4.3 Contextual Extensions and the Replacement Theorem -- 4.4 Existence and Uniqueness of Flows -- 4.5 Proof of the Harris List -- 5 Related Work -- 6 Conclusions and Future Work -- References -- Aneris: A Mechanised Logic for Modular Reasoning about Distributed Systems -- 1 Introduction -- 2 The Core Concepts of Aneris -- 2.1 Local and Thread-Local Reasoning -- 2.2 Node-Local Reasoning -- 2.3 Example: An Addition Service -- 2.4 Example: A Lock Server. , 3 AnerisLang -- 4 The Aneris Logic -- 4.1 The Program Logic -- 4.2 Adequacy for Aneris -- 5 Case Study 1: A Load Balancer -- 6 Case Study 2: Two-Phase Commit -- 6.1 A Replicated Log -- 7 Related Work -- 8 Conclusion -- Acknowledgments -- Bibliography -- Continualization of Probabilistic Programs With Correction -- 1 Introduction -- 2 Example -- 2.1 Continualization -- 2.2 Parameter Synthesis -- 2.3 Improving Inference -- 3 Syntax and Semantics of Programs -- 3.1 Source Language Syntax -- 3.2 Semantics -- 4 Continualizing Probabilistic Programs -- 4.1 Overview of the Algorithm -- 4.2 Distribution and Expression Transformations -- 4.3 Inuence Analysis and Control-Flow Correction of Predicates -- 4.4 Bringing it all together: Full Program Transformations -- 5 Synthesis of Continuity Correction Parameters -- 5.1 Optimization Framework -- 5.2 Optimization Algorithm -- 6 Methodology -- 6.1 Benchmarks -- 6.2 Experimental Setup -- 7 Evaluation -- 7.1 RQ1: Benefits of Continualization -- 7.2 RQ2: Impact of Smoothing Factors -- 7.3 RQ3: Extending Results to Other Systems -- 8 Related Work -- 9 Conclusion -- References -- Semantic Foundations for Deterministic Dataflow and Stream Processing -- 1 Introduction -- 2 Monoids as Types for Streams -- 3 Stream Transductions -- 4 Model of Computation -- 5 Combinators for Deterministic Dataow -- 6 Algebraic Reasoning for Optimizing Transformations -- 7 Related Work -- 8 Conclusion -- References -- Connecting Higher-Order Separation Logic to a First-Order Outside World -- 1 Introduction -- 2 Background: Ghost State in Separation Logic -- 2.1 Ghost Algebras -- 3 External State as Ghost State -- 4 Verifying C Programs with I/O in VST -- 5 Soundness of External-State Reasoning -- 6 Connecting VST to CertiKOS -- 6.1 CertiKOS Specifications -- 6.2 Relating OS and User State -- 6.3 Soundness of VST + CertiKOS. , 7 From syscall-level to hardware-level interactions. , English

Additional Edition: ISBN 3-030-44913-0

Language: English

Subjects: Computer Science

Keywords: Konferenzschrift

DOI: 10.1007/978-3-030-44914-8

URL: kostenfrei

UID:

Format: X, 318 S. : graph. Darst.

Edition: 1. publ.

ISBN: 0-521-56233-3

Series Statement: Cambridge studies in linguistics 80

Content: One of the basic premises of the theory of syntax is that clause structures can be minimally identified as containing a verb phrase, playing the role of predicate, and a noun phrase, playing the role of subject. In this study Andrea Moro identifies a new category of copular sentences, namely inverse copular sentences, where the noun phrase which co-occurs with the verb phrase plays the role of predicate, occupying the position which is canonically reserved for subjects, and the subject is embedded in the verb phrase

Content: The consequences of such a discovery are pervasive. Four distinct areas of syntax are unified into a unique natural class. Along with inverse copular sentences, existential sentences, sentences with seem and unaccusative constructions are analysed as involving the raising of a predicative noun phrase to the most prominent position in the clause structure. In addition, new light is shed on some classical issues such as the distribution and nature of expletives, locality theory, cliticization phenomena, possessive constructions and the cross-linguistic variations of the Definiteness Effect

Language: English

Subjects: Comparative Studies. Non-European Languages/Literatures

Keywords: Raising ; Prädikat ; Nominalphrase ; Raising ; Nominalphrase

URL: http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007527720&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA

URL: Inhaltsverzeichnis

URL: http://www.loc.gov/catdir/toc/cam023/96007773.html

URL: http://www.loc.gov/catdir/description/cam027/96007773.html

URL: http://www.loc.gov/catdir/enhancements/fy0827/96007773-b.html

URL: http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007527720&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA