yusuke1997/dblp-id-title huggingface dataset:
Computing Minimum and Maximum Reachability Times in Probabilistic Systems
Reactive Synthesis Without Regret
Contracts for Mobile Processes
Divergence and Unique Solution of Equations
Bisimulation by Partitioning Is Ω((m+n)log n)
The NIL Distributed Systems Programming Language: A Status Report
Process Calculus Based upon Evaluation to Committed Form
Decidability Problems for Actor Systems
CONCUR '97: Concurrency Theory, 8th International Conference, Warsaw, Poland, July 1-4, 1997, Proceedings
Applications of Automata and Concurrency Theory in Networks (Invited Paper)
On the Use of Non-deterministic Automata for Presburger Arithmetic
Weak Time Petri Nets Strike Back!
Randomized Non-sequential Processes
SMT-Based Model Checking of Max-Plus Linear Systems
Experiments on Processes with Backtracking
Taming Interface Specifications
An Operational Semantics of ANDOR-II, A Parallel Logic Programming Language with AND- and OR- Parallelism
Controlling Reversibility in Higher-Order Pi
Compositional Choreographies
Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic
Concurrent Rewriting for Graphs with Equivalences
Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks
28th International Conference on Concurrency Theory, CONCUR 2017, Berlin, Germany, September 5-8, 2017
Contract-Directed Synthesis of Simple Orchestrators
A Scalable and Oblivious Atomicity Assertion
Hyperplane Separation Technique for Multidimensional Mean-Payoff Games
Two Variable vs. Linear Temporal Logic in Model Checking and Games
A Behavioural Pseudometric for Metric Labelled Transition Systems
Sometimes and Not Never Re-revisited: On Branching Versus Linear Time
A Compositional Framework for Controller Synthesis
Coalgebraic Models for Reactive Systems
On Negotiation as Concurrency Primitive
Compositional Synthesis of Live and Bounded Free Choice Petri Nets
Merged Processes - A New Condensed Representation of Petri Net Behaviour
Axioms for Memory Access in Asynchronous Hardware Systems
Fibrational Initial Algebra-Final Coalgebra Coincidence over Initial Algebras: Turning Verification Witnesses Upside Down
An Extensional Spatial Logic for Mobile Processes
Automating Modular Verification
A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps (Extended Abstract)
Decoding Choice Encodings
Modal Decomposition on Nondeterministic Probabilistic Processes
From CML to Process Algebras (Extended Abstract)
Modular Completeness for Communication Closed Layers
Faithful Simulation of Randomized BFT Protocols on Block DAGs
Typing and Subtyping Mobility in Boxed Ambients
A Theory of Testing for Markovian Processes
The Control of Synchronous Systems
A Comparison of Succinctly Represented Finite-State Systems
Process Algebra with Guards - Combining Hoare Logic with Process Algebra (Extended Abstract)
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
Weak and Strong Composition of High-Level Petri-Nets
Will I be Preety, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering
Typing Messages for Free in Security Protocols: The Case of Equivalence Properties
Fairness in Models with True Concurrency
On Bisimulations for the Asynchronous pi-Calculus
Compositional Proof Systems for Model Checking Infinite State Processes
Reachability Problem for Weak Multi-Pushdown Automata
Subgame-Perfect Equilibria in Mean-Payoff Games
Timed Shuffle Expressions
Full Abstraction for HOPLA
A Relational Model of Non-deterministic Dataflow
Controllers for the Verification of Communicating Multi-pushdown Systems
Alphabet-Based Synchronisation is Exponentially Cheaper
A Compositional Approach to the Stochastic Dynamics of Gene Networks
Representations of Petri Net Interactions
Characterizations of Fragments of Temporal Logic over Mazurkiewicz Traces
The Logical Structure of Concurrent Constraint Programming Languages (Abstract)
Reachability in Succinct and Parametric One-Counter Automata
Widening the Boundary between Decidable and Undecidable Hybrid Systems
Fully Abstract Models for Nondeterministic Regular Expressions
A Sound Algorithm for Asynchronous Session Subtyping
From Model Checking to Model Measuring
Coverage Games
Repairing Multi-Player Games
On the Composition and Decomposition of Assertions
CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper)
A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk)
On the Power of Name-Passing Communication
Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification
Full Abstraction in a Subtyped pi-Calculus with Linear Types
An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages
Timed vs. Time-Triggered Automata
Dynamic Access Control in a Concurrent Object Calculus
Modeling Interval Order Structures with Partially Commutative Monoids
Introduction to Modal and Temporal Mu-Calculi (Abstract)
Multiparty Session Types as Coherence Proofs
Homogeneous Equations of Algebraic Petri Nets
Control of Networks of Unmanned Vehicles
As Soon as Possible but Rationally
Choreographies, Logically
Concurrent Reversible Sessions
Concurrency 88: International Conference on Concurrency, Hamburg, FRG, October 18-19, 1988, Proceedings
Compositionality for Probabilistic Automata
Well-Abstracted Transition Systems
A Process Algebra with Distributed Priorities
A Process-Algebraic Language for Probabilistic I/O Automata
Checking a Mutex Algorithm in a Process Algebra with Fairness
A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types
Synthesis from Knowledge-Based Specifications (Extended Abstract)
An Implementation of a Translational Semantics for an Imperative Language
Long-Run Average Behavior of Vector Addition Systems with States
Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs
A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups
On Discretization of Delays in Timed Automata and Digital Circuits
SProc Categorically
Scalable Termination Detection for Distributed Actor Systems
Bigraphical Reactive Systems
Deterministic Systems of Sequential Processes: Theory and Tools
Bidding Games with Charging
Reversibility and Asymmetric Conflict in Event Structures
Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable
Geometry of Interaction (Abstract)
Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems
Synthesis of Large Concurrent Programs via Pairwise Composition
The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation
On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing
Programming with Broadcasts
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs
Weak Bisimulation Up to Elaboration
Weakest-Congruence Results for Livelock-Preserving Equivalences
Reduction and Design of Well-behaved Concurrent Systems
Towards a denotational semantics for ET-LOTOS
Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs
ACSR: An Algebra of Communicating Shared Resources with Dense Time and Priorities
Winning Regions of Pushdown Parity Games: A Saturation Method
A Model of Dynamic Separation for Transactional Memory
Two Fully Abstract Models for UNITY
Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable
Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions
Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks
Nested Protocols in Session Types
Bayesian Inversion by ω-Complete Cone Duality
Process-Algebraic Models of Multi-Writer Multi-Reader Non-Atomic Registers
Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation - (Extended Abstract)
Checking Linearizability of Concurrent Priority Queues
On the Semantics of Place/Transition Nets
A Temporal Logic for Strategic Hyperproperties
Synchronizing the Asynchronous
Reduced Labelled Transition Systems Save Verification Effort
(Un)decidable Problems about Reachability of Quantum Systems
Concavely-Priced Probabilistic Timed Automata
A State-Based O(m log n) Partitioning Algorithm for Branching Bisimilarity
Characterizing Behavioural Congruences for Petri Nets
Deadlock Analysis of Unbounded Process Networks
Session Subtyping and Multiparty Compatibility Using Circular Sequents
Fair Simulation
Axioms for Real-Time Logics
The Pros and Cons of Netcharts
Model Checking of Time Petri Nets Based on Partial Order Semantics
The Complexity of Rational Synthesis for Concurrent Games
CCSR: A Calculus for Communicating Shared Resources
Alternative Semantics for McCarthy's amb
Avoiding Shared Clocks in Networks of Timed Automata
26th International Conference on Concurrency Theory, CONCUR 2015, Madrid, Spain, September 1-4, 2015
Causal Ambiguity and Partial Orders in Event Structures
Action Systems and Action Refinement in the Development of Parallel Systems - An Algebraic Approach
Process Spaces
Local Event Structures and Petri Nets
Reasoning with MAD Distributed Systems
Temporal Logic + Timed Automata: Expressiveness and Decidability
A Modular Approach for Büchi Determinization
Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications
Lazy Reachability Analysis in Distributed Systems
Quantitative Language Automata
CONCUR 2003 - Concurrency Theory, 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings
On Locality and the Exchange Law for Concurrent Processes
Modal Logics for Mobile Processes Revisited
Expresiveness and Complexity Results for Strategic Reasoning
The Decidability of the Reachability Problem for CCS!
Safety Verification of Asynchronous Pushdown Systems with Shaped Stacks
The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic
Reachability Problems for Continuous Linear Dynamical Systems (Invited Paper)
Regular Model Checking Made Simple and Efficient
Implementing LOTOS Specifications by Communicating State Machines
Fixed-Delay Events in Generalized Semi-Markov Processes Revisited
Session Types for Functional Multithreading
Synchronizing Strategies under Partial Observability
History-Deterministic Timed Automata
Simulation for Continuous-Time Markov Chains
A General Framework for Well-Structured Graph Transformation Systems
Control Flow Analysis for the pi-calculus
Least Upper Bounds for Probability Measures and Their Applications to Abstractions
Checking Regular Properties of Petri Nets
A Capability Calculus for Concurrency and Determinism
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Parametrized Universality Problems for One-Counter Nets
Narrowing down the Hardness Barrier of Synthesizing Elementary Net Systems
Synchronous Structures
Concurrency Meets Probability: Theory and Practice - (Abstract)
"Next" Heuristic for On-the-Fly Model Checking
Static Analysis Versus Model Checking for Bug Finding
Mapping the Security Landscape: A Role for Language Techniques
Behavioural Equivalences for Co-operating Transactions (Invited Paper)
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies
Characterizing Bisimulation Congruence in the pi-Calculus (Extended Abstract)
CONCUR Test-Of-Time Award 2022 (Invited Paper)
Modeling Radio Networks
A Compositional Trace-Based Semantics for Probabilistic Automata
Synthesis of Distributed Algorithms Using Asynchronous Automata
Fair Testing
Model-Checking Counting Temporal Logics on Flat Structures
Probabilistic Programming (Invited Talk)
Resource Control for Synchronous Cooperative Threads
Extending Memory Consistency of Finite Prefixes to Infinite Computations
Algebras of Processes of Timed Petri Nets
Data in a Concurrent Environment
Recent Developments in the Mathematics of Reactive Systems (Extended Abstract)
Weak Kripke Structures and LTL
Simulation Is Decidable for One-Counter Nets (Extended Abstract)
Coarse Abstractions Make Zeno Behaviours Difficult to Detect
Measuring Permissivity in Finite Games
Vector Addition System Reversible Reachability Problem
Solving Games Via Three-Valued Abstraction Refinement
Proving Liveness by Backwards Reachability
Prophecies All the Way: Game-Based Model-Checking for HyperQPTL Beyond ∀*∃*
Symbolic Algorithms for Infinite-State Games
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
On Verifying Concurrent Programs Under Weakly Consistent Models (Invited Talk)
CONCUR Test-Of-Time Award 2023 (Invited Paper)
Axiomatizing an Algebra of Step Reactions for Synchronous Languages
Selective Monitoring
A Coalgebraic Take on Regular and omega-Regular Behaviour for Systems with Internal Moves
Monads and Quantitative Equational Theories for Nondeterminism and Probability
On the Compositional Checking of Validity (Extended Abstract)
Merging Partial Behaviour Models with Different Vocabularies
SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs
Structural Operational Specifications and the Trace Automata
Controlling a Population
Safe Realizability of High-Level Message Sequence Charts
Automatic Application Deployment in the Cloud: from Practice to Theory and Back (Invited Paper)
Taming Distributed Asynchronous Systems
Abstract Patterns of Compositional Reasoning
Generalized Universality
Strict Divergence for Probabilistic Timed Automata
A Facile Tutorial
Parameterised Boolean Equation Systems (Extended Abstract)
A Linear Local Model Checking Algorithm for CTL
Dynamic Reactive Modules
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties
Strategy Synthesis for Markov Decision Processes and Branching-Time Logics
Statecharts Via Process Algebra
Distributed Monitoring of Concurrent and Asynchronous Systems
Reuse of Concurrent Object Descriptions
Verification of Flat FIFO Systems
On Runtime Enforcement via Suppressions
Polynomial Time Decidability of Weighted Synchronization under Partial Observability
Higher-Order Linearisability
Pushdown Processes: Parallel Composition and Model Checking
Half-Positional Objectives Recognized by Deterministic Büchi Automata
Efficient On-the-Fly Algorithms for the Analysis of Timed Games
Modeling Computational Security in Long-Lived Systems
Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
Transformations Preserving Properties and Properties Preserved by Transformations in Fair Transition Systems (Extended Abstract)
CONCUR '90, Theories of Concurrency: Unification and Extension, Amsterdam, The Netherlands, August 27-30, 1990, Proceedings
Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis
Relating Processes With Respect to Speed
Expressive Power of Broadcast Consensus Protocols
The Expressive Power of Temporal Logic of Actions (Extended Abstract)
Simulation Distances
Expressiveness Results for an Inductive Logic of Separated Relations
Open Systems in Reactive Environments: Control and Synthesis
Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking
Priority Rewrite Systems for OSOS Process Languages
Strategies for MDP Bisimilarity Equivalence and Inequivalence
Towards Automata for Branching Time and Partial Order
Reachability in Vector Addition System with States Parameterized by Geometric Dimension
Truly Concurrent Constraint Programming
Types for Dyadic Interaction
Action Refinement and Property Inheritance in Systems of Sequential Agents
HOPLA-A Higher-Order Process Language
Generic Process Algebras for Asynchronous Communication
Symbolic Transition Graph with Assignment
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights
Verification Using Tabled Logic Programming
On Bisimulation in the pi-calculus
A Ground-Complete Axiomatization of Finite State Processes in Process Algebra
An Elimination Theorem for Regular Behaviours with Integration
Partially-Commutative Context-Free Processes
Priority as Extremal Probability
Chance and Mass Interpretations of Probabilities in Markov Decision Processes
A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises
Temporal Process Logic (Abstract)
Parameterized Verification of Ad Hoc Networks
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
Flow Policy Awareness for Distributed Mobile Code
Completeness for Identity-free Kleene Lattices
Linear Temporal Logic with Standpoint Modalities (Invited Talk)
CONCUR 2012 - Concurrency Theory - 23rd International Conference, CONCUR 2012, Newcastle upon Tyne, UK, September 4-7, 2012. Proceedings
Topology-Dependent Abstractions of Broadcast Networks
Bisimulation Equivalence is Decidable for all Context-Free Processes
Decompositions of Asynchronous Systems
A Categorical Axiomatics for Bisimulation
CONCUR '91, 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991, Proceedings
Syntactic Formats for Free
Weak Bisimulation for Probabilistic Systems
Modern Applications of Game-Theoretic Principles (Invited Paper)
From Timed Graphs to Hybrid Automata (Abstract)
Timed Ethernet: Real-Time Formal Specification of Ethernet
On the Separability Problem of String Constraints
On Safety and Timeliness in Distributed Data Management
Secrecy and Group Creation
Progress, Justness and Fairness in Modal μ-Calculus Formulae
Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics
Localizability of Fairness Constraints and Their Distributed Implementations
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes
Reasoning about Threads with Bounded Lock Chains
Modeling Consensus in a Process Calculus
Subsequence Invariants
Ethical Preference-Based Decision Support Systems
Intensional and Extensional Characterisation of Global Progress in the π-Calculus
The Power of Counting Steps in Quantitative Games
A Logic-Based Framework for Reasoning about Composite Data Structures
Compositional Correctness and Completeness for Symbolic Partial Order Reduction
Dual Channel Dual Staging: Hierarchical and Portable Staging for GPU-Based In-Situ Workflow
Improving Communication Throughput by Multipath Load Balancing on Blue Gene/Q
SpikeNC: An Accurate and Scalable Simulator for Spiking Neural Network on Multi-Core Neuromorphic Hardware
Efficient Secure Aggregation in Sensor Networks
An Efficient Web Cache Replacement Policy
Combining HoL-blocking avoidance and differentiated services in high-speed interconnects
Service Oriented Architecture for job submission and management on grid computing resources
Highly scalable barriers for future high-performance computing clusters
Process Migration Effects on Memory Performance of Multiprocessor
Designing systems for large-scale, discrete-event simulations: Experiences with the FastTrans parallel microsimulator
Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters - an Experimental Study
CUDA M3: Designing Efficient CUDA Managed Memory-Aware MPI by Exploiting GDR and IPC
A Volumetric FFT for BlueGene/L
TWLinuX : Operating System Support for Optimistic Parallel Discrete Event Simulation
Variations in Residential Electricity Demand Across Income Categories in Urban Bangalore: Results from Primary Survey
Compact Routing in Directed Networks with Stretch Factor of Two
Deadline Assignment in Multiprocessor-Based Fault-Tolerant Systems
Design, Analysis, and Performance Evaluation of an Efficient Resource Unaware Scheduling Strategy for Processing Divisible Loads on Distributed Linear Daisy Chain Networks
Integrating traffic estimation and dynamic channel reconfiguration in Wireless Mesh Networks
The Excitement in Parallel Computing
2010 International Conference on High Performance Computing, HiPC 2010, Dona Paula, Goa, India, December 19-22, 2010
Simulation of Large-Scale HPC Storage Systems: Challenges and Methodologies
Design and Study of Elastic Recovery in HPC Applications
Neural Confidence Estimation for More Accurate Value Prediction
Quantitive studies of data-locality sensitivity on the EARTH multithreaded architecture: preliminary results
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
High Throughput Hierarchical Heavy Hitter Detection in Data Streams
Performance = Implementation + Hardware + Input Data, with application to SpMV
Partitioning PCS Networks for Distributed Simulation
DAGit: A Platform For Enabling Serverless Applications
Designing a Profiling and Visualization Tool for Scalable and In-depth Analysis of High-Performance GPU Clusters
Object Detection for Autonomous Vehicles in Adverse Weather and Varying Lighting Conditions Using a Hybrid YOLO Approach
LOSM: Leveraging OpenMP and Shared Memory for Accelerating Blocking MPI Allreduce
Information Theory Based Genome-Scale Gene Networks Construction Using MapReduce
Reduce, Reuse, and Adapt: Accelerating Graph Processing on GPUs
Parallel and Distributed Frequent Itemset Mining on Dynamic Datasets
High Performance Computing - HiPC 2004, 11th International Conference, Bangalore, India, December 19-22, 2004, Proceedings
Phase Directed Compiler Optimizations
Parallelizing Hines Matrix Solver in Neuron Simulations on GPU
Compiler generation and autotuning of communication-avoiding operators for geometric multigrid
Designing an Independent Study to Create HPC Learning Experiences for Undergraduates
A 118 GOPS/mm 2 3D eDRAM TensorCore Architecture for Large-scale Matrix Multiplication
A new method for face recognition with fewer features under illumination and expression variations
Orthogonal Decision Trees for Resource-Constrained Physiological Data Stream Monitoring Using Mobile Devices
Privacy Preserving in Blockchain Based on Partial Homomorphic Encryption System for Ai Applications
A high performance broadcast design with hardware multicast and GPUDirect RDMA for streaming applications on Infiniband clusters
DistMILE: A Distributed Multi-Level Framework for Scalable Graph Embedding
More on arbitrary boundary packed arithmetic
Analysis and tuning of libtensor framework on multicore architectures
Probabilistic Sequential Consistency in Social Networks
Provably Efficient Scheduling of Dynamically Allocating Programs on Parallel Cache Hierarchies
Info-Bio-Nano Interface: High-Performance Computing & Visualization
Efficient Algorithms for Delay Bounded Multicast Tree Generation for Multimedia Applications
Reuse Distance Based Cache Leakage Control
Algorithms for Preemptive Co-scheduling of Kernels on GPUs
Energy Efficient Predictive Beamforming and 5G Cell Management using SDN
Incremental data dependence analysis
Framework for Automatic Parallelization
CU2rCU: Towards the complete rCUDA remote GPU virtualization and sharing solution
Collaborative Vying in Proof of Useful Work
GLB: a low-cost scheduling algorithm for distributed-memory architectures
Shared-memory implementation of the Karp-Sipser kernelization process
A robust and flexible microeconomic scheduler for parallel computers
Reconfigurable custom computing as a supercomputer replacement
Improving Throughput of BigData Applications
The Future Evolution of High-Performance Microprocessors
Improving the efficiency of adaptive routing in networks with irregular topology
I/O performance characterization of Lustre and NASA applications on Pleiades
Scheduling Strategies for Controlling Resource Contention on Multiprocessor Systems
A different approach to high performance computing
Enabling Dependability-Driven Resource Use and Message Log-Analysis for Cluster System Diagnosis
Using Dataflow Based Contextfor Accurate Branch Prediction
HiPPAI: High Performance Portable Accelerator Interface for SoCs
Efficient Technique for Overcoming Data Migration in Dynamic Disk Arrays
High Performance Cycle Detection Scheme for Multiprocessing Systems
Computation of penetration measures for convex polygons and polyhedra for graphics applications
Efficient Parallel Algorithms and Software for Compressed Octrees with Applications to Hierarchical Methods
Exploring Efficient BCD to Binary Conversion Architecture Alternatives on FPGA
A Novel Frame Structure and Call Admission Control for Efficient Resource Management in Next Generation Wireless Networks
An X10-Based Distributed Streaming Graph Database Engine