yusuke1997/dblp-id-title huggingface dataset:
A Formal Model for Defining and Classifying Delay-Insensitive Circuits and Systems
Terminating distributed construction of shapes and patterns in a fair solution of automata
Distributed Shortest-Path Protocols for Time-Dependent Networks
Self-stabilizing smoothing and balancing networks
Partition consistency - A case study in modeling systems with weak memory consistency and proving correctness of their implementations
Peer counting and sampling in overlay networks based on random walks
Handling message semantics with Generic Broadcast protocols
Strong Stable Properties in Distributed Systems
Permissionless and asynchronous asset transfer
A simple population protocol for fast robust approximate majority
A Self-Adjusting Algorithm for Byzantine Agreement
Step Semantics for "True" Concurrency with Recursion
Fairness and hyperfairness
A time complexity lower bound for adaptive mutual exclusion
Node and edge averaged complexities of local graph problems
Operational Specification with Joint Actions: Serializable Databases
Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
Special issue on DISC 2019
A dynamic-sized nonblocking work stealing deque
Exhaustive Analysis and Simulation for Distributed Systems, both Sides of the Same Coin
Byzantine gathering in networks
Four shades of deterministic leader election in anonymous networks
A Class of Deadlock-Free Meakawa-Type Algorithms for Mutual Exclusion in Distributed Systems
Maximum throughput of multiple access channels in adversarial environments
A Logical Approach to Multilevel Security of Probabilistic Systems
Design and Verification of Fault Tolerant Systems with CSP
Synchronous condition-based consensus
Determining majority in networks with local interactions and very small local memory
A resource-competitive jamming defense
Mapping Dynamic Programming Onto Modular Linear Systolic Arrays
Consensus Algorithms with One-Bit Messages
TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications
Strong eventual consistency of the collaborative editing framework WOOT
On the Comnplexity of Global Computation in the Presence of Link Failures: The General Case
Iterative approximate Byzantine consensus in arbitrary directed graphs
Efficient Network Authentication Protocols: Lower Bounds and Optimal Implementations
Simple multi-party set reconciliation
Editorial: It's all about change
Exponential speedup over locality in MPC with optimal memory
Self-Stabilizing Depth-First Token Circulation on Networks
Rank Order Filters and Priority Queues
Optimal propagation-based protocols implementing causal memories
Special issue on PODC 2021 and DISC 2021
A leader election algorithm for dynamic networks with causal clocks
Optimal distributed covering algorithms
Early adapting to trends: self-stabilizing information spread using passive communication
Towards Systolizing Compilation
Access cost for asynchronous Byzantine quorum systems
Communication lower bounds for cryptographic broadcast protocols
Necessary and Sufficient Conditions on Information for Causal Message Ordering and Their Optimal Implementation
Forming sequences of geometric patterns with oblivious mobile robots
Action systems in incremental and aspect-oriented modeling
A Theorem on Atomicity in Distributed Algorithms
Approximating Wardrop equilibria with finitely many agents
The entropy of a distributed computation random number generation from memory interleaving
Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
A Modular Drinking Philosophers Algorithm
Alternators on uniform rings of odd size
Distributed construction of purely additive spanners
Randomized registers and iterative algorithms
Efficient Parallel Algorithms can be Made Robust
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts
A Highly Asynchronous Minimum Spanning Tree Protocol
Special issue on PODC 2018 and DISC 2018
Fault tolerance in distributed systems using fused state machines
Greedy Hot-Potato Routing on the Two-Dimensional Mesh
A Belated Proof of Self-Stabilization
Making Byzantine consensus live
A State-Based Approach to Communicating Processes
Compact separator decompositions in dynamic trees and applications to labeling schemes
Special issue with selected papers from PODC 2012
Distributed exploration of dynamic rings
Efficient Detection of a Class of Stable Properties
Proving convergence of self-stabilizing systems using first-order rewriting and regular languages
Early Consensus in an Asynchronous System with a Weak Failure Detector
Special issue on PODC 2009
On-The-Fly Garbage Collection for Several Mutators
Leakage-resilient coin tossing
Lower bounds for in-network computation of arbitrary functions
The complexity of automated addition of fault-tolerance without explicit legitimate states
Distributed minimum dominating set approximations in restricted families of graphs
Deterministic broadcasting in ad hoc radio networks
Low complexity Byzantine-resilient consensus
Low-latency atomic broadcast in the presence of contention
Protocol synthesis and re-synthesis with optimal allocation of resources based on extended Petri nets
The BG distributed simulation algorithm
Tight bounds for shared memory systems accessed by Byzantine processes
Tractable low-delay atomic memory
Universal dynamic synchronous self-stabilization
Secretary markets with local information
Tolerating permanent and transient value faults
When distributed computation is communication expensive
Mapping Image Processing Operations onto a Linear Systolic Machine
Atomic m-Register Operations
Correction to: Distributed computations in fully-defective networks
Shape formation by programmable particles
ATM layouts with bounded hop count and congestion
Computing Transitive Closure on Systolic Arrays of Fixed Size
The Distributed Simulation of Clustered Processes
The weakest failure detectors to boost obstruction-freedom
Optimizing scrip systems: crashes, altruists, hoarders, sybils and collusion
Asynchronous Byzantine Agreement with optimal resilience
Appraising two decades of distributed computing theory research
Deadlock-Free Message Routing in Multicomputer Networks
Improved deterministic distributed matching via rounding
Bounds on Evacuation Time for Deflection Routing
Efficient adaptive collect using randomization
Convergence of Iteration Systems
A Note on Consistency in Asynchronous Multicaches
Algebraic Specification and Proof of a Distributed Recovery Algorithm
Deriving Protocol Specifications from Service Specifications Written in LOTOS
Contention resolution on a fading channel
Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity
Fair Mutual Exclusion on a Graph of Processes
The overhead of consensus failure recovery
Randomized two-process wait-free test-and-set
Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
Specifications of Distributed Programs
Dynamic scheduling in distributed transactional memory
Randomized proof-labeling schemes
Calculational Derivation of aCounter with Bounded Response Time and Bounded Power Dissipation
A study on shuffle, stopwatches and independently evolving clocks
Concurrency theory: timed automata, testing, program synthesis
Simple and optimal randomized fault-tolerant rumor spreading
On the Existence of Delay-Insensitive Fair Arbiters: Trace Theory and its Limitations
Transaction Commit in a Realistic Timing Model
Optimizing content-based routers: posets and forests
Snap-stabilization and PIF in tree networks
A linear-time optimal-message distributed algorithm for minimum spanning trees
Randomized protocols for asynchronous consensus
Delay-Insensitive Codes - an Overview
Relationships between broadcast and shared memory in reliable anonymous distributed systems
Causality and Atomicity in Distributed Computations
Special Issue DISC 2005
Secure multi-party computation in large networks
Embedded pattern formation by asynchronous robots without chirality
Parallel Simulation on the Hypercube Multiprocessor
Special issue with selected papers from DISC 2012
Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
Lower Bounds for the Broadcast Problem in Mobile Radio Networks
Using Local-Spin k-Exclusion Algorithms to Improve Wait-Free Object Implementations
Compact and localized distributed data structures
Long-lived counters with polylogarithmic amortized step complexity
Networks on Which Hot-Potato Routing Does Not Livelock
Stable leader election in population protocols requires linear time
Keeping Track of the Latest Gossip in a Distributed System
A fast distributed approximation algorithm for minimum spanning trees
The RedBlue family of universal constructions
Distributed reconfiguration of metamorphic robot chains
Computing large independent sets in a single round
Low-Cost Clock Synchronization
Special issue on DISC 2008
Wait-Free Linearization with an Assertional Proof
Synthesizing optimal bias in randomized self-stabilization
Fast primal-dual distributed algorithms for scheduling and matching problems
Reliable broadcast with respect to topology knowledge
Distributed graph searching with a sense of direction
Lower bounds for asynchronous consensus
Sketching asynchronous data streams over sliding windows
Noisy rumor spreading and plurality consensus
An adaptive collect algorithm with applications
Self-stabilizing repeated balls-into-bins
Reliability Versus Cost: Design of a Probabilistic Broadcast Algorithm
Efficient computation in congested anonymous dynamic networks
A note on knowledge-based programs and specifications
Distributed Computing Issues in Hardware Design
Greedy routing in small-world networks with power-law degrees
Unbeatable consensus
Optimal smoothing schedules for real-time streams
Distributed transactional memory for metric-space networks
Some Impossibility Results in Interprocess Synchronization
Specifying Modules to Satisfy Interfaces: A State Transition System Approach
The design of a configurable and reconfigurable middleware platform
A distributed algorithm for directed minimum-weight spanning tree
DEX: self-healing expanders
Fast and fair randomized wait-free locks
Behavioural Notions for Elementary Net Systems
The correctness proof of Ben-Or's randomized consensus algorithm
Locally checkable problems in rooted trees
Genuinely distributed Byzantine machine learning
Non-blocking Patricia tries with replace operations
A Complete Axiomatic Semantics of Spawning
Efficient randomized test-and-set implementations
Lazy Caching in TLA
Towards worst-case churn resistant peer-to-peer systems
Distributed backup placement
Self-Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity
A family of optimal termination detection algorithms
Formal verification of mobile robot protocols
Bounded-Contention Coding for the additive network model
An Approach to Efficient Distributed Transactions
Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions
Anonymous obstruction-free (n, k)-set agreement with n-k+1 atomic read/write registers
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks
Linear-in-Δ lower bounds in the LOCAL model
Contention-free MAC protocols for asynchronous wireless sensor networks
No sublogarithmic-time approximation scheme for bipartite vertex cover
Shared-memory mutual exclusion: major research trends since 1986
Fully-adaptive algorithms for long-lived renaming
Fast distributed algorithms for testing graph properties
Introduction to the special issue DISC 2003
Extending the wait-free hierarchy to multi-threaded systems
Coupling and self-stabilization
An Incremental Garbage Collection Algorithm for Multi-Mutator Systems
New bounds for the controller problem
An optimistic approach to lock-free FIFO queues
Resilient-optimal interactive consistency in constant time
The Level of Handshake Required for Managing a Connection
Review on Verified Functional Programming in Agda : By Aaron Stump ACM, ISBN: 978-1-97000-126-6, 246 pages, 2016
Improving design decomposition (extended version)
A Predicate Transformer for the Progress Property 'To-Always'
A game-theoretic framework for specification and verification of cryptographic protocols
Modular verification of programs with effects and effects handlers
Formalizing Process Algebraic Verifications in the Calculus of Constructions
Safety and Progress of Recursive Procedures
Verification of Crashsafe Caching in a Virtual File System Switch
TFA: an efficient and precise virtual method call resolution for Java
Introducing extra operations in refinement
Rod Burstall: A Personal Note
Recursion Induction for Real-Time Processes
Property-directed incremental invariant generation
Inferring Switched Nonlinear Dynamical Systems
Model-based problem solving for university timetable validation and improvement
On CCS with Parametric Relabelling
A unification of probabilistic choice within a design-based model of reversible computation
Repsonse to "The Formal Specification of Safety Requirements for Storing Explosives" (Short Communication)
Inductive Families
Certifying circuits in Type Theory
Language Family Engineering with Product Lines of Multi-level Models
Specification and Verification of Multi-Clock Systems Using a Temporal Logic with Clock Constraints
Amílcar Sernadas
Hybrid Verifications of Reactive Programs
Fifty years of Hoare's logic
Structured derivations: a unified proof style for teaching mathematics
PuRSUE -from specification of robotic environments to synthesis of controllers
A CSP model with flexible parallel termination semantics
Command Algebras, Recursion and Program Transformation
ERC - An object-oriented refinement calculus for Eiffel
John Fitzgerald, Peter Gorm Larsen, Marcel Verhoef (eds): Collaborative design for embedded systems - Springer, Berlin Heidelberg, 2014
Introduction to the Special Collection from iFM 2023
Conformance Tests for Real-Time Systems with Timed Automata Specifications
Consistent integration of models based on views of meta models
Infinite Concurrent Systems-I. The Relationship between Metric and Order Convergence
Semantics of Under-determined Expressions
A Theory of Processes with Localities
Running Programs Backwards: The Logical Inversion of Imperative Computation
Model-checking dense-time Duration Calculus
Variations on Algebra: Monadicity and Generalisations of Equational Theories
The Formal Specification of Safety Requirements for Storing Explosives
Bit-Vector Typestate Analysis
Unifying proof methodologies of duration calculus and timed linear temporal logic
Process Algebra with Guards: Combining Hoare Logic with Process Algebra
Stream-Based Specification of Mobile Systems
Extensional Petri net
On the correctness of upper layers of automotive systems
Discovery of invariants through automated theory formation
Efficient representation of the attacker's knowledge in cryptographic protocols analysis
Does Every Computer Scientist Need to Know Formal Methods?
Automating the transformation-based analysis of visual languages
Composing and Refining Dense Temporal Logic Specifications
Safe abstractions of data encodings in formal security protocol models
Action Refinement Applied to Late Decisions
POP, A Broad-Spectrum Programming Language, 1967-2002
Laws of mission-based programming
Constructing and visualizing chemical reaction networks from pi-calculus models
Comprehensive Systems: A formal foundation for Multi-Model Consistency Management
Optimal and robust controller synthesis using energy timed automata with uncertainty
METATEM: An Introduction
On the purpose of Event-B proof obligations
On modelling recursive calls and callbacks with two variants of Unified Modelling Language state diagrams
Do-It-Yourself Type Theory
Principles of Abstract Interpretation: By Patrick Cousot MIT Press, 2021, ISBN 9780262044905, pp. 1-819. Reviewed by Reinhard Wilhelm
The Turing Guide - By Jack Copeland, Jonathan Bowen, Mark Sprevak, Robin Wilson and others Oxford University Press, Oxford, UK, 26 January 2017, xv+576 pp, 246 × 189 mm, ISBN: 9780198747826 (Hardback, $75.00), ISBN: 9780198747833 (Paperback, $19.99)
Dynamic role authorization in multiparty conversations
A verification-driven framework for iterative design of controllers
Using fold-in and fold-out in the architecture recovery of software systems
Multitraces, Hypertraces and Partial Order Semantics
RNA: R1CS Normalization Algorithm Based on Data Flow Graphs for Zero-Knowledge Proofs
Richer Types for Z
Relational concurrent refinement part II: Internal operations and outputs
Timed runtime monitoring for multiparty conversations
Testing restorable systems: formal definition and heuristic solution based on river formation dynamics
Soundness of workflow nets: classification, decidability, and analysis
Frama-C: A software analysis perspective
Parameterized Hardware Verification Through A Term-level Generalized Symbolic Trajectory Evaluation And Its Linkage With Concrete Hardware Verification At Netlist Level
Slicing Programs in the Presence of Errors
Sequential to Parallel Buffer Refinement (Short Communication)
Verifying compiled file system code
Multi-objective ω-Regular Reinforcement Learning
Compositional Generation of Home States in Free Choice Nets
Refinement Concepts Formalised in Higher Order Logic
A formal verification technique for behavioural model-to-model transformations
Verification of Schedulability for Real-Time Programs
Presupposition Failure-A Comedy of Errors
Reachability analysis of fragments of mobile ambients in AC term rewriting
Using Units of Measurement in Formal Specifications
Predicate Transformers as Power Operations
A model checking-based approach for security policy verification of mobile systems
Refinement and retrenchment for programming language data types
Duration Calculus: Logical Foundations
A Structured Way to Use Channels for Communication in X-Machine Systems
Learning safe neural network controllers with barrier certificates
FVF-AKA: A Formal Verification Framework of AKA Protocols for Multi-server IoT
Memory Consistency and Program Transformations
Threaded behavior protocols
A Fully Abstract Semantics of Classes for Object-Z
Fun with FireWire: A Comparative Study of Formal Verification Methods Applied to the IEEE 1394 Root Contention Protocol
Parallelisation of Divide-and-Conquer in the Bird-Meertens Formalism
Applications of real number theorem proving in PVS
Optimizing sorting algorithms by using sorting networks
Generator Induction in Order Sorted Algebras
A generalized semantics of PROMELA for abstract model checking
Mutation testing in UTP
Real-Time Refinement in Manna and Pnueli's Temporal Logic
Dynamic intransitive noninterference revisited
Efficient data validation for geographical interlocking systems
Modelling Multiple Inheritance with Colimits
A Refinement Calculus for Shared-Variable Parallel and Distributed Programming
Superposition: composition vs refinement of non-deterministic, action-based systems
Formal verification of a pervasive messaging system
Operational semantics of resolution and productivity in Horn clause logic
Reversible client/server interactions
A formal approach to property testing in causally consistent distributed traces
On the formal analysis of Gaussian optical systems in HOL
Concerned with the unprivileged: user programs in kernel refinement
Abstractions of non-interference security: probabilistic versus possibilistic
HYPE: Hybrid modelling by composition of flows
Equational formulas and pattern operations in initial order-sorted algebras
Improved algorithms for optimal length resolution refutation in difference constraint systems
Finding suitable variability abstractions for lifted analysis
Reasoning About Prolog Programs: From Modes Through Types to Assertions
Toward Verifying Cooperatively Scheduled Runtimes Using CSP
Modeling layered distributed communication systems
An incremental development of the Mondex system in Event-B
Graph transformations for object-oriented refinement
Simulation relations for fault-tolerance
Z2SAL: a translation-based model checker for Z
Model checking the observational determinism security property using PROMELA and SPIN
Partial order semantics for use case and task models
Code obfuscation against abstraction refinement attacks
Assertion-based slicing and slice graphs
GPU-accelerated steady-state computation of large probabilistic Boolean networks
Variability-based model transformation: formal foundation and application
Layered reasoning for randomized distributed algorithms
Lower bounds on lengths of checking sequences
Barrier synchronisation: Axiomatisation and relaxation
A UTP semantics for Circus
Typed context awareness Ambient Calculus for pervasive applications
RiskStructures: A design algebra for risk-aware machines
A Maude environment for CafeOBJ
An approach to formal verification of human-computer interaction
X-Machines and the Halting Problem: Building a Super-Turing Machine
CSP theorems for communicating B machines
The Cash-Point (ATM) 'Problem'
Identifying Overly Restrictive Matching Patterns in SMT-based Program Verifiers (Extended Version)
An 'Executable' Impredicative Semantics for the Ada Configuration
Case Study in Protocol Validation: Validating an ATM Signalling Protocol
An inductive approach to strand spaces
Kaki: Efficient Concurrent Update Synthesis for SDN
Code-carrying theories
Natural Semantics-Directed Generation of Compilers and Abstract Machines
Tournaments for mutual exclusion: verification and concurrent complexity
A Mechanically Proved and Incremental Development of IEEE 1394 Tree Identify Protocol
The Cash-Point Service in NUT
Data Abstraction Techniques in the Validation of CSP-OZ Specifications
Specification, proof, and model checking of the Mondex electronic purse using RAISE
A Formal Semantics of Data Flow Diagrams
Factorisation of Finite State Machines under Strong and Observational Equivalences
Finding semantic associations in hierarchically structured groups of Web data
Automatic Verification of a Class Systolic Circuits
The Verification of Modules
Compositional noninterference from first principles
Automatic verification of Java programs with dynamic frames
L * -based learning of Markov decision processes (extended version)
Cut Set Analysis using Behavior Trees and model checking
Three Inadequate Models
Legislation-driven development of a Gift Aid system using Event-B
Synthesizing structural and behavioral control for reconfigurations in component-based systems
Discovering and correcting a deadlock in a channel implementation
Deriving bisimulation relations from path based equivalence checkers
The Safety-Critical Java memory model formalised
Fault trees on a diet: automated reduction by graph rewriting
Formal Verification of Robotic Cell Injection systems up to 4-DOF using HOL Light
On the expressive power of behavioral profiles
The mechanical generation of fault trees for reactive systems via retrenchment II: clocked and feedback circuits
Guest Editorial Editorial for the FAC Special Issue based on derivative papers from "Refine '05"
A Transformation-Based Synthesis of Temporal Specifications
Practical Modelling with Bigraphs
In Memoriam: Peter H. G. Aczel (1941-2023)
Hybrid statistical estimation of mutual information and its application to information flow
The CtCoq System: Design and Architecture
Linear Approximation of Execution-Time Constraints
Disciplined, efficient, generalised folds for nested datatypes
From control law diagrams to Ada via Circus
Petri Net Based Verification of Distributed Algorithms: An Example
What are X-Machines?
A Formal Model of Asynchronous Communication and its Use in Mechanically Verifying a Biphase Mark Protocol
Abstraction and Testing in CSP
Reasoning with graph constraints
Distributing Finite Automata Through Petri Net Synthesis
Validating the PSL/Sugar Semantics Using Automated Reasoning
Parameterized verification of monotone information systems
Constraint-based correctness proofs for logic program transformations
Temporal Theories as Modularisation Units for Concurrent System Specification