000 04120nam a22006015i 4500
001 978-3-030-68446-4
003 DE-He213
005 20240423125403.0
007 cr nn 008mamaa
008 210212s2021 sz | s |||| 0|eng d
020 _a9783030684464
_9978-3-030-68446-4
024 7 _a10.1007/978-3-030-68446-4
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aLogic-Based Program Synthesis and Transformation
_h[electronic resource] :
_b30th International Symposium, LOPSTR 2020, Bologna, Italy, September 7–9, 2020, Proceedings /
_cedited by Maribel Fernández.
250 _a1st ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aX, 345 p. 64 illus., 1 illus. in color.
_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 ;
_v12561
505 0 _aRewriting -- 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.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 0 _aSoftware engineering.
650 0 _aMachine theory.
650 0 _aComputer engineering.
650 0 _aComputer networks .
650 1 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aArtificial Intelligence.
650 2 4 _aSoftware Engineering.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Engineering and Networks.
700 1 _aFernández, Maribel.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030684457
776 0 8 _iPrinted edition:
_z9783030684471
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12561
856 4 0 _uhttps://doi.org/10.1007/978-3-030-68446-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c177376
_d177376