yusuke1997/dblp-id-title huggingface dataset:
Post's Correspondence Problem: From Computer Science to Algebra
Continued Fraction Approach to Gauss Reduction Theory
Maximum Path Sets in Trees
Simplicity Lies in the Eye of the Beholder: A Strategic Perspective on Controllers in Reactive Synthesis
Mean-Payoff Games with Partial-Observation - (Extended Abstract)
On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems
On the Length of Knot Transformations via Reidemeister Moves I and II
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
Modelling Dynamical Systems: Learning ODEs with No Internal ODE Resolution
Markov Decision Processes with Sure Parity and Multiple Reachability Objectives
Reachability Problems - 18th International Conference, RP 2024, Vienna, Austria, September 25-27, 2024, Proceedings
Formal Languages, Word Problems of Groups and Decidability
Reachability and Deadlocking Problems in Multi-stage Scheduling
Reachability Problems - 16th International Conference, RP 2022, Kaiserslautern, Germany, October 17-21, 2022, Proceedings
Robust Deterministic Abstractions for Supervising Discrete-Time Continuous Systems
Reachability Problems - 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings
Refinement of Trace Abstraction for Real-Time Programs
Characterizing Word Problems of Groups
Reachability is NP-Complete Even for the Simplest Neural Networks
Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete
Efficient Restrictions of Immediate Observation Petri Nets
On Yen's Path Logic for Petri Nets
On the Termination Problem for Counter Machines with Incrementing Errors
Characterizing Conclusive Approximations by Logical Formulae
Topological Characterisation of Multi-buffer Simulation
Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs
Robot Games with States in Dimension One
Playing Games with Counter Automata
On Relevant Equilibria in Reachability Games
Depth Boundedness in Multiset Rewriting Systems with Name Binding
Subsequences in Bounded Ranges: Matching and Analysis Problems
Primitivity and Synchronizing Automata: A Functional Analytic Approach
Irregular Behaviours for Probabilistic Automata
Games with Opacity Condition
Parameterized Graph Connectivity and Polynomial-Time Sub-Linear-Space Short Reductions - (Preliminary Report)
Reachability in Augmented Interval Markov Chains
Model Checking CTL over Restricted Classes of Automatic Structures
Weakly Synchronous Systems with Three Machines Are Turing Powerful
Stubborn Sets with Frozen Actions
A Fully Symbolic Bisimulation Algorithm
The Role of Logic and Automata in Understanding Transformers
Reachability in MDPs: Refining Convergence of Value Iteration
Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities
Recent Advances on Reachability Problems for Valence Systems (Invited Talk)
Theorem Proving Using Clausal Resolution: From Past to Present
Robustness in Timed Automata
Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings
Abstract Counterexamples for Non-disjunctive Abstractions
Integer-Complete Synthesis for Bounded Parametric Timed Automata
Cellular Automata for the Self-stabilisation of Colourings and Tilings
Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata
Deciding Continuous-Time Metric Temporal Logic with Counting Modalities
Regular Strategies in Pushdown Reachability Games
Reachability Analysis of a Class of Hybrid Gene Regulatory Networks
Stability Controllers for Sampled Switched Systems
Reachability Problems - 19th International Conference, RP 2025, Madrid, Spain, October 1-3, 2025, Proceedings
Weighing Obese Timed Languages
Reachability Modulo Theories
A New Weakly Universal Cellular Automaton in the 3D Hyperbolic Space with Two States
Ariadne: Dominance Checking of Nonlinear Hybrid Automata Using Reachability Analysis
Automated Verification of Concurrent Software
Fraenkel-Mostowski Sets with Non-homogeneous Atoms
Reachability Problems - 17th International Conference, RP 2023, Nice, France, October 11-13, 2023, Proceedings
Reachability Problem for Polynomial Iteration Is PSPACE-complete
Counting Multiplicity over Infinite Alphabets
Computing Reachable Simulations on Transition Systems
Temporal Logics over Linear Time Domains Are in PSPACE
Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems
Distributed Control Synthesis Using Euler's Method
Binary Expression of Ancestors in the Collatz Graph
Synthesising Succinct Strategies in Safety and Reachability Games
LTL-Model-Checking via Model Composition
Matching Patterns with Variables Under Simon's Congruence
Case Study: Reachability and Scalability in a Unified Combat-Command-and-Control Model
History-Deterministic Timed Automata Are Not Determinizable
On Shortest Products for Nonnegative Matrix Mortality
Word Equations with Length Constraints via Weak Arithmetics and Matrix Reachability Problems
Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic
Probabilistic Timed Automata with Clock-Dependent Probabilities
Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems
HyperMonitor: A Python Prototype for Hyper Predictive Runtime Verification
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems
Knapsack in Hyperbolic Groups
Büchi VASS Recognise ∑ 1 1 -complete ω-languages
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
On Reachability-Related Games on Vector Addition Systems with States
Lossy Counter Machines Decidability Cheat Sheet
Reachability of Weakly Nonlinear Systems Using Carleman Linearization
Transformations for Compositional Verification of Assumption-Commitment Properties
The Dynamic Complexity of the Reachability Problem on Graphs
Space-Efficient Fragments of Higher-Order Fixpoint Logic
Insertion-Deletion Systems over Relational Words
Complexity Bounds for Ordinal-Based Termination - (Invited Talk)
Generalized Tag Systems
On the Relationship between Reachability Problems in Timed and Counter Automata
Computing All Minimal Ways to Reach a Context-Free Language
Behavioral Cartography of Timed Automata
Compositional Reachability in Petri Nets
Complexity Analysis of the Backward Coverability Algorithm for VASS
Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings
Reachability Problems - 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings
Nets-Within-Nets Through the Lens of Data Nets
The Satisfiability and Validity Problems for Probabilistic CTL
Reachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings
A Framework for the Competitive Analysis of Model Predictive Controllers
Reachability Problems on Partially Lossy Queue Automata
Absent Subsequences in Words
Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method
An Undecidable Permutation of the Natural Numbers
Word Chain Generators for Prefix Normal Words
The Ideal Theory for WSTS
How to Tackle Integer Weighted Automata Positivity
Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams
Over-Approximating Terms Reachable by Context-Sensitive Rewriting
Algorithmic Information Theory and Foundations of Probability
Monotonic Abstraction for Programs with Multiply-Linked Structures
Reachability Problems - 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings
Coefficient Synthesis for Threshold Automata
Compositional Analysis of Boolean Networks Using Local Fixed-Point Iterations
Constrained Dynamic Tree Networks
On Higher-Order Reachability Games Vs May Reachability
Rewriting Systems for Reachability in Vector Addition Systems with Pairs
Distributed Synthesis of State-Dependent Switching Control
The Multiple Dimensions of Mean-Payoff Games - (Extended Abstract)
Left-Eigenvectors Are Certificates of the Orbit Problem
Provenance Verification
Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings
Quantum-over-Classical Advantage in Solving Multiplayer Games
Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings
Trace Inclusion for One-Counter Nets Revisited
Polynomial Interrupt Timed Automata
Rare Events for Statistical Model Checking an Overview
On Boundedness Problems for Pushdown Vector Addition Systems
Model Checking as A Reachability Problem
Box-Reachability in Vector Addition Systems
On the Complexity of Counter Reachability Games
Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata
Efficient Graph Reachability Query Answering Using Tree Decomposition
Verification of Reachability Properties for Time Petri Nets
Counterexample-Guided Abstraction Refinement for Star-Based Neural Network Verification
On Functions Weakly Computable by Petri Nets and Vector Addition Systems
Games on Higher Order Multi-stack Pushdown Systems
Smooth Sand Piles
On the Expressiveness of Metric Temporal Logic over Bounded Timed Words
Introducing Divergence for Infinite Probabilistic Models
Integer Vector Addition Systems with States
Reducing Bounded Realizability Analysis to Reachability Checking
SAT-Based Invariant Inference and Its Relation to Concept Learning
Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds
Efficient Probabilistic Model Checking of Systems with Ranged Probabilities
Partial Solvers for Generalized Parity Games
Revisiting MU-Puzzle. A Case Study in Finite Countermodels Verification
Synthesis Problems for One-Counter Automata
Synthesis of Structurally Restricted b-bounded Petri Nets: Complexity Results
Quantitative vs. Weighted Automata
Parameterized Verification of Communicating Automata under Context Bounds
Bidding Games on Markov Decision Processes
Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives
On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems Under Process Fairness
Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings
Robustness of Time Petri Nets under Guard Enlargement
The Collatz Process Embeds a Base Conversion Algorithm
On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions
On the Identity and Group Problems for Complex Heisenberg Matrices
Multithreaded-Cartesian Abstract Interpretation of Multithreaded Recursive Programs Is Polynomial
Reachability in Linear Recurrence Automata
The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets
Constructing Minimal Coverability Sets
Quantum Automata and Languages of Finite Index
Limit Set Reachability in Asynchronous Graph Dynamical Systems
Complexity of Reachability Problems in Neural Networks
Completeness of the Bounded Satisfiability Problem for Constraint LTL
Modular Synthesis with Open Components
Semi-linear VASR for Over-Approximate Semi-linear Transition System Reachability
A Topological Method for Finding Invariant Sets of Continuous Systems
On the Complexity of Reachability and Mortality for Bounded Piecewise Affine Maps
Compositional Verification of Almost-Sure Büchi Objectives in MDPs
Reasoning About Cost-Utility Constraints in Probabilistic Models
Decision Problems for Linear Recurrence Sequences
Reachability Problems for Hybrid Automata
Synthesis of Timing Parameters Satisfying Safety Properties
On the m-eternal Domination Number of Cactus Graphs
Decidable Models of Integer-Manipulating Programs with Recursive Parallelism
Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations
Proceedings of the Second Workshop on Reachability Problems in Computational Models, RP 2008, Liverpool, UK, September 15-17, 2008
Qualitative Reachability for Open Interval Markov Chains
Rollercoasters with Plateaus
Automated Termination in Model Checking Modulo Theories
Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata
Adding Dense-Timed Stack to Integer Reset Timed Automata
Decidability of LTL for Vector Addition Systems with One Zero-Test
Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P
Symbolic and Compositional Reachability for Timed Automata
The Stochastic Arrival Problem
Reachability Problems - 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings
Adaptive Directions for Bernstein-Based Polynomial Set Evolution
Observing Continuous-Time MDPs by 1-Clock Timed Automata
Occam's Razor Applied to the Petri Net Coverability Problem
On Decision Problems for Substitutions in Symbolic Dynamics
Quantifying Uncertainty in Probabilistic Loops Without Sampling: A Fully Automated Approach
Reachability and Mortality for Two-Dimensional RHPCD Systems Are co-NP-hard
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets
Linearization, Model Reduction and Reachability in Nonlinear odes
Minimal Number of Calls in Propositional Protocols
Reachability of Five Gossip Protocols
Monomial Strategies for Concurrent Reachability Games and Other Stochastic Games
Reachability Predicates for Graph Assertions
The Satisfiability of Word Equations: Decidable and Undecidable Theories
Parameterized Verification of Broadcast Networks of Register Automata
Hardness of Busy Beaver Value BB(15)
When You Have a Fuzzer, Everything Looks Like a Reachability Problem
Canonization of Reconfigurable PT Nets in Maude
The Ideal View on Rackoff's Coverability Technique
Reachability Problems for Hierarchical Piecewise Constant Derivative Systems
Invariants for LTI Systems with Uncertain Input
Reachability for Finite-State Process Algebras Using Static Analysis
Games with Full, Longitudinal, and Transverse Observability
Reachability Problems - 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings
Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs
Safety Property-Driven Stubborn Sets
Rearranging Two Dimensional Arrays by Prefix Reversals
The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets
Copyful Streaming String Transducers
Lower Bounds for the Length of Reset Words in Eulerian Automata
The Past and Future of Embedded Finite Model Theory
Improvements in Unfolding of Colored Petri Nets
Automatic Verification of Directory-Based Consistency Protocols
On the Complexity of Resource-Bounded Logics
EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets
Reaching Out Towards Fully Verified Autonomous Systems
The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
Branching-Time Model Checking Gap-Order Constraint Systems
Automata for Monadic Second-Order Model-Checking
DTMC Model Checking by Path Abstraction Revisited
MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters
A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
On the Joint Spectral Radius for Bounded Matrix Languages
On the Computation of the Minimal Coverability Set of Petri Nets
The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane
Population Protocols: Beyond Runtime Analysis
Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics
Reachability Problems - 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings
Reachability Set Generation Using Hybrid Relation Compatible Saturation
Multi-weighted Reachability Games
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Knowing-How Reasoning with Budgets Recasted: Universal Reachability Problem on VASS
Uppaal Coshy: Automatic Synthesis of Compact Shields for Hybrid Systems
Teaching Correctness-by-Construction and Post-hoc Verification - The Online Experience
Teaching How to Derive Correct Concurrent Programs from State-Based Specifications and Code Patterns
Teaching Formal Methods, CoLogNET/FME Symposium, TFM 2004, Ghent, Belgium, November 18-19, 2004, Proceedings
Formal Systems, Not Methods
Teaching and Training in Formalisation with B
Specification-Driven Design with Eiffel and Agents for Teaching Lightweight Formal Methods
On Teaching Applied Formal Methods in Aerospace Engineering
Designing Algorithms in High School Mathematics
Chief Chefs of Z to Alloy: Using a Kitchen Example to Teach Alloy with Z
Formal Methods Teaching - 6th Formal Methods Teaching Workshop, FMTea 2024, Milan, Italy, September 10, 2024, Proceedings
Formal Methods Teaching - 4th International Workshop and Tutorial, FMTea 2021, Virtual Event, November 21, 2021, Proceedings
Teaching Formal Methods: Lessons Learnt from Using Event-B
Teaching Formal Methods for 10 Years: Reflections on theories, tools, materials, and communities
How to Explain Mistakes
Teaching Deductive Verification in Why3 to Undergraduate Students
Teaching TLA+ to Engineers at Microsoft
A Proposal for a Framework to Accompany Formal Methods Learning Tools - (Short Paper)
Teaching Deductive Verification Through Frama-C and SPARK for Non Computer Scientists
Teaching Through Practice: Advanced Static Analysis with LiSA
Teaching Formal Methods to Future Engineers
Teaching Formal Methods: From Software in the Small to Software in the Large
Model Checking Concurrent Programs for Autograding in pseuCo Book
Automated Exercise Generation for Satisfiability Checking
Formal Methods Teaching: 5th International Workshop, FMTea 2023, Lübeck, Germany, March 6, 2023, Proceedings
Increasing Student Self-Reliance and Engagement in Model-Checking Courses
Teaching Concurrency: Theory in Practice
Online Teaching of Verification of C Programs in Applied Computer Science
You Already Used Formal Methods but Did Not Know It
The Significance of Symbolic Logic for Scientific Education
A Beginner's Course on Reasoning About Imperative Programs
What Top-Level Software Engineers Tackle after Learning Formal Methods: Experiences from the Top SE Project
Teaching Discrete Mathematics to Computer Science Students
Advertising Formal Methods and Organizing Their Teaching: Yes, but ...
Teaching Low-Code Formal Methods with Coloured Petri Nets
Using Isabelle in Two Courses on Logic and Automated Reasoning
Checking Contracts in Event-B - Reporting the Introduction and the Use of Automated Tools for Verifying Software-Based Systems in Higher Education
Teaching Formal Methods in Context
A Practice-Oriented Course on the Principles of Computation, Programming, and System Design and Analysis
Integrated and Tool-Supported Teaching of Testing, Debugging, and Verification
Which Mathematics for the Information Society?
Lessons of Formal Program Design in Dafny
Teaching Concurrency with the Disappearing Formal Method
Teaching Introductory Formal Methods and Discrete Mathematics to Software Engineers: Reflections on a Modelling-Focussed Approach
Integrating Formal Specification and Software Verification and Validation
Linking Paradigms, Semi-formal and Formal Notations
Teaching Formal Methods for the Unconquered Territory
Principled and Pragmatic Specification of Programming Languages
Formal Methods Teaching - Third International Workshop and Tutorial, FMTea 2019, Held as Part of the Third World Congress on Formal Methods, FM 2019, Porto, Portugal, October 7, 2019, Proceedings
Increasing Engagement with Interactive Visualization: Formal Methods as Serious Games
On Teaching Formal Methods: Behavior Models and Code Analysis
Introducing Formal Methods to First-Year Students in Three Intensive Weeks
Distributed Teaching of Formal Methods
A Gentle Introduction to Verification of Parameterized Reactive Systems
Introducing Formal Methods to Students Who Hate Maths and Struggle with Programming
Teaching Program Specification and Verification Using JML and ESC/Java2
Logic, Algebra, and Geometry at the Foundation of Computer Science
Teaching with Logika: Conceiving and Constructing Correct Software
Teaching Formal Methods, Second International Conference, TFM 2009, Eindhoven, The Netherlands, November 2-6, 2009. Proceedings
A Survey of Formal Methods Courses in European Higher Education
An Undergraduate Course on Protocol Engineering - How to Teach Formal Methods Without Scaring Students
Using Krakatoa for Teaching Formal Verification of Java Programs
Teaching Formal Methods in Application Domains - A Case Study in Computer and Network Security
An Educational Module for Temporal Features in Alloy 6
Retrospect and Prospect of Formal Methods Education in China
Embedding Formal Development in Software Engineering
The Computational Relevance of Formal Logic Through Formal Proofs
Teaching Formal Methods to Software Engineers through Collaborative Learning (Short Paper)
Graphical Loop Invariant Based Programming
Teaching Formal Methods Based on Rewriting Logic and Maude
Introducing GitHub Classroom into a Formal Methods Module
Motivating Study of Formal Methods in the Classroom
Abstraction and Modelling: A Complementary Partnership
Managing Heterogeneity and Bridging the Gap in Teaching Formal Methods
Influence of the Precursor Composition and Reaction Conditions on Raney-Nickel Catalytic System
A Hierarchical, Component Based Approach to Screening Properties of Soft Matter
Atomistic Modeling and Simulation for Solving Gas Extraction Problems
Quantum Virial Coefficients via Path Integral Monte Carlo with Semi-classical Beads
A Discontinuous Potential Model for Protein-Protein Interactions
Atomistic Simulations of CO2 During "Trapdoor" Adsorption onto Na-Rho Zeolite
Optimizing Molecular Models Through Force-Field Parameterization via the Efficient Combination of Modular Program Packages
Probing How Defects in Self-assembled Monolayers Affect Peptide Adsorption with Molecular Simulation
Molecular Modeling and the Materials Genome: Foundations of Molecular Modeling and Simulation 2015, FOMMS 2015, The Resort at the Mountains, Mt. Hood, OR, USA, July 12-16, 2015
Homogeneous Nucleation of [dmim+][Cl-] from its Supercooled Liquid Phase: A Molecular Simulation Study
Development of a Coarse-Grained Water Forcefield via Multistate Iterative Boltzmann Inversion
Optimized simulation of breast anatomy for virtual clinical trials
First results with a deep learning (feed-forward CNN) approach for daily quality control in digital breast tomosynthesis
Dose reduction in breast CT by spectrum switching
Mammographic breast density over time among women who have participated in BreastScreen Norway
Using a convolutional neural network to predict readers' estimates of mammographic density for breast cancer risk assessment
Effect of biopsy on the MRI radiomics classification of benign lesions and luminal A cancers
Development of a physical anthropomorphic breast phantom for objective task-based assessment of dedicated breast CT systems
Ultrasound transducer tracking system for correlation of masses in combined x-ray and manual breast ultrasound imaging
Radiation dose reduction in digital breast tomosynthesis (DBT) by means of neural network convolution (NNC) deep learning
A novel nipple detection algorithm on Digital Mammography (DM)
Clinical performance of the tomosynthesis guided breast biopsy
Volumetric breast density measurement for personalized screening: accuracy, reproducibility, and agreement with visual assessment
Towards an analytic model describing the effect of scan angle and slice thickness on the in-plane spatial resolution of calcifications in digital breast tomosynthesis
A hybrid approach for virtual clinical trials for mammographic imaging
Developing imaging biomarkers for mammographically-occult cancer in dense breasts using a radiologist's progress rating on cancer development: a preliminary analysis
Independent images: a need for phantom based image quality assessment using model observers?
Automated lesion detection and segmentation in digital mammography using a u-net deep learning network
Deep learning methods aid in predicting risk of interval cancer