000 | 03492nam a22005775i 4500 | ||
---|---|---|---|
001 | 978-3-642-16310-4 | ||
003 | DE-He213 | ||
005 | 20240730193728.0 | ||
007 | cr nn 008mamaa | ||
008 | 101001s2010 gw | s |||| 0|eng d | ||
020 |
_a9783642163104 _9978-3-642-16310-4 |
||
024 | 7 |
_a10.1007/978-3-642-16310-4 _2doi |
|
050 | 4 | _aQA76.6-76.66 | |
072 | 7 |
_aUM _2bicssc |
|
072 | 7 |
_aCOM051000 _2bisacsh |
|
072 | 7 |
_aUM _2thema |
|
082 | 0 | 4 |
_a005.11 _223 |
245 | 1 | 0 |
_aRewriting Logic and Its Applications _h[electronic resource] : _b8th International Workshop, WRLA 2010, Held as a Satellite Event of ETAPS 2010, Paphos, Cyprus, March 20-21, 2010, Revised Selected Papers / _cedited by Peter Csaba Ölveczky. |
250 | _a1st ed. 2010. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010. |
|
300 |
_aX, 264 p. 44 illus. _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 ; _v6381 |
|
505 | 0 | _aInvited Talks -- Rewriting, Inference, and Proof -- Twenty Years of Rewriting Logic -- Termination and Narrowing -- Proving Termination in the Context-Sensitive Dependency Pair Framework -- A Dependency Pair Framework for A???C-Termination -- Folding Variant Narrowing and Optimal Variant Termination -- Tools -- A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications -- A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories -- The K Framework -- K-Maude: A Rewriting Based Tool for Semantics of Programming Languages -- Collecting Semantics under Predicate Abstraction in the K Framework -- Applications and Semantics -- Concurrent Rewriting Semantics and Analysis of Asynchronous Digital Circuits -- A Formal Pattern Architecture for Safe Medical Systems -- On the Behavioral Semantics of Real-Time Domain Specific Visual Languages -- Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding -- Maude Model Checking and Debugging -- The Linear Temporal Logic of Rewriting Maude Model Checker -- Enhancing the Debugging of Maude Specifications -- Rewrite Engines -- The Third Rewrite Engines Competition. | |
650 | 0 |
_aComputer programming. _94169 |
|
650 | 0 |
_aSoftware engineering. _94138 |
|
650 | 0 |
_aCompilers (Computer programs). _93350 |
|
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aMachine theory. _9154323 |
|
650 | 1 | 4 |
_aProgramming Techniques. _9154324 |
650 | 2 | 4 |
_aSoftware Engineering. _94138 |
650 | 2 | 4 |
_aCompilers and Interpreters. _931853 |
650 | 2 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9154325 |
700 | 1 |
_aÖlveczky, Peter Csaba. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9154326 |
|
710 | 2 |
_aSpringerLink (Online service) _9154327 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642163098 |
776 | 0 | 8 |
_iPrinted edition: _z9783642163111 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6381 _9154328 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-16310-4 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c94838 _d94838 |