|
|
|
|
| LEADER |
03258nam a22005415i 4500 |
| 001 |
978-3-642-16310-4 |
| 003 |
DE-He213 |
| 005 |
20151204142915.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
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.6-76.66
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 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.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|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 Lecture Notes in Computer Science,
|x 0302-9743 ;
|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 science.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Programming languages (Electronic computers).
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Software Engineering/Programming and Operating Systems.
|
| 650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 700 |
1 |
|
|a Ölveczky, Peter Csaba.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642163098
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 6381
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-16310-4
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
