000 | 03315nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-540-45607-0 | ||
003 | DE-He213 | ||
005 | 20240423132431.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2002 gw | s |||| 0|eng d | ||
020 |
_a9783540456070 _9978-3-540-45607-0 |
||
024 | 7 |
_a10.1007/3-540-45607-4 _2doi |
|
050 | 4 | _aQA76.758 | |
072 | 7 |
_aUMZ _2bicssc |
|
072 | 7 |
_aCOM051230 _2bisacsh |
|
072 | 7 |
_aUMZ _2thema |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aLogic Based Program Synthesis and Transformation _h[electronic resource] : _b11th International Workshop, LOPSTR 2001, Paphos, Cyprus, November 28-30, 2001. Selected Papers / _cedited by Alberto Pettorossi. |
250 | _a1st ed. 2002. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2002. |
|
300 |
_aVIII, 272 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2372 |
|
505 | 0 | _aInvited Speaker -- Static Analysis for Safe Destructive Updates in a Functional Language -- Program Transformation and Equivalence -- A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs -- On Deforesting Parameters of Accumulating Maps -- Equivalence in Answer Set Programming -- Program Verificaion -- Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols -- Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking -- Verification of Sets of Infinite State Processes Using Program Transformation -- Program Analysis -- When Size Does Matter -- Symbolic Profiling for Multi-paradigm Declarative Languages -- Program Development -- Correct Object-Oriented Systems in Computational Logic -- A Framework for Developing Embeddable Customized Logics -- Computing Environment-Aware Agent Behaviours with Logic Program Updates -- Program Synthesis -- Extracting General Recursive Program Schemes in Nuprl’s Type Theory -- Extracting Exact Time Bounds from Logical Proofs. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aComputer systems. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aMachine theory. | |
650 | 1 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aComputer System Implementation. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
700 | 1 |
_aPettorossi, Alberto. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540439158 |
776 | 0 | 8 |
_iPrinted edition: _z9783662197417 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2372 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-45607-4 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c187701 _d187701 |