04713nam 22006975 450 99646566240331620200704102004.03-540-38416-210.1007/3-540-54496-8(CKB)1000000000233707(SSID)ssj0000326164(PQKBManifestationID)11248954(PQKBTitleCode)TC0000326164(PQKBWorkID)10296309(PQKB)10751190(DE-He213)978-3-540-38416-8(PPN)155168215(EXLCZ)99100000000023370720121227d1991 u| 0engurnn|008mamaatxtccrRecent Trends in Data Type Specification[electronic resource] 7th Workshop on Specification of Abstract Data Types, Wusterhausen/Dosse, Germany, April 17-20, 1990. Proceedings /edited by Hartmut Ehrig, Klaus P. Jantke, Fernando Orejas, Horst Reichel1st ed. 1991.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1991.1 online resource (VIII, 384 p.) Lecture Notes in Computer Science,0302-9743 ;534Bibliographic Level Mode of Issuance: Monograph0-387-54496-8 3-540-54496-8 ADT implementation and completion by induction from examples -- An association of Algebraic term nets and abstract data types for specifying real communication protocols -- The specification language GSBL -- Composition of algebraic high-level nets -- A match operation for rule-based modular system design -- Towards object-oriented algebraic specifications -- Inductive completion for transformation of equational specifications -- A notion of implementation for the specification language OBSCURE -- Model-theoretic specifications and back-and-forth equivalences -- Universal algebra in higher types -- Clausal rewriting: Applications and implementation -- Constraints for behavioural specifications -- Entities: An institution for dynamic systems -- A 2-category approach to critical pair completion -- A kernel specification formalism with higher-order parameterisation -- Extended ML: Past, present and future -- Dependent types considered necessary for specification languages -- Generic types in a language for data directed design -- Design of a compiler for lazy pattern driven narrowing.The algebraic specification of abstract data types is now a well establishedresearch topic in computer science. This area influences both applications and theoretical foundations of methodologies which support the design and formal development of reliable software. The Seventh Workshop on Specification of Abstract Data Types took place in Wusterhausen/Dosse, April17-20, 1990, and was organized in cooperation with the ESPRIT Basic Research Working Group COMPASS. The main topics covered by the workshop were: - Modularization - Object orientation - Higher-order types anddependent types - Inductive completion - Algebraic high-level nets.Lecture Notes in Computer Science,0302-9743 ;534Computer programmingProgramming languages (Electronic computers)Computer logicSoftware engineeringProgramming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Programming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XSoftware Engineeringhttps://scigraph.springernature.com/ontologies/product-market-codes/I14029Computer programming.Programming languages (Electronic computers).Computer logic.Software engineering.Programming Techniques.Programming Languages, Compilers, Interpreters.Logics and Meanings of Programs.Software Engineering.005.7/3Ehrig Hartmutedthttp://id.loc.gov/vocabulary/relators/edtJantke Klaus Pedthttp://id.loc.gov/vocabulary/relators/edtOrejas Fernandoedthttp://id.loc.gov/vocabulary/relators/edtReichel Horstedthttp://id.loc.gov/vocabulary/relators/edtWorkshop on Specification of Abstract Data TypesBOOK996465662403316Recent Trends in Data Type Specification2829876UNISA04619nam 22007935 450 99646584620331620230221173710.01-280-38700-997866135649243-642-13509-910.1007/978-3-642-13509-5(CKB)2670000000028927(SSID)ssj0000446342(PQKBManifestationID)11299743(PQKBTitleCode)TC0000446342(PQKBWorkID)10495960(PQKB)11491993(DE-He213)978-3-642-13509-5(MiAaPQ)EBC3065453(PPN)149063717(EXLCZ)99267000000002892720100625d2010 u| 0engurnn|008mamaatxtccrCombinatorial Pattern Matching[electronic resource] 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010, Proceedings, /edited by Amihood Amir, Laxmi Parida1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (XIII, 362 p. 84 illus.) Theoretical Computer Science and General Issues,2512-2029 ;6129Bibliographic Level Mode of Issuance: Monograph3-642-13508-0 Includes bibliographical references and index.Algorithms for Forest Pattern Matching -- Affine Image Matching Is Uniform -Complete -- Old and New in Stringology -- Small-Space 2D Compressed Dictionary Matching -- Bidirectional Search in a String with Wavelet Trees -- A Minimal Periods Algorithm with Applications -- The Property Suffix Tree with Dynamic Properties -- Approximate All-Pairs Suffix/Prefix Overlaps -- Succinct Dictionary Matching with No Slowdown -- Pseudo-realtime Pattern Matching: Closing the Gap -- Breakpoint Distance and PQ-Trees -- On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs -- Succinct Representations of Separable Graphs -- Implicit Hitting Set Problems and Multi-genome Alignment -- Bounds on the Minimum Mosaic of Population Sequences under Recombination -- The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection -- Phylogeny- and Parsimony-Based Haplotype Inference with Constraints -- Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks -- Mod/Resc Parsimony Inference -- Extended Islands of Tractability for Parsimony Haplotyping -- Sampled Longest Common Prefix Array -- Verifying a Parameterized Border Array in O(n 1.5) Time -- Cover Array String Reconstruction -- Compression, Indexing, and Retrieval for Massive String Data -- Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality -- A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach -- Algorithms for Three Versions of the Shortest Common Superstring Problem -- Finding Optimal Alignment and Consensus of Circular Strings -- Optimizing Restriction Site Placement for Synthetic Genomes -- Extension and Faster Implementation of the GRP Transform for Lossless Compression -- Parallel and Distributed Compressed Indexes.Theoretical Computer Science and General Issues,2512-2029 ;6129Pattern recognition systemsLife sciencesComputer programmingAlgorithmsArtificial intelligence—Data processingData miningAutomated Pattern RecognitionLife SciencesProgramming TechniquesAlgorithmsData ScienceData Mining and Knowledge DiscoveryPattern recognition systems.Life sciences.Computer programming.Algorithms.Artificial intelligence—Data processing.Data mining.Automated Pattern Recognition.Life Sciences.Programming Techniques.Algorithms.Data Science.Data Mining and Knowledge Discovery.006.4015116Amir Amihoodedthttp://id.loc.gov/vocabulary/relators/edtParida Laxmiedthttp://id.loc.gov/vocabulary/relators/edtSymposium on Combinatorial Pattern MatchingBOOK996465846203316Combinatorial Pattern Matching772744UNISA