| 000 | 03619nam a22004215i 4500 | ||
|---|---|---|---|
| 999 |
_c334844 _d334844 _x1 |
||
| 001 | 334844 | ||
| 003 | ES-MaUEC | ||
| 005 | 20230102114754.0 | ||
| 006 | a||||fo|||| 00| 0 | ||
| 007 | cr nn nnnaamaa | ||
| 008 | 210212s2021 gw | s |||| 0|eng d | ||
| 020 | _a9783030684464 | ||
| 024 | 7 |
_a10.1007/978-3-030-68446-4 _2doi |
|
| 040 |
_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC |
||
| 050 | 4 |
_aQA76.63 _b2021 EB |
|
| 245 | 0 | 0 |
_aLogic-Based Program Synthesis and Transformation : _b30th International Symposium, LOPSTR 2020, Bologna, Italy, September 7-9, 2020, Proceedings _cedited by Maribel Fernández |
| 250 | _aFirst edition 2021 | ||
| 264 | 1 |
_aCham, Switzerland _bSpringer International Publising _c2021 |
|
| 300 |
_a1 recurso en línea (X, 345 páginas) _b64 ilustraciones, 1 ilustraciones a color |
||
| 336 |
_2rdacontent _aTexto _btxt |
||
| 337 |
_2rdamedia _aelectrónico _bc |
||
| 338 |
_2rdacarrier _arecurso electrónico _bcr |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 0 |
_aTheoretical Computer Science and General Issues ; _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 | 3 | _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. | |
| 988 | _aSpringer_Computer_2021 | ||
| 650 | 7 |
_2embne _aProgramación lógica _9160750 |
|
| 700 | 1 |
_aFernández, Maribel _eeditor literario _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783030684457 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783030684471 |
| 856 | 4 | 0 |
_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-68446-4 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid) |
| 942 |
_2lcc _cLE |
||
| 998 |
_b06/2021 _dz _eIG _zSI |
||