yusuke1997/dblp-id-title huggingface dataset:
Research on the Application of Mind Map in "Artificial Intelligence" Teaching
Using Learning Analytics to Promote Student Engagement and Achievement in Blended Learning: An Empirical Study
Cognitive Model of E-Learning, E-Business and E-Communication
Teaching Reform of Computer Basic Course Combined with Specialty
Perception of Zakat and Income Tax
Factors Influencing Continuous Intention to Use Mobile Commerce Applications during the Covid-19 Pandemic: Mobile Commerce Applications
Construction of Evaluation System of Application Effect of Electronic Schoolbag in University Classroom Teaching
Group Affect Recognition: Completed Databases and Smart Uses
Trust in E-Commerce and Its Impact on the Purchase Intention of Consumers in MSME Stores in Chiapas - Mexico
Innovation of Undergraduate Education Mode of the Financial Management Major in Big Data Era
Analysis of School-Enterprise Cooperation based on Two-Factor Theory from the Perspective of Teachers
Creating Customer Loyalty in MUJI to Boost Customer Satisfaction with Service Quality - Take Switching Cost as the Moderator
Impact of Globalization on Income Inequality: A Panel Data Econometric Approach
How Do Consumers Respond to Promotion When Information Overload Exists: An Elaboration Likelihood Model Perspective?
Research on the Impact of Asset Light Operation on Human Capital Investment
Promoting Innovation through Research Collaboration and Technology Commercialization: Approaches from the Yangtze River Delta Region of China
The Impact of Increase of Cigarette Expension on Net Income in Income Statements
Exploring the Factors Influencing the Viewers' Intention to Subscribe to Video Game Live Streaming: Using social support and subjective welling-being perspectives
A Study for Differences in the Participation of Students from Different Departments in Innovative Design Courses: Taking the Design of Red Dots as an Example
Research on the Learning Situation Analysis and Academic Prediction based on Education Big Data
Research on the Driving Mechanism of NRO Oriented to the Innovation Chain
On-Demand Virtual Lectures: Promoting Active Learning in Distance Learning
Optimization of Investment Portfolio Based on Improved Multi-Objective Genetic Algorithm
Evaluation of Student Skills in Unix Base Scripting Course
A Meta-analysis of the Impact of E-learning on Learner Learning Outcomes
Application of Big Data Marketing in Customer Relationship Management
Learning Management Systems as Platforms for Increasing the Digital and Health Literacy
The Influence of Online Personal Consumer Credit Products on Consumers' Impulse Purchasing Intention: A case study of Ant Credit Pay
Research on University Takeaway O2O Distribution Mode Based on Centralized Distribution of Third-Party Sub-region
Factors that Influence Stock Investment Decisions in IPOT
Experiments with Real-Time Servers in Real-Time Mach
Page Replacement and Reference Bit Emulation in Mach
Supporting Structured Shared Virtual Memory Under Mach
A Revised IPC Interface
Zone Garbage Collection
A Persistent Distributed Architecure Supported by the Mach Operating System
Extending the Mach External Pager Interface to Accomodate User-Level Page Replacement Policies
User-Level Physical Memory Management for Mach
A Fast and General Implementation of Mach IPC in a Network
Real Memory Mach
A Trusted X Window System Server for Trusted Mach
Fault-Tolerant Computing Based on Mach
Page Prefetching Based on Fault History
An OS/2 Personality on Mach
Real Time - Mach Timers: Exporting Time to the User
Kernel Support for Network Protocol Servers
Redirecting System Calls in Mach 3.0, An alternative to the Emulator
Using Continuations to Build a User-Level Threads Library
MVM - An Environment for Running Multiple DOS, Windows and DPMI Programs on the Microkernel
USENIX MACH III Symposium, Santa Fe, New Mexico, USA, April 19-21, 1993
Mach Interfaces to Support Guest O.S. Debugging
A Fast Mach Network IPC Implementation
Managing Discardable Pages with an External Pager
Building a Fault-Tolerant System Based on Mach
How to Design Reliable Servers using Fault Tolerant Micro-Kernel Mechanisms
Adding Scheduler Activations to Mach 3.0
Unix File Access and Caching in a Multicomputer Environment
MIKE: A Distributed object-oriented programming platform on top of the Mach micro-kernel
Task Migration on the top of the Mach Microkernel
Parallelizing Signal Handling and Process Management in OSF/1
Real-Time Mach: Towards a Predictable Real-Time System
Kernel Support for Recoverable-Persistent Virtual Memory
The File System Belongs in the Kernel
An I/O System for Mach 3.0
Developing Benchmarks to Measure the Performance of the Mach Operating System
Distributed Trusted Mach Architecture
A Causal Distributed Shared Memory Based on External Pagers
DOS as a Mach 3.0 Application
Sprite on Mach
OSF/1 Virtual Memory Improvements
The Mach Timing Facility: An Implementation of Accurate Low-Overhead Usage Timing
Port Buffers: A Mach IPC Optimization for Handling Large Volumes of Small Messages
Using the Mach Communication Primitives in X11
The Design of the Schizophrenic Workstation System
In-Kernel Servers on Mach 3.0: Implementation and Performance
Transparent Recovery of Mach Applications
Mach on a Virtually Addressed Cache Architecture
Mach Resource Control in OSF/1
Evaluation of Real-Time Synchronization in Real-Time Mach
Moving the Default Memory Manager Out of the Mach Kernel
Generalized Emulation Services for Mach 3.0: Overview, Experiences and Current Status
An Architecture for Device Drivers Executing as User-Level Tasks
USENIX MACH Symposium, Burlington, VT, USA, 4-5 October 1990
USENIX MACH Symposium, Monterey, CA, USA, November 20-22, 1991
Fluid Model Checking
Characteristic Bisimulation for Higher-Order Session Processes
Time-Constrained Automata (Extended Abstract)
On the Complexity of Heterogeneous Multidimensional Games
Concurrency and the Algebraic Theory of Effects - (Abstract)
Characterizing Consensus in the Heard-Of Model
Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory
CONCUR '95: Concurrency Theory, 6th International Conference, Philadelphia, PA, USA, August 21-24, 1995, Proceedings
A Temporal Calculus of Communicating Systems
Preserving Specific Properties in Programm Development: How to Debug Programs (Conference Version)
The Semilinear Home-Space Problem Is Ackermann-Complete for Petri Nets
Denotational Semantics for occam
History-Determinism vs Fair Simulation
Session Types with Arithmetic Refinements
CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings
A Unifying Framework for Deciding Synchronizability
Timed Multiparty Session Types
Just Verification of Mutual Exclusion Algorithms
Communicating Transactions - (Extended Abstract)
Making Random Choices Invisible to the Scheduler
Invariant Semantics of Nets with Inhibitor Arcs
Compositional Verification of Probabilistic Processes
On the Expressive Power of Global and Local Priority in Process Calculi
Applications of Shellable Complexes to Distributed Computing - (Invited Talk)
Geometry of Reachability Sets of Vector Addition Systems
Let's Make Models (Abstract)
Globally Governed Session Semantics
Expressive Power of Temporal Logics
Refinement and Verification Applied to an In-Flight Data Acquisition Unit
Visibility and Separability for a Declarative Linearizability Proof of the Timestamped Stack
On the Sequential Probability Ratio Test in Hidden Markov Models
Analysing TM FS : a Study of Nondeterminism in Real-Time Concurrency
Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures
The Scope and Limits of Synchronous Concurrent Computation
Structured Interactional Exceptions in Session Types
CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31 - September 3, 2004, Proceedings
Complete Axiomatization for the Bisimilarity Distance on Markov Chains
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
Unfold/Fold Transformations of CCP Programs
History-Deterministic Parikh Automata
Model Checking Mobile Processes
On the Decidability of Cryptographic Protocols with Open-Ended Data Structures
Nondeterminism and Probabilistic Choice: Obeying the Laws
Reconfiguration and Message Losses in Parameterized Broadcast Networks
Superimposition for Interacting Processes
A Framework for Formally Verifying Software Transactional Memory Algorithms
Synthesis of ENI-systems Using Minimal Regions
A Marriage of Rely/Guarantee and Separation Logic
Bounded Reachability Checking with Process Semantics
Nominal Tree Automata with Name Allocation
Partial Order Reductions for Timed Systems
External Behaviour Equivalence between two Petri Nets
A Rigorous Analysis of Concurrent Operations on B-Trees
Parameterized Model Checking of Rendezvous Systems
Reasoning about Optimistic Concurrency Using a Program Logic for History
Logics Meet 1-Clock Alternating Timed Automata
Lost in Abstraction: Monotonicity in Multi-threaded Programs
Confluence for Process Verification
On Implementation of Global Concurrent Systems with Local Asynchronous Controllers
Refinement-Robust Fairness
Revisiting Safety and Liveness in the Context of Failures
LP Deadlock Checking Using Partial Order Dependencies
Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms
Efficient Checking of Link-Reversal-Based Concurrent Systems
Diagnosis in Infinite-State Probabilistic Systems
Metric Predicate Transformers: Towards a Notion of Refinement for Concurrency
Toward Automatic Verification of Quantum Cryptographic Protocols
Semantics of Networks Containing Indeterminate Operators
Contract Signing, Optimism, and Advantage
Determinization of One-Counter Nets
Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum
Towards Automatic Temporal Logic Verification of Value Passing Process Algebra Using Abstract Interpretation
Verification of Petri Nets with Read Arcs
Weighted Basic Parallel Processes and Combinatorial Enumeration
A pi-Calculus Semantics for an Object-Based Design Notation
Timed Spi-Calculus with Types for Secrecy and Authenticity
A Decidable Class of Asynchronous Distributed Controllers
Around Classical and Intuitionistic Linear Processes
Service Choreography and Orchestration with Conversations
Singly Exponential Translation of Alternating Weak Büchi Automata to Unambiguous Büchi Automata
Dynamic Partial Order Reduction Using Probe Sets
BlenX Static and Dynamic Semantics
Testing Finitary Probabilistic Processes
Fibrational Semantics of Dataflow Networks
Aspect-Oriented Linearizability Proofs
Bisimulations Up-to: Beyond First-Order Transition Systems
Different Strokes in Randomised Strategies: Revisiting Kuhn's Theorem Under Finite-Memory Assumptions
On the Power of Cooperative Concurrency
Completeness and Nondeterminism in Model Checking Transactional Memories
Abstract Subtyping for Asynchronous Multiparty Sessions
High Level Expressions with their SOS Semantics (Extended Abstract)
A Universal Reactive Machine
Energy Games with Resource-Bounded Environments
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
Weak Bisimulation is Sound and Complete for PCTL*
Reachability Analysis for Some Models of Infinite-State Transition Systems
A Space-Efficient Probabilistic Simulation Algorithm
The Benefits of Sometimes Not Being Discrete
Logic of Execution: An Outline
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic
Timed Basic Parallel Processes
On the Value Problem in Weighted Timed Games
A Turing Enigma
The Orbit Problem for Parametric Linear Dynamical Systems
Probabilistic Event Structures and Domains
Hierarchical Development of Cncurrent Systems in a Temporal Logic Framework
Reasoning about Security in Mobile Ambients
A Temporal Approach to Algebraic Specifications
Sanity Checks in Formal Verification
A Deductive Proof System for CTL
RobTL: Robustness Temporal Logic for CPS
Analyzing Timed Systems Using Tree Automata
From Multi to Single Stack Automata
The Power of Priority Channel Systems
Divide and Congruence III: Stability & Divergence
Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic
Playing Games with Boxes and Diamonds
Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL^*}(ℤ) to Decision Procedures
Liveness and Fairness in Duration Calculus
Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
Ordered Navigation on Multi-attributed Data Words
Monitorability for the Modal Mu-Calculus over Systems with Data: From Practice to Theory
On Modal Refinement and Consistency
A Temporal Logic for the Interaction of Strategies
Qualitative Concurrent Parity Games: Bounded Rationality
Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management
Synthesis of Safe, Optimal and Compact Strategies for Stochastic Hybrid Games (Invited Paper)
Reducing Clocks in Timed Automata while Preserving Bisimulation
Lectures on a Calculus for Communicating Systems
An Automaton over Data Words That Captures EMSO Logic
Deciding Hyperproperties
Failure Semantics for the Exchange of Information in Multi-Agent Systems
Invariants for One-Counter Automata with Disequality Tests
Probabilistic Analysis of Binary Sessions
Concurrent Programming in COB
Spatial and Behavioral Types in the Pi-Calculus
On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability
Basic Theory of Reduction Congruence forTwo Timed Asynchronous pi-Calculi
Partial Order Semantics of Concurrent Programs (Abstract)
Reachability in Recursive Markov Decision Processes
Faster Asynchronous Systems
On Finite Alphabets and Infinite Bases III: Simulation
Refinement and Decomposition of Value-Passing Action Systems
Mean-Payoff Automaton Expressions
Compositional Reasoning for Parametric Probabilistic Automata
35th International Conference on Concurrency Theory, CONCUR 2024, Calgary, Canada, September 9-13, 2024
Concurrent Kleene Algebra
Bounded Context Switching for Valence Systems
From Process Calculi to Process Frameworks
Approximate Learning of Limit-Average Automata
Interpreting Broadcast Communication in SCCS
Verification of Parallel Systems via Decomposition
An Automata-Theoretic Approach to the Verification of Distributed Algorithms
The Lambda-Calculus with Multiplicities (Abstract)
Synthesis of Bounded Choice-Free Petri Nets
A General Testability Theory
Suptyping and Locality in Distributed Higher Order Processes (extended abstract)
Program Invariants (Invited Talk)
33rd International Conference on Concurrency Theory, CONCUR 2022, Warsaw, Poland, September 12-16, 2022
Decision Algorithms for Probabilistic Bisimulation
Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages
Back and Forth Bisimulations
Reachability Analysis at Procedure Level through Timing Coincidence
A Tool Set for deciding Behavioral Equivalences
Reachability in Timed Automata with Diagonal Constraints
32nd International Conference on Concurrency Theory, CONCUR 2021, Virtual Conference, August 24-27, 2021
Embedding as a Tool for Language Comparison: On the CSP Hierarchy
Semantic Specifications for the Rewrite Rule Machine
Progress-Preserving Refinements of CTA
Reversible Transducers over Infinite Words
Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries
Distributed CCS
Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning
A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
Process Languages for Rooted Eager Bisimulation
Compiling Pattern Matching in Join-Patterns
Probabilistic Anonymity
Probabilistic Automata of Bounded Ambiguity
Performance Evaluation : = (Process Algebra + Model Checking) × Markov Chains
Enforcing ω-Regular Properties in Markov Chains by Restarting
Multi-Valued Model Checking via Classical Model Checking
Generalizing Simulation to Abstract Domains
Adequacy-Preserving Transformations of COSY Path Programs
Operational Semantics for the Petri Box Calculus
The Weak Late pi-Calculus Semantics as Observation Equivalence
On the Reachability Analysis of Acyclic Networks of Pushdown Systems
Programming in a General Model of Synchronization
On the Uniqueness of Fixpoints Modulo Observation Congruence
Contextual Behavioural Metrics
DNN Verification, Reachability, and the Exponential Function Problem
A Game Semantics of the Asynchronous pi -Calculus
CCS with Priority Guards
Causally Deterministic Markov Decision Processes
Partial-Order Reduction Is Hard
Modular Verification for Shared-Variable Concurrent Programs
Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems
The Benefits of Exposing Calls and Returns
Probabilistic Robust Timed Games
Modeling Timed Concurrent Systems
Concurrent Algorithms and Data Structures for Model Checking (Invited Talk)
On the Power of Labels in Transition Systems
All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces
Front Matter, Table of Contents, Preface, Committees, External Reviewers
Robust Satisfaction
Towards a Theory of Actor Computation
Simulations for Event-Clock Automata
Register-Bounded Synthesis
Multipebble Simulations for Alternating Automata - (Extended Abstract)
A Decidable Fixpoint Logic for Time-Outs
A Classification of Models for Concurrency
Weighted Basic Petri Nets
Games Where You Can Play Optimally Without Any Memory
A Faster-than Relation for Asynchronous Processes
Formal Techniques for Parallel Object-Oriented Languages
A Universal Session Type for Untyped Asynchronous Communication
Verifying Abstractions of Timed Systems
On Continuous Pushdown VASS in One Dimension
A New Modality for Almost Everywhere Properties in Timed Automata
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes
Towards Categorical Quantum Concurrency Theory (Invited Talk)
Verifying Arithmetic Assembly Programs in Cryptographic Primitives (Invited Talk)
Modal Logics for Timed Control
Robustness against Consistency Models with Atomic Visibility
Query-Based Model Checking of Ad Hoc Network Protocols
Model Checking a Path
A New Type System for Deadlock-Free Processes
HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour
Synthesis Rules for Petri Nets, and How they Lead to New Results
Transition Systems of Elementary Net Systems with Localities
Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints
Discrete Time Process Algebra
Equivalences of Statecharts
k-Bounded Petri Net Synthesis from Modal Transition Systems
A Symbolic Semantics for the pi-calculus (Extended Abstract)
Horizontal and Vertical Structuring Techniques for Statecharts
Strategy Complexity of Parity Objectives in Countable MDPs
Quiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract)
Event Structures as Presheaves -Two Representation Theorems
The Limit View of Infinite Computations
Optimizing Büchi Automata
Principal Typing Schemes in a Polyadic pi-Calculus
Controllers for Discrete Event Systems via Morphisms
Reasoning about Cryptographic Protocols in the Spi Calculus
False Concurrency and Strange-but-True Machines - (Abstract)
Data Multi-Pushdown Automata
Up-To Techniques for Generalized Bisimulation Metrics
Mutually Testing Processes - (Extended Abstract)
Concurrent Games with Multiple Topologies
Revisiting Local Time Semantics for Networks of Timed Automata
Scope-Bounded Reachability in Valence Systems
On the Ill-Timed but Well-Caused
On Convergence of Concurrent Systems under Regular Interactions
Reasoning about Probabilistic Lossy Channel Systems
Arbitrary-Arity Tree Automata for QCTL
Sometimes 'Some' is as Good as 'All'
Unique Fixpoint Induction for Mobile Processes
Denotational Models Based on Synchronously Communicating Processes: Refusal, Acceptance, Safety
Determinisability of One-Clock Timed Automata
Decidability of Bisimulation Equivalence for Normed Pushdown Processes
Linear Equations with Ordered Data
Reduction in TLA
Separable GPL: Decidable Model Checking with More Non-Determinism
Separability and Non-Determinizability of WSTS
Multiway Synchronization Verified with Coupled Simulation
Rely/Guarantee Reasoning for Asynchronous Programs
Regular Separability of Well-Structured Transition Systems
On the Minimisation of Acyclic Models
SCONE: A Simple Calculus of Nets
Flat Coalgebraic Fixed Point Logics
Programming Access Control: The KLAIM Experience
Synthesising Choreographies from Local Session Types
The Need for Headers: An Impossibility Result for Communication over Unreliable Channels
Efficient Coalgebraic Partition Refinement
A Trace Consistent Subset of PTL
Interface Refinement in Reactive Systems (Extended Abstract)
On Flatness for 2-Dimensional Vector Addition Systems with States
Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata
Faster and Smaller Solutions of Obliging Games
A Spatial Equational Logic for the Applied pi-Calculus
Modal Logics for Mobile Processes
Is Speed-Independent Mutual Exclusion Implementable? (Invited Talk)
Life Is Random, Time Is Not: Markov Decision Processes with Window Objectives
An Improved Failures Model for Communicating Processes
Bounded Petri Net Synthesis from Modal Transition Systems is Undecidable
Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations
Executing Temporal Logic Programs
Pareto-Rational Verification
Decidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems (Extended Abstract)
Probabilistic Simulations for Probabilistic Processes
Centralized vs Decentralized Monitors for Hyperproperties
From Bisimulation to Traces: The Impact of Parallel Composition on Finite Bases
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols
Trace Refinement of Action Systems
Model Checking Flat Freeze LTL on One-Counter Automata
Omega-Regular Verification and Control for Distributional Specifications in MDPs
Bidirectional Nested Weighted Automata
The Robot Routing Problem for Collecting Aggregate Stochastic Rewards
It's About Time: Real-Time Logics Reviewed
Two-Player Nonzero-Sum omega -Regular Games
At-Most-Once Message Delivery. A Case Study in Algorithm Verification
Structured Operational Sematics for Process Algebras and Equational Axiom Systems
Computing Inductive Invariants of Regular Abstraction Frameworks
Transformational Derivation of Systolic Arrays
A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes
Continuous Positional Payoffs
The Regular Viewpoint on PA-Processes
Kleene, Rabin, and Scott Are Available
Branching Bisimilarity for Processes with Time-Outs
The Best of Both Worlds: Model-Driven Engineering Meets Model-Based Testing
A Refinement Theory that Supports both 'Decrease of Nondeterminism' and 'Increase of Parallelism'
Domain-Aware Session Types
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
Regular Model Checking Upside-Down: An Invariant-Based Approach
On the Decidability of Non-Interleaving Process Equivalences
Efficient Modelling and Generation of Markov Automata
Perturbation Analysis in Verification of Discrete-Time Markov Chains
Simulations Between Specifications of Distributed Systems
Regular Sets of Pomsets with Autoconcurrency
On the Satisfiability of Indexed Linear Temporal Logics
A Generalized Event Structure for the Muller Unfolding of a Safe Net
Composition and Behaviors of Probabilistic I/O Automata
Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE
Hypernode Automata
Sortings for Reactive Systems
Soundness in Negotiations
Undecidability of Weak Bisimilarity for Pushdown Processes
Metrics for Labeled Markov Systems
Local First Search - A New Paradigm for Partial Order Reductions
Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking
Generalised Multiparty Session Types with Crash-Stop Failures
Alternating Nonzero Automata
Algebraic Characterization of Petri Net Pomset Semantics