Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    almahu_9948654290602882
    Format: X, 345 p. 64 illus., 1 illus. in color. , online resource.
    Edition: 1st ed. 2021.
    ISBN: 9783030684464
    Series Statement: Theoretical Computer Science and General Issues ; 12561
    Content: This book constitutes the refereed proceedings of the 30th International Conference on Logic-Based Program Synthesis and Transformation, LOPSTR 2020, which was held during September 7-9, 2020. The 15 papers presented in this volume were carefully reviewed and selected from a total of 31 submissions. The book also contains two invited talks in full paper length. The contributions were organized in topical sections named: rewriting; unification; types; verification; model checking and probabilistic programming; program analysis and testing; and logics.
    Note: Rewriting -- Symbolic Computation in Maude: Some Tapas (Invited Paper) -- Runtime Complexity Analysis of Logically Constrained Rewriting -- Con uence and Commutation for Nominal Rewriting Systems with Atom Variables -- Pattern eliminating transformations -- Unification -- Nominal Uni cation with Letrec and Environment-Variables -- Terminating Non-Disjoint Combined Unification -- Types -- slepice: Towards a Verified Implementation of Type Theory in Type Theory -- Resourceful Program Synthesis from Graded Linear Types -- Verification -- On Constrained Horn Clauses and Program Veri cation (Invited Paper) -- Algorithm Selection for Dynamic Symbolic Execution: a Preliminary Study -- Translation of Interactive Datalog Programs for Microcontrollers to Finite State Machines -- Model Checking and Probabilistic Programming -- Generating Functions for Probabilistic Programs -- Verification of Multiplayer Stochastic Games via Abstract Dependency Graphs -- Program Analysis and Testing -- Testing Your (Static Analysis) Truths -- Slicing unconditional jumps with unnecessary control dependencies -- Logics -- A Formal Model for a Linear Time Correctness Condition of Proof Nets of Multiplicative Linear Logic -- Synthesis of Modality De nitions and a Theorem Prover for Epistemic Intuitionistic Logic.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783030684457
    Additional Edition: Printed edition: ISBN 9783030684471
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages