|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-642-16310-4 |
003 |
DE-He213 |
005 |
20230222111459.0 |
007 |
cr nn 008mamaa |
008 |
101001s2010 gw | s |||| 0|eng d |
020 |
|
|
|a 9783642163104
|9 978-3-642-16310-4
|
024 |
7 |
|
|a 10.1007/978-3-642-16310-4
|2 doi
|
050 |
|
4 |
|a QA76.6-76.66
|
072 |
|
7 |
|a UM
|2 bicssc
|
072 |
|
7 |
|a COM051000
|2 bisacsh
|
072 |
|
7 |
|a UM
|2 thema
|
082 |
0 |
4 |
|a 005.11
|2 23
|
245 |
1 |
0 |
|a Rewriting Logic and Its Applications
|h [electronic resource] :
|b 8th International Workshop, WRLA 2010, Held as a Satellite Event of ETAPS 2010, Paphos, Cyprus, March 20-21, 2010, Revised Selected Papers /
|c edited by Peter Csaba Ölveczky.
|
250 |
|
|
|a 1st ed. 2010.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2010.
|
300 |
|
|
|a X, 264 p. 44 illus.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6381
|
505 |
0 |
|
|a Invited 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 |
|a Computer programming.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Compilers (Computer programs).
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Machine theory.
|
650 |
1 |
4 |
|a Programming Techniques.
|
650 |
2 |
4 |
|a Software Engineering.
|
650 |
2 |
4 |
|a Compilers and Interpreters.
|
650 |
2 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
700 |
1 |
|
|a Ölveczky, Peter Csaba.
|e editor.
|0 (orcid)0000-0002-0708-3721
|1 https://orcid.org/0000-0002-0708-3721
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642163098
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642163111
|
830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6381
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-16310-4
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-SXCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (SpringerNature-11645)
|
950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|