close
1.

電子ブック

EB
edited by Ezio Bartocci, Rupak Majumdar
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9333
オンライン: http://dx.doi.org/10.1007/978-3-319-23820-3
目次情報: 続きを見る
Invited Papers
Towards a Verified Artificial Pancreas: Challenges and Solutions for Runtime Verification
Twenty Years of Dynamic Software Model Checking
Explaining Heisenbugs
Regular Papers
Qualitative and Quantitative Monitoring of Spatio-Temporal Properties
Runtime Adaptation for Actor Systems
Robust Online Monitoring of Signal Temporal Logic
On Verifying The Hennessy-Milner Logic with Recursion at Runtime
Assuring the Guardians
A Case Study on Runtime Monitoring of an Autonomous Research Vehicle (ARV) System
Monitoring Electronic Exams
Monitoring Real Android Malware
Time-triggered Runtime Verification of Component-Based Multi-core Systems
Monitoring for a decidable fragment of MTL-R Runtime Verification Through Forward Chaining
Collision Avoidance for Mobile Robots with Limited Sensing and Limited Information about the Environment
From First-Order Temporal Logic to Parametric Trace Slicing
R2U2: Monitoring and Diagnosis of Security Threats for Unmanned Aerial Systems
A Hybrid Approach to Causality Analysis
Short Papers
Statistical Model Checking of Distributed Adaptive Real-Time Software
Probabilistic Model Checking at Runtime for the Provisioning of Cloud Resources
Runtime Verification for Hybrid Analysis Tools
Suggesting Edits to Explain Failing Traces
Tool Papers
StaRVOOrS - A Tool for Combined Static and Runtime Verification of Java
TIPEX: a tool chain for Timed Property Enforcement during eXecution
Tutorial Papers
Machine Learning Methods in Statistical Model Checking and System Design ? Tutorial
RV-Android: Efficient Parametric Android Runtime Verification, a Brief Tutorial
LearnLib Tutorial - An Open Source Java Library for Active Automata Learning
Monitoring and Measuring Hybrid Behaviors - A Tutorial
Software Competitions
Second International Competition on Runtime Verification CRV 2015
Rigorous Examination of Reactive Systems: The RERS challenge 2015
Invited Papers
Towards a Verified Artificial Pancreas: Challenges and Solutions for Runtime Verification
Twenty Years of Dynamic Software Model Checking
2.

電子ブック

EB
edited by Giuseppe F Italiano, Giovanni Pighizzini, Donald T. Sannella
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9234
オンライン: http://dx.doi.org/10.1007/978-3-662-48057-1
3.

電子ブック

EB
edited by Adrian-Horia Dediu, Enrico Formenti, Carlos Martin-Vide, Bianca Truthe
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8977
オンライン: http://dx.doi.org/10.1007/978-3-319-15579-1
目次情報: 続きを見る
Algorithms
Automata, Logic, and Concurrency
Codes, Semigroups, and Symbolic Dynamics
Combinatorics on Words
Complexity and Recursive Functions
Compression, Inference, Pattern Matching, and Model Checking
Graphs, Term Rewriting, and Networks
Transducers, Tree Automata, and Weighted Automata
Algorithms
Automata, Logic, and Concurrency
Codes, Semigroups, and Symbolic Dynamics
4.

電子ブック

EB
edited by Francesco Parisi-Presicce, Bernhard Westfechtel
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9151
オンライン: http://dx.doi.org/10.1007/978-3-319-21145-9
目次情報: 続きを見る
Polymorphic Sesqui-Pushout Graph Rewriting
Predictive Top-Down Parsing for Hyperedge Replacement Grammars
AGREE ? Algebraic Graph Rewriting with Controlled Embedding
Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings
Towards Local Confluence Analysis for Amalgamated Graph Transformation
Multi-amalgamated Triple Graph Grammars
Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs
Reachability in Graph Transformation Systems and Slice Languages
Equational Reasoning with Context-Free Families of String Diagrams
Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations
Characterizing Conflicts Between Rule Application and Rule Evolution in Graph Transformation Systems
Graph Pattern Matching as an Embedded Clojure DSL
Using Graph Transformations for Formalizing Prescriptions and Monitoring
Towards Compliance Verification Between Global and Local Process Models
Inductive Invariant Checking with Partial Negative Application Conditions
Tool Support for Multi-amalgamated Triple Graph Grammars
Uncover: Using Coverability Analysis for Verifying Graph Transformation Systems
Local Search-Based Pattern Matching Features in EMF-INCQUERY
Polymorphic Sesqui-Pushout Graph Rewriting
Predictive Top-Down Parsing for Hyperedge Replacement Grammars
AGREE ? Algebraic Graph Rewriting with Controlled Embedding
5.

電子ブック

EB
edited by Michael Butler, Sylvain Conchon, Fatiha Zaidi
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9407
オンライン: http://dx.doi.org/10.1007/978-3-319-25423-4
6.

電子ブック

EB
edited by Bernhard Pfahringer, Jochen Renz
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9457
オンライン: http://dx.doi.org/10.1007/978-3-319-26350-2
7.

電子ブック

EB
edited by Thomas Eiter, Hannes Strass, Miros?aw Truszczy?ski, Stefan Woltran
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9060
オンライン: http://dx.doi.org/10.1007/978-3-319-14726-0
目次情報: 続きを見る
Prologue
Actions and Agents
Nonmonotonic and Human Reasoning
Preferences
Abstract Argumentation
Reflections on Knowledge Representation
Epilogue
Prologue
Actions and Agents
Nonmonotonic and Human Reasoning
8.

電子ブック

EB
edited by Kratochvil Jan, Mirka Miller, Dalibor Froncek
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8986
オンライン: http://dx.doi.org/10.1007/978-3-319-19315-1
目次情報: 続きを見る
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem
Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk
On the Galois Lattice of Bipartite Distance Hereditary Graphs
Fast Simple Computations Using Prefix Tables under Hamming and Edit Distance
Border Correlations, Lattices and the Subgraph Component Polynomial
Computing Minimum Length Representations of Sets of Words of Uniform Length
Computing Primitively-Rooted Squares and Runs in Partial Words
3-coloring triangle-free planar graphs with a precolored 9-cycle
Computing Heat Kernel Pagerank and a Local Clustering Algorithm
Solving Matching Problems Efficiently in Bipartite Graphs
A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
On decomposing the complete graph into the union of two disjoint cycles
Reconfiguration of Vertex Covers in a Graph
Space Efficient Data Structures for Nearest Larger Neighbor Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory
On Maximum Common Subgraph Problems in Series-Parallel Graphs
Profile-based optimal matchings in the Student/Project Allocation Problem
The Min-Max Edge q-Coloring Problem
Speeding up Graph Algorithms via Switching Classes
Metric Dimension for Amalgamations of Graphs
Deterministic Algorithms for the Independent Feedback Vertex Set Problem
Lossless seeds for searching short patterns with high error rates
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem
Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk
9.

電子ブック

EB
edited by Lev D. Beklemishev, Daniil V. Musatov
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9139
オンライン: http://dx.doi.org/10.1007/978-3-319-20297-6
目次情報: 続きを見る
Propositional Proofs in Frege and Extended Frege Systems
Circuit Complexity Meets Ontology-Based Data Access
NEXP-Completeness and Universal Hardness Results for Justification Logic
A Combinatorial Algorithm for the Planar Multi flow Problem with Demands Located on Three Holes
Generalized LR Parsing for Grammars with Contexts
On Compiling Structured CNFs to OBDDs
Satisfiability of ECTL* with Tree Constraints
On Growth and Fluctuation of k-Abelian Complexity
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement
Editing to a Planar Graph of Given Degrees
On the Satisfiability of Quantum Circuits of Small Treewidth
Equations over Free Inverse Monoids with Idempotent Variables
A Logical Characterization of Timed Pushdown Languages
An In-place Priority Queue with O(1) Time for Push and lg n + O(1) Comparisons for Pop
Resolution Complexity of Perfect Matching Principles for Sparse Graphs
Operations on Self-verifying Finite Automata
Automath Type Inclusion in Barendregt’s Cube
Circuit Lower Bounds for Average-Case MA
Making Randomness Public in Unbounded-Round Information Complexity
First-Order Logic Definability of Free Languages
Representation of (Left) Ideal Regular Languages by Synchronizing Automata
Some Properties of Antistochastic Strings
Approximation and Exact Algorithms for Special Cases of Connected f-Factors
Rewriting Higher-Order Stack Trees
Interacting with Modal Logics in the Coq Proof Assistant
Delay Games with WMSOtU Winning Conditions
Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems
Propositional Proofs in Frege and Extended Frege Systems
Circuit Complexity Meets Ontology-Based Data Access
NEXP-Completeness and Universal Hardness Results for Justification Logic
10.

電子ブック

EB
edited by Christian Urban, Xingyuan Zhang
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9236
オンライン: http://dx.doi.org/10.1007/978-3-319-22102-1
目次情報: 続きを見る
Verified, Practical Upper Bounds for State Space Diameters
Formalization of Error-correcting Codes: from Hamming to Modern Coding Theory
ROSCoq: Robots powered by Constructive Reals
Asynchronous processing of Coq documents: from the kernel up to the user interface
A Concrete Memory Model for CompCert
Validating Dominator Trees for a Fast, Verified Dominance Test
Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra
Mechanisation of AKS Algorithm
Machine-Checked Verification of the Correctness and Amortized
Improved Tool Support for Machine-Code Decompilation in HOL4
A Formalized Hierarchy of Probabilistic System Types
Learning To Parse on Aligned Corpora
A Consistent Foundation for Isabelle/HOL
Foundational Property-Based Testing
A First-Order Functional Intermediate Language for Verified Compilers
Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions
ModuRes: a Coq Library for Modular Reasoning about Concurrent
Higher-Order Imperative Programming Languages
Transfinite Constructions in Classical Type Theory
A Mechanized Theory of regular trees in dependent type theory
Deriving Comparators and Show-Functions in Isabelle/HOL
Formalizing Knot Theory in Isabelle/HOL
Pattern Matches in HOL: A New Representation and Improved Code Generation
Verified, Practical Upper Bounds for State Space Diameters
Formalization of Error-correcting Codes: from Hamming to Modern Coding Theory
ROSCoq: Robots powered by Constructive Reals