%{search_type} search results

• Constructions of Free Commutative Integro-Differential Algebras
• Basic Module Theory over Non-commutative Rings with Computational Aspects of Operator Algebras
• Operational Calculi for Nonlocal Cauchy Problems in Resonance Cases
• Intertwining Laplace Transformations of Linear Partial Differential Equations
• Composing and Factoring Generalized Green's Operators and Ordinary Boundary Problems
• Relativistic Coulomb Integrals and Zeilberger's Holonomic Systems Approach II
• Multivariate Dimension Polynomials of Inversive Difference Field Extensions
• Differential (Monoid) Algebra and More
• Exact Solution of Local and Nonlocal BVPs for the Laplace Equation in a Rectangle.

This book constitutes the proceedings of the 5th International Meeting on Algebraic and Algorithmic Aspects of Differential and Integral Operators, AADIOS 2012, held at the Applications of Computer Algebra Conference in Sofia, Bulgaria, on June 25-28, 2012. The total of 9 papers presented in this volume consists of 2 invited papers and 7 regular papers which were carefully reviewed and selected from 13 submissions. The topics of interest are: symbolic computation for operator algebras, factorization of differential/integral operators, linear boundary problems and green's operators, initial value problems for differential equations, symbolic integration and differential galois theory, symbolic operator calculi, algorithmic D-module theory, rota-baxter algebra, differential algebra, as well as discrete analogs and software aspects of the above.

• Invited Contributions.- List Decoding and Pseudorandom Constructions.- A Survey of Recent Attacks on the Filter Generator.- Iterative List Decoding of LDPC Codes.- Inverted Edwards Coordinates.- Spectra of Boolean Functions, Subspaces of Matrices, and Going Up Versus Going Down.- Efficient List Decoding of Explicit Codes with Optimal Redundancy.- Algebraic Structure Theory of Tail-Biting Trellises.- Nice Codes from Nice Curves.- Regular Contributions.- Generalized Sudan's List Decoding for Order Domain Codes.- Bent Functions and Codes with Low Peak-to-Average Power Ratio for Multi-Code CDMA.- Determining the Nonlinearity of a New Family of APN Functions.- An Improvement of Tardos's Collusion-Secure Fingerprinting Codes with Very Short Lengths.- Space-Time Codes from Crossed Product Algebras of Degree 4.- On Non-randomness of the Permutation After RC4 Key Scheduling.- Correctable Errors of Weight Half the Minimum Distance Plus One for the First-Order Reed-Muller Codes.- Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems.- A Note on a Class of Quadratic Permutations over
• Constructions of Orthonormal Lattices and Quaternion Division Algebras for Totally Real Number Fields.- Quaternary Plotkin Constructions and Quaternary Reed-Muller Codes.- Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes.- On the Key-Privacy Issue of McEliece Public-Key Encryption.- Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function.- Linear Complexity and Autocorrelation of Prime Cube Sequences.- The "Art of Trellis Decoding" Is NP-Hard.- On the Structure of Inversive Pseudorandom Number Generators.- Subcodes of Reed-Solomon Codes Suitable for Soft Decoding.- Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes.- On the Computation of Non-uniform Input for List Decoding on Bezerra-Garcia Tower.- Dense MIMO Matrix Lattices - A Meeting Point for Class Field Theory and Invariant Theory.- Secure Cross-Realm Client-to-Client Password-Based Authenticated Key Exchange Against Undetectable On-Line Dictionary Attacks.- Links Between Discriminating and Identifying Codes in the Binary Hamming Space.- Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity.- A Path to Hadamard Matrices.- The Tangent FFT.- Novel Algebraic Structure for Cyclic Codes.- Distribution of Trace Values and Two-Weight, Self-orthogonal Codes over GF(p, 2).- Generalized Rotation Symmetric and Dihedral Symmetric Boolean Functions ? 9 Variable Boolean Functions with Nonlinearity 242.- On Quasi-cyclic Codes over Integer Residue Rings.- Extended Norm-Trace Codes with Optimized Correction Capability.- On Generalized Hamming Weights and the Covering Radius of Linear Codes.- Homomorphic Encryptions of Sums of Groups.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 17th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-17, held in Bangalore, India, in December 2007. Among the subjects addressed are block codes, including list-decoding algorithms; algebra and codes: rings, fields, algebraic geometry codes; algebra: rings and fields, polynomials, permutations, lattices; cryptography: cryptanalysis and complexity; computational algebra.
(source: Nielsen Book Data)

• Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme.- On the Exact Block Cover Problem.- Minimax Regret k-sink Location Problem in Dynamic Path Network.- Competitive Algorithms for Unbounded One-Way Trading.- The Complexity of Degree Anonymization by Vertex Addition.- Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time Constraints.- Edge-Clique Covers of the Tensor Product.- Protein Name Recognition Based on Dictionary Mining and Heuristics.- A Facility Coloring Problem in 1-D.- Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes.- The Garden Hose Complexity for the Equality Function.- Finding Robust Minimum Cuts.- A Hybrid Genetic Algorithm for Solving the Unsplittable Multicommodity Flow Problem: The Maritime Surveillance Case.- Multiple Sink Location Problems in Dynamic Path Networks.- Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs.- New Lower Bounds on Broadcast Function.- Efficient Memoization for Approximate Function Evaluation over Sequence Arguments.- Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights.- Obtaining Split Graphs by Edge Contraction.- Parameterized Complexity of Connected Induced Subgraph Problems.- Semi-online Hierarchical Load Balancing Problem with Bounded Processing Times.- Restricted Bipartite Graphs: Comparison and Hardness Results.- The Research on Controlling the Iteration of Quantum-Inspired Evolutionary Algorithms for Artificial Neural Networks.- On P3-Convexity of Graphs with Bounded Degree.- The Competitive Diffusion Game in Classes of Graphs.- A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler.- Clustering Performance of 3-Dimensional Hilbert Curves.- Broadcast Networks with Near Optimal Cost.- An Optimal Context for Information Retrieval.- An Auction-Bargaining Model for Initial Emission Permits.
• (source: Nielsen Book Data)

This volume constitutes the proceedings of the International Conference on Algorithmic Aspects in Information and Management, AAIM 2014, held in Vancouver, BC, Canada, in July 2014. The 30 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 45 submissions. The topics cover most areas in discrete algorithms and their applications.
(source: Nielsen Book Data)

• Item Pricing for Combinatorial Public Projects
• Norm-Based Locality Measures of Two-Dimensional Hilbert Curves
• On the Complexity of Clustering with Relaxed Size Constraints
• Superstring Graph: A New Approach for Genome Assembly
• Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
• A Very Fast String Matching Algorithm Based on Condensed Alphabets
• Minimum-Density Identifying Codes in Square Grids
• Separating Codes and Traffic Monitoring
• Know When to Persist: Deriving Value from a Stream Buffer
• Algorithmic Aspects of Upper Domination: A Parameterised Perspective
• On Network Formation Games with Heterogeneous Players and Basic Network Creation Games
• Parameterized Complexity of Team Formation in Social Networks
• Reconstructing Cactus Graphs from Shortest Path Information
• Near-Optimal Dominating Sets via Random Sampling
• A Multivariate Approach for Checking Resiliency in Access Control
• Efficient Algorithms for the Order Preserving Pattern Matching Problem
• Computing the Line-Constrained k-Center in the Plane for Small k
• Online k-max Search Algorithm with Applications to the Secretary Problem.

This volume constitutes the proceedings of the 11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016, held in Bergamo, Italy, in July 2016. The 18 revised full papers presented were carefully reviewed and selected from 41 submissions. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications.

• Minimum Diameter $k$-Steiner Forest.- Factors Impacting the Label Denoising of Neural Relation Extraction.- Makespan Minimization on Unrelated Parallel Machines with a Few Bags.- Channel Assignment with r-Dynamic Coloring.- Profit Maximization Problem with Coupons in Social Networks.- A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem.- A Novel Approach to Verifying Context Free Properties of Programs.- Determination of Dual Distances for a Kind of Perfect Mixed Codes.- Approximation and Competitive Algorithms for Single-Minded Selling Problem.- An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints.- Quality-aware Online Task Assignment Using Latent Topic Model.- Calibration Scheduling with Time Slot Cost.- The k-power domination problem in weighted trees.- General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach.- A Robust Power Optimization Algorithm to Balance Base Stations' Load in LTE-A Network.- Faster Compression of Patterns to Rectangle Rule Lists.- Algorithm Designs for Dynamic Ridesharing System.- New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems.- Computation of Kullback-Leibler Divergence between Labeled Stochastic Systems with Non-Identical State Spaces.- Order preserving barrier coverage with weighted sensors on a line.- Achieving Location Truthfulness in Rebalancing Supply-Demand Distribution for Bike Sharing.- Approximation algorithms and a hardness result for the three-machine proportionate mixed-shop problem.- A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory.- Community-based Acceptance Probability Maximization for Target Users on Social Networks.- Knowledge Graph Embedding Based on Subgraph-aware Proximity.
• (source: Nielsen Book Data)

This volume constitutes the proceedings of the 12th International Conference on Algorithmic Aspects in Information and Management, AAIM 2018, held in Dallas, Texas, USA, in December 2018. The 25 full papers presented were carefully reviewed and selected. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications.
(source: Nielsen Book Data)

• Algebraic Systems Biology: Theses and Hypotheses.- Discrete Models of Biochemical Networks: The Toric Variety of Nested Canalyzing Functions.- Membrane Computing as a Framework for Bio-modeling (An Informal Glimpse).- Relating Attractors and Singular Steady States in the Logical Analysis of Bioregulatory Networks.- Translating Time-Course Gene Expression Profiles into Semi-algebraic Hybrid Automata Via Dimensionality Reduction.- On Proving the Absence of Oscillations in Models of Genetic Circuits.- Attenuation Regulation as a Term Rewriting System.- Glucose-Insulin Control of Type1 Diabetic Patients in H2/H??? Space Via Computer Algebra.- Exact Parameter Determination for Parkinson's Disease Diagnosis with PET Using an Algebraic Approach.- Efficient Haplotype Inference with Pseudo-boolean Optimization.- An Algebraic Algorithm for the Identification of Glass Networks with Periodic Orbits Along Cyclic Attractors.- Analyzing Pathways Using SAT-Based Approaches.- Algorithmic Algebraic Model Checking IV: Characterization of Metabolic Networks.- Cascaded Games.- On Differential Algebraic Decision Methods for the Estimation of Anaerobic Digestion Models.- Protein Structure Prediction Using Residual Dipolar Couplings.- A Stochastic Pi Calculus for Concurrent Objects.- Modeling Static Biological Compartments with Beta-binders.- Deducing Interactions in Partially Unspecified Biological Systems.- Reduction of Algebraic Parametric Systems by Rectification of Their Affine Expanded Lie Symmetries.- Prefix Reversals on Binary and Ternary Strings.- Toric Ideals of Phylogenetic Invariants for the General Group-Based Model on Claw Trees K 1, n
• Inference of Protein-Protein Interactions by Using Co-evolutionary Information.- A Short Survey of Automated Reasoning.- Inference of Complex Regulatory Network for the Cell Cycle System in Saccharomyces Cerevisiae.- Manifestation and Exploitation of Invariants in Bioinformatics.
• (source: Nielsen Book Data)

This volume constitutes the refereed proceedings of the Second International Conference on Algebraic Biology. The conference served as an interdisciplinary forum for the presentation of research on all aspects of the application of symbolic computation in biology, including computer algebra, computational logic, and related methods. Papers also examine solutions to problems in biology using symbolic methods.
(source: Nielsen Book Data)

• Algebraic Systems Biology: Theses and Hypotheses.- Discrete Models of Biochemical Networks: The Toric Variety of Nested Canalyzing Functions.- Membrane Computing as a Framework for Bio-modeling (An Informal Glimpse).- Relating Attractors and Singular Steady States in the Logical Analysis of Bioregulatory Networks.- Translating Time-Course Gene Expression Profiles into Semi-algebraic Hybrid Automata Via Dimensionality Reduction.- On Proving the Absence of Oscillations in Models of Genetic Circuits.- Attenuation Regulation as a Term Rewriting System.- Glucose-Insulin Control of Type1 Diabetic Patients in H2/H??? Space Via Computer Algebra.- Exact Parameter Determination for Parkinson's Disease Diagnosis with PET Using an Algebraic Approach.- Efficient Haplotype Inference with Pseudo-boolean Optimization.- An Algebraic Algorithm for the Identification of Glass Networks with Periodic Orbits Along Cyclic Attractors.- Analyzing Pathways Using SAT-Based Approaches.- Algorithmic Algebraic Model Checking IV: Characterization of Metabolic Networks.- Cascaded Games.- On Differential Algebraic Decision Methods for the Estimation of Anaerobic Digestion Models.- Protein Structure Prediction Using Residual Dipolar Couplings.- A Stochastic Pi Calculus for Concurrent Objects.- Modeling Static Biological Compartments with Beta-binders.- Deducing Interactions in Partially Unspecified Biological Systems.- Reduction of Algebraic Parametric Systems by Rectification of Their Affine Expanded Lie Symmetries.- Prefix Reversals on Binary and Ternary Strings.- Toric Ideals of Phylogenetic Invariants for the General Group-Based Model on Claw Trees K 1, n
• Inference of Protein-Protein Interactions by Using Co-evolutionary Information.- A Short Survey of Automated Reasoning.- Inference of Complex Regulatory Network for the Cell Cycle System in Saccharomyces Cerevisiae.- Manifestation and Exploitation of Invariants in Bioinformatics.
• (source: Nielsen Book Data)

This volume constitutes the refereed proceedings of the Second International Conference on Algebraic Biology. The conference served as an interdisciplinary forum for the presentation of research on all aspects of the application of symbolic computation in biology, including computer algebra, computational logic, and related methods. Papers also examine solutions to problems in biology using symbolic methods.
(source: Nielsen Book Data)

This book constitutes the refereed proceedings of the Third International Conference on Algebraic Biology, AB 2008, held at the Castle of Hagenberg, Austria in July 2008 as part of the RISC Summer 2008, organized by the Research Institute for Symbolic Computation. The 14 revised full papers presented together with 3 tutorial lectures were carefully reviewed and selected from 27 submissions. The conference is the interdisciplinary forum for the presentation of research on all aspects of applications of symbolic computation (computer algebra, computational logic, and related methods) to various issues in biology and life sciences as well as other problems in biology being approached with symbolic methods.
(source: Nielsen Book Data)

• 1. ABZ Invited Talks.- Complex Hardware Modules Can Now be Made Free of Functional Errors without Sacrificing Productivity.- The High Road to Formal Validation:.- Modeling Workflows, Interaction Patterns, Web Services and Business Processes: The ASM-Based Approach.- Refinement of State-Based Systems: ASMs and Big Commuting Diagrams (Abstract).-
• 2. ASM Papers.- Model Based Refinement and the Tools of Tomorrow.- A Concept-Driven Construction of the Mondex Protocol Using Three Refinements.- A Scenario-Based Validation Language for ASMs.- Data Flow Analysis and Testing of Abstract State Machines.- A Verified AsmL Implementation of Belief Revision.- Direct Support for Model Checking Abstract State Machines by Utilizing Simulation.-
• 3. B Papers.- On the Purpose of Event-B Proof Obligations.- Generating Tests from B Specifications and Test Purposes.- Combining Scenario- and Model-Based Testing to Ensure POSIX Compliance.- UseCase-Wise Development: Retrenchment for Event-B.- Towards Modelling Obligations in Event-B.- A Practical Single Refinement Method for B.- The Composition of Event-B Models.- Reconciling Axiomatic and Model-Based Specifications Reprised.- A Verifiable Conformance Relationship between Smart Card Applets and B Security Models.- Modelling Attacker's Knowledge for Cascade Cryptographic Protocols.- Using EventB to Create a Virtual Machine Instruction Set Architecture.-
• 4. Z Papers.- Z2SAL - Building a Model Checker for Z.- Formal Modeling and Analysis of a Flash Filesystem in Alloy.- Unit Testing of Z Specifications.- Autonomous Objects and Bottom-Up Composition in ZOO Applied to a Case Study of Biological Reactivity.-
• 5. ABZ Short Papers.- Integrating Z into Large Projects Tools and Techniques.- A First Attempt to Express KAOS Refinement Patterns with Event B.- Verification and Validation of Web Service Composition Using Event B Method.- Stability of Real-Time Abstract State Machines under Desynchronization.- XML Database Transformations with Tree Updates.- Dynamic Resource Configuration & Management for Distributed Information Fusion in Maritime Surveillance.- UML-B: A Plug-in for the Event-B Tool Set.- BART: A Tool for Automatic Refinement.- Model Checking Event-B by Encoding into Alloy.- A Roadmap for the Rodin Toolset.- Exploiting the ASM Method for Validation & Verification of Embedded Systems.- Tool Support for the Circus Refinement Calculus.- Separation of Z Operations.- BSmart: A Tool for the Development of Java Card Applications with the B Method.- From ABZ to Cryptography.- Using ASM to Achieve Executability within a Family of DSL.- Using Satisfiability Modulo Theories to Analyze Abstract State Machines (Abstract).- Formal Verification of ASM Models Using TLA?+?.- DIR 41 Case Study.- FDIR Architectures for Autonomous Spacecraft: Specification and Assessment with Event-B.- Object Modelling in the SystemB Industrial Project.-
• 6. VSR Day.- Splitting Atoms with Rely/Guarantee Conditions Coupled with Data Reification.- ABZ2008 VSR-Net Workshop.
• (source: Nielsen Book Data)

