LEADER 03904nam 22007335 450 001 996465822903316 005 20230222111459.0 010 $a1-280-38973-7 010 $a9786613567659 010 $a3-642-16310-6 024 7 $a10.1007/978-3-642-16310-4 035 $a(CKB)2550000000019882 035 $a(SSID)ssj0000446748 035 $a(PQKBManifestationID)11299325 035 $a(PQKBTitleCode)TC0000446748 035 $a(PQKBWorkID)10497763 035 $a(PQKB)11661550 035 $a(DE-He213)978-3-642-16310-4 035 $a(MiAaPQ)EBC3065951 035 $a(PPN)14902973X 035 $a(EXLCZ)992550000000019882 100 $a20101001d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aRewriting Logic and Its Applications$b[electronic resource] $e8th International Workshop, WRLA 2010, Held as a Satellite Event of ETAPS 2010, Paphos, Cyprus, March 20-21, 2010, Revised Selected Papers /$fedited by Peter Csaba Ölveczky 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (X, 264 p. 44 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6381 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-16309-2 320 $aIncludes bibliographical references and index. 327 $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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6381 606 $aComputer programming 606 $aSoftware engineering 606 $aCompilers (Computer programs) 606 $aComputer science 606 $aMachine theory 606 $aProgramming Techniques 606 $aSoftware Engineering 606 $aCompilers and Interpreters 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 615 0$aComputer programming. 615 0$aSoftware engineering. 615 0$aCompilers (Computer programs). 615 0$aComputer science. 615 0$aMachine theory. 615 14$aProgramming Techniques. 615 24$aSoftware Engineering. 615 24$aCompilers and Interpreters. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 676 $a005.11 702 $aÖlveczky$b Peter Csaba$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aEuropean Joint Conferences on Theory and Practice of Software. 906 $aBOOK 912 $a996465822903316 996 $aRewriting logic and its applications$92247230 997 $aUNISA LEADER 00618nam 2200241zu 450 001 9910916972303321 005 20250811150335.0 010 $a9782918783206 010 $a291878320X 035 $a(CKB)36722361200041 035 $a(EXLCZ)9936722361200041 100 $a20241203d2009 || | 101 0 $afre 135 $aur||||||||||| 200 10$aCombattre et informer 210 $cÉditions Codex$d2009 311 08$a9782918783008 311 08$a2918783005 700 $aMaurin$b Jean-Louis$01236300 906 $aBOOK 912 $a9910916972303321 996 $aCombattre et informer$92870787 997 $aUNINA