My Account Log in

1 option

Logic-Based Program Synthesis and Transformation : 30th International Symposium, LOPSTR 2020, Bologna, Italy, September 7-9, 2020, Proceedings / edited by Maribel Fernández.

SpringerLink Books Computer Science (2011-2024) Available online

View online
Format:
Book
Contributor:
Fernández, Maribel, Editor.
SpringerLink (Online service)
Series:
Computer Science (SpringerNature-11645)
LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 12561
Theoretical Computer Science and General Issues, 2512-2029 ; 12561
Language:
English
Subjects (All):
Computer science.
Artificial intelligence.
Software engineering.
Machine theory.
Computer engineering.
Computer networks.
Computer Science Logic and Foundations of Programming.
Artificial Intelligence.
Software Engineering.
Formal Languages and Automata Theory.
Computer Engineering and Networks.
Local Subjects:
Computer Science Logic and Foundations of Programming.
Artificial Intelligence.
Software Engineering.
Formal Languages and Automata Theory.
Computer Engineering and Networks.
Physical Description:
1 online resource (X, 345 pages) : 64 illustrations, 1 illustrations in color.
Edition:
1st ed. 2021.
Contained In:
Springer Nature eBook
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2021.
System Details:
text file PDF
Summary:
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.
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-3-030-68446-4
9783030684464
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account