The ABZ 2008 conference was held in London during September 16-18, 2008. The conference aimed at contributing to the cross-fertilization of three rigorous methods that share a common conceptual foundation and are widely used in both academia and industry for the design and analysis of hardware and so- waresystems, namely, abstractstate machines, B, andZ. It followedonfromthe Dagstuhl seminar on Rigorous Methods for Software Construction and Ana- sis, which was organized in May 2006 by Jean-Raymond Abrial (ETH Zur .. ich, Switzerland) and Uwe Gl. asser (Simon Fraser University - Burnaby, Canada), and brought together researchers from the ASM and the B community (see: http://www. dagstuhl. de/06191). The conference simultaneously incorporated the 15th International ASM Workshop, the 17th International Conference of Z Users and the 8th Inter- tional Conference on the B Method, which were present with separate Program Committees to select the papers published in separate tracks (see Chapters 2-4 of these proceedings). The conference covered a wide range of researchspanning from theoretical and methodological foundations to tool support and practical applications. It was split into three main parts: - Aone-daycommonprogramoffourinvitedlectures, seeChap. 1ofthesep- ceedings, and the presentationof three papers selected among the submitted contributions - Two days of contributed research papers and short presentations of work in progress, of industrial experience reports and of tool demonstrations, as documented in Chap.
(source: Nielsen Book Data)

• Contribution to a Rigorous Analysis of Web Application Frameworks / Egon Börger, Antonio Cisternino and Vincenzo Gervasi
• Integrated Operational Semantics: Small-Step, Big-Step and Multi-step / Ian J. Hayes and Robert J. Colvin
• Test Generation for Sequential Nets of Abstract State Machines / Paolo Arcaini, Francesco Bolis and Angelo Gargantini
• ASM and Controller Synthesis / Richard Banach, Huibiao Zhu, Wen Su and Xiaofeng Wu
• Continuous ASM, and a Pacemaker Sensing Fragment / Richard Banach, Huibiao Zhu, Wen Su and Xiaofeng Wu
• An ASM Model of Concurrency in a Web Browser / Vincenzo Gervasi
• Modeling the Supervisory Control Theory with Alloy / Benoît Fraikin, Marc Frappier and Richard St-Denis
• Preventing Arithmetic Overflows in Alloy / Aleksandar Milicevic and Daniel Jackson
• Extending Alloy with Partial Instances / Vajih Montaghami and Derek Rayside
• Toward a More Complete Alloy / Timothy Nelson, Daniel J. Dougherty, Kathi Fisler and Shriram Krishnamurthi
• Temporal Logic Model Checking in Alloy / Amirhossein Vakili and Nancy A. Day
• Active Attacking Multicast Key Management Protocol Using Alloy / Ting Wang and Dongyao Ji
• Formalizing Hybrid Systems with Event-B / Jean-Raymond Abrial, Wen Su and Huibiao Zhu
• SMT Solvers for Rodin / David Déharbe, Pascal Fontaine, Yoann Guyot and Laurent Voisin
• Refinement Plans for Informed Formal Design / Gudmund Grov, Andrew Ireland and Maria Teresa Llano
• Refinement by Interface Instantiation / Stefan Hallerstede and Thai Son Hoang
• Discharging Proof Obligations from Atelier B Using Multiple Automated Provers / David Mentré, Claude Marché, Jean-Christophe Filliâtre and Masashi Asuka
• A Semantic Analysis of Logics That Cope with Partial Terms / Cliff B. Jones, Matthew J. Lovert and L. Jason Steggles
• Combining VDM with Executable Code / Claus Ballegaard Nielsen, Kenneth Lausdahl and Peter Gorm Larsen
• Extending the Test Template Framework to Deal with Axiomatic Descriptions, Quantifiers and Set Comprehensions / Maximiliano Cristiá and Claudia Frydman
• A Tool Chain for the Automatic Generation of Circus Specifications of Simulink Diagrams / Chris Marriott, Frank Zeyda and Ana Cavalcanti
• Verification of Hardware Interaction Properties of Software / Ramsay Taylor
• Using the Arbitrator Pattern for Dynamic Process-Instance Extension in a Work-Flow Management System / Matthes Elstermann, Detlef Seese and Albert Fleischmann
• A Unified Processor Model for Compiler Verification and Simulation Using ASM / Roland Lezuo and Andreas Krall
• Modeling Synchronization/Communication Patterns in Vision-Based Robot Control Applications Using ASMs / Andrea Luzzana, Mattia Rossetti, Paolo Righettini and Patrizia Scandurra
• A Reliability Prediction Method for Abstract State Machines / Raffaela Mirandola, Pasqualina Potena and Patrizia Scandurra
• A Simplified Parallel ASM Thesis / Klaus-Dieter Schewe and Qing Wang
• Refactoring Abstract State Machine Models / Hamed Yaghoubi Shahir, Roozbeh Farahbod and Uwe Glässer
• Continuous Behaviour in Event-B: A Sketch / Richard Banach, Huibiao Zhu, Wen Su and Xiaofeng Wu
• Formal Verification of PLC Programs Using the B Method / Haniel Barbosa and David Déharbe
• A Practical Event-B Refinement Method Based on a UML-Driven Development Process / Thiago C. de Sousa, Paulo Sérgio Muniz Silva and Colin F. Snook
• Learn and Test for Event-B -- A Rodin Plugin / Ionut Dinca, Florentin Ipate, Laurentiu Mierla and Alin Stefanescu
• Event-B Code Generation: Type Extension with Theories / Andrew Edmunds, Michael Butler, Issam Maamria, Renato Silva and Chris Lovell
• Formal Proofs for the NYCT Line 7 (Flushing) Modernization Project / Denis Sabatier, Lilian Burdy, Antoine Requet and Jérôme Guéry
• A Pattern for Modelling Fault Tolerant Systems in Event-B / Gintautas Sulskus and Michael Poppleton.

This book constitutes the proceedings of the Third International Conference on Abstract State Machines, B, VDM, and Z, which took place in Pisa, Italy, in June 2012. The 20 full papers presented together with 2 invited talks and 13 short papers were carefully reviewed and selected from 59 submissions. The ABZ conference series is dedicated to the cross-fertilization of five related state-based and machine-based formal methods: Abstract State Machines (ASM), Alloy, B, VDM, and Z. They share a common conceptual foundation and are widely used in both academia and industry for the design and analysis of hardware and software systems. The main goal of this conference series is to contribute to the integration of these formal methods, clarifying their commonalities and differences to better understand how to combine different approaches for accomplishing the various tasks in modeling, experimental validation and mathematical verification of reliable high-quality hardware/software systems.

• Fundamental contributions
• Applications in industrial contexts
• Tool developments and improvements.

This book constitutes the thoroughly refereed proceedings of the 4th International Conference on Abstract State Machines, B, TLA, VDM, and Z, which took place in Toulouse, France, in June 2014. The 13 full papers presented together with 3 invited talks and 19 short papers were carefully reviewed and selected from 81 submissions. The ABZ conference series is dedicated to the cross-fertilization of six related state-based and machine-based formal methods: Abstract State Machines (ASM), Alloy, B, TLA, VDM, and Z. They share a common conceptual foundation and are widely used in both academia and industry for the design and analysis of hardware and software systems. The main goal of this conference series is to contribute to the integration of these formal methods, clarifying their commonalities and differences to better understand how to combine different approaches for accomplishing the various tasks in modeling, experimental validation and mathematical verification of reliable high-quality hardware/software systems.

• Modeling Distributed Algorithms by Abstract State Machines Compared to Petri Nets
• A Universal Control Construct for Abstract State Machines
• Encoding TLA+ into Many-Sorted First-Order Logic
• Proving Determinacy of PharOS in TLA+
• A Rigorous Correctness Proof for Pastry
• Enabling Analysis for B and Event-B
• A Compact Encoding of Sequential ASMs in Event-B
• Proof Assisted Symbolic Model Checking for B and Event-B
• On Component-based Reuse for Event-B
• Using B and ProB for Data Validation Projects
• Generating Event-B Specifications from Algorithm Descriptions
• Formal Proofs of Termination Detection for Local Computations by Refinement-Based Compositions
• How to Select the Suitable Formal Method for an Industrial Application: A Survey
• Unified Syntax for Abstract State Machines
• A Relational Encoding for a Clash-Free Subset of ASMs
• Towards an ASM Thesis for Reflective Sequential Algorithms
• A Model-based Transformation Approach to Reuse and Retarget CASM Specifications
• Modeling a Discrete Wet-Dry Algorithm for Hurricane Storm Surge in Alloy
• `The Tinker' for Rodin
• A Graphical Tool for Event Refinement Structures in Event-B
• Rodin Platform Why3 plug-in
• Semi-Automated Design Space Exploration for Formal Modelling
• Handling Continuous Functions in Hybrid Systems Reconfigurations: A Formal Event-B Development
• UC-B: Use Case Modelling with Event-B
• Interactive Model Repair by Synthesis
• SysML2B: Automatic Tool for B Project Graphical Architecture Design using SysML
• Mechanized Refinement of Communication Models with TLA+
• A Super Industrial Application of PSGraph
• The Hemodialysis Machine Case Study
• How to Assure Correctness and Safety of Medical Software: The Hemodialysis Machine Case Study
• Validating the Requirements and Design of a Hemodialysis Machine Using iUML-B, BMotionStudio, and Co-simulation
• Hemodialysis Machine in Hybrid Event-B
• Modeling a Hemodialysis Machine using Algebraic State-Transition Diagrams and B-like Methods
• Modelling the Haemodialysis Machine with Circus.

This book constitutes the refereed proceedings of the 5th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z, ABZ 2016, held in Linz, Austria, in May 2016. The 17 full and 15 short papers presented in this volume were carefully reviewed and selected from 61 submissions. They record the latest research developments in state-based formal methods Abstract State Machines, Alloy, B, Circus, Event-B, TLS+, VDM and Z.

• Invited Talks.- Translation and Transformation.- Analysis and Tests.- Reals and Hybrid Systems.-
• Refinement.- Hybrid ERTMS Case Study.- Short Papers.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 6th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z, ABZ 2016, held in Southampton, UK, in June 2018. The 20 full and 11 short papers presented in this volume were carefully reviewed and selected from 60 submissions. They record the latest research developments in state-based formal methods Abstract State Machines, Alloy, B, Circus, Event-B, TLS+, VDM and Z.
(source: Nielsen Book Data)

• Keynotes and Invited Papers.- Regular Research Articles.- Short Articles.- Articles Contributing to the Case Study.- Short Articles of the PhD-Symposium (Work in Progress).
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 7th International Conference on Rigorous State-Based Methods, ABZ 2020, which was due to be held in Ulm, Germany, in May 2020. The conference was cancelled due to the COVID-19 pandemic. The 12 full papers and 9 short papers were carefully reviewed and selected from 61 submissions. They are presented in this volume together with 2 invited papers, 6 PhD-Symposium-contributions, as well as the case study and 6 accepted papers outlining solutions to it. The papers are organized in the following sections: keynotes and invited papers; regular research articles; short articles; articles contributing to the case study; short articles of the PhD-symposium (work in progress).
(source: Nielsen Book Data)

• Regular Research Articles.- Unbounded Barrier-Synchronized Concurrent ASMs for Effective MapReduce Processing on Streams.- Towards ASM-based automated formal verification of security protocols.- Verifying System-level Security of a Smart Ballot Box.- Proving the safety of a Sliding Window Protocol with Event B.- Event-B formalization of Event-B contexts.- Validation of Formal Models by Timed Probabilistic Simulation.- Short Articles.- Sterling: A Web-based Visualizer for Relational Modeling Languages.- Extending ASMETA with time features.- About the Concolic Execution and Symbolic ASM Function Promotion in CASM.- Towards Refinement of Unbounded Parallelism in ASMs Using Concurrency and Reflection.- The CamilleX Framework for the Rodin Platform.- Extensible Record Structures in Event-B.- Formalizing and Analyzing System Requirements of Automatic Train Operation over ETCS using Event-B.- Automatic Transformation of SysML Model to Event-B Model for Railway CCS Application.- Short Articles of the PhD-Symposium (Work in Progress).- Formal Meta Engineering Event-B: Extension and Reasoning - The EB4EB Framework.- A modeling and verification framework for security protocols.- Formalizing the Institution for Event-B in the Coq Proof Assistant.
• (source: Nielsen Book Data)

This book constitutes the proceedings of the 8th International Conference on Rigorous State-Based Methods, ABZ 2021, which was planned to take place in Ulm, Germany, during June 6-11, 2021. The conference changed to an online format due to the COVID-19 pandemic. The 6 full and 8 short papers included in this volume were carefully reviewed and selected from 18 submissions. The proceedings also include 3 PhD symposium contributions. They deal with state-based and machine-based formal methods, mainly Abstract State Machines (ASM), Alloy, B, TLA+, VDM, and Z. .
(source: Nielsen Book Data)

• Accelerated UCT and Its Application to Two-Player Games / Junichi Hashimoto, Akihiro Kishimoto, Kazuki Yoshizoe and Kokolo Ikeda
• Revisiting Move Groups in Monte-Carlo Tree Search / Gabriel Van Eyck and Martin Müller
• PACHI: State of the Art Open Source Go Program / Petr Baudiš and Jean-loup Gailly
• Time Management for Monte-Carlo Tree Search in Go / Hendrik Baier and Mark H.M. Winands
• An MCTS Program to Play EinStein Würfelt Nicht! / Richard J. Lorentz
• Monte-Carlo Tree Search Enhancements for Havannah / Jan A. Stankiewicz, Mark H.M. Winands and Jos W.H.M. Uiterwijk
• Playout Search for Monte-Carlo Tree Search in Multi-player Games / J. (Pim) A.M. Nijssen and Mark H.M. Winands
• Towards a Solution of 7x7 Go with Meta-MCTS / Cheng-Wei Chou, Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee and Tsan-Cheng Su, et al.
• MCTS Experiments on the Voronoi Game / Bruno Bouzy, Marc Métivier and Damien Pellier
• 4*4-Pattern and Bayesian Learning in Monte-Carlo Go / Jiao Wang, Shiyuan Li, Jitong Chen, Xin Wei and Huizhan Lv, et al.
• Temporal Difference Learning for Connect6 / I-Chen Wu, Hsin-Ti Tsai, Hung-Hsuan Lin, Yi-Shan Lin and Chieh-Min Chang, et al.
• Improving Temporal Difference Learning Performance in Backgammon Variants / Nikolaos Papahristou and Ioannis Refanidis
• CLOP: Confident Local Optimization for Noisy Black-Box Parameter Tuning / Rémi Coulom
• Analysis of Evaluation-Function Learning by Comparison of Sibling Nodes / Tomoyuki Kaneko and Kunihito Hoki
• Approximating Optimal Dudo Play with Fixed-Strategy Iteration Counterfactual Regret Minimization / Todd W. Neller and Steven Hnath
• The Global Landscape of Objective Functions for the Optimization of Shogi Piece Values with a Game-Tree Search / Kunihito Hoki and Tomoyuki Kaneko
• Solving breakthrough with Race Patterns and Job-Level Proof Number Search / Abdallah Saffidine, Nicolas Jouandeau and Tristan Cazenave
• Infinite Connect-Four Is Solved: Draw / Yoshiaki Yamaguchi, Kazunori Yamaguchi, Tetsuro Tanaka and Tomoyuki Kaneko
• Blunder Cost in Go and Hex / Henry Brausen, Ryan B. Hayward, Martin Müller, Abdul Qadir and David Spies
• Understanding Distributions of Chess Performances / Kenneth W. Regan, Bartlomiej Macieja and Guy McC. Haworth
• Position Criticality in Chess Endgames / Guy McC. Haworth and Á. Rusz
• On Board-Filling Games with Random-Turn Order and Monte Carlo Perfectness / Ingo Althöfer
• Modeling Games with the Help of Quantified Integer Linear Programs / Thorsten Ederer, Ulf Lorenz, Thomas Opfer and Jan Wolf
• Computing Strong Game-Theoretic Strategies in Jotto / Sam Ganzfried
• Online Sparse Bandit for Card Games / David L. St-Pierre, Quentin Louveaux and Olivier Teytaud
• Game Tree Search with Adaptive Resolution / Hung-Jui Chang, Meng-Tsung Tsai and Tsan-sheng Hsu
• Designing Casanova: A Language for Games / Giuseppe Maggiore, Alvise Spanò, Renzo Orsini, Giulia Costantini and Michele Bugliesi, et al.
• Affective Game Dialogues / Using Affect as an Explicit Input Method in Game Dialogue Systems / Michael Lankes and Thomas Mirlacher
• Generating Believable Virtual Characters Using Behavior Capture and Hidden Markov Models / Richard Zhao and Duane Szafron.

Annotation This book constitutes the thoroughly refereed post-conference proceedings of the 13th Advances in Computer Games Conference, ACG 2011, held in Tilburg, The Netherlands, in November 2011. The 29 revised full papers presented were carefully reviewed and selected from numerous submissions. The papers cover a wide range of topics such as Monte-Carlo tree search and its enhancement, temporal difference learning, optimization, solving and searching, analysis of a game characteristic, new approaches, and serious games.

• A Compiler Framework for Supporting Speculative Multicore Processors.- Power-Efficient Heterogeneous Multicore Technology for Digital Convergence.- StarDBT: An Efficient Multi-platform Dynamic Binary Translation System.- Unbiased Branches: An Open Problem.- An Online Profile Guided Optimization Approach for Speculative Parallel Threading.- Entropy-Based Profile Characterization and Classification for Automatic Profile Management.- Laplace Transformation on the FT64 Stream Processor.- Towards Data Tiling for Whole Programs in Scratchpad Memory Allocation.- Evolution of NAND Flash Memory Interface.- FCC-SDP: A Fast Close-Coupled Shared Data Pool for Multi-core DSPs.- Exploiting Single-Usage for Effective Memory Management.- An Alternative Organization of Defect Map for Defect-Resilient Embedded On-Chip Memories.- An Effective Design of Master-Slave Operating System Architecture for Multiprocessor Embedded Systems.- Optimal Placement of Frequently Accessed IPs in Mesh NoCs.- An Efficient Link Controller for Test Access to IP Core-Based Embedded System Chips.- Performance of Keyword Connection Algorithm in Nested Mobility Networks.- Leakage Energy Reduction in Cache Memory by Software Self-invalidation.- Exploiting Task Temperature Profiling in Temperature-Aware Task Scheduling for Computational Clusters.- Runtime Performance Projection Model for Dynamic Power Management.- A Power-Aware Alternative for the Perceptron Branch Predictor.- Power Consumption and Performance Analysis of 3D NoCs.- A Design Methodology for Performance-Resource Optimization of a Generalized 2D Convolution Architecture with Quadrant Symmetric Kernels.- Bipartition Architecture for Low Power JPEG Huffman Decoder.- A SWP Specification for Sequential Image Processing Algorithms.- A Stream System-on-Chip Architecture for High Speed Target Recognition Based on Biologic Vision.- FPGA-Accelerated Active Shape Model for Real-Time People Tracking.- Performance Evaluation of Evolutionary Multi-core and Aggressively Multi-threaded Processor Architectures.- Synchronization Mechanisms on Modern Multi-core Architectures.- Concerning with On-Chip Network Features to Improve Cache Coherence Protocols for CMPs.- Generalized Wormhole Switching: A New Fault-Tolerant Mathematical Model for Adaptively Wormhole-Routed Interconnect Networks.- Open Issues in MPI Implementation.- Implicit Transactional Memory in Kilo-Instruction Multiprocessors.- Design of a Low-Power Embedded Processor Architecture Using Asynchronous Function Units.- A Bypass Mechanism to Enhance Branch Predictor for SMT Processors.- Thread Priority-Aware Random Replacement in TLBs for a High-Performance Real-Time SMT Processor.- Architectural Solution to Object-Oriented Programming.
• (source: Nielsen Book Data)

The refereed proceedings of the 12th Asia-Pacific Computer Systems Architecture Conference are presented in this volume. Twenty-six full papers are presented together with two keynote and eight invited lectures. Collectively, they represent some of the most important developments in computer systems architecture. The papers emphasize hardware and software techniques for state-of-the-art, multi-core and multi-threaded architectures.
(source: Nielsen Book Data)