yusuke1997/dblp-id-title huggingface dataset:
Revisiting causality, coalgebraically
On Derivation Languages Corresponding to Context-Free Grammars
Fair sticker languages
Functional Behavior in Data Spaces
A Model and a Fast Algorithm for Multiple Errors Spelling Correction
An Efficient ELL(1)-Parser Generator
The Expressive Power of the Bounded-Iteration Construct
On the Role of Unification in Mechanical Theorem Proving
Petri nets are dioids: a new algebraic foundation for non-deterministic net theory
Incremental Evaluation for Attribute Grammars with Unrestricted Movement Between Tree Modifications
Finite State Relational Programs
Infinite Proof Rules for Loops
Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
A Set-Theoretic Semantics for Clear
Automatic Analysis of Inflectional Morphems in German Nouns
On the Number of Relational Operators Necessary to Compute Certain Functions of Real Variables
On the piecewise complexity of words
Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints
Memory Requirements for Silent Stabilization
The Family of One-Counter Languages is Closed Under Quotient
On the tree-transformation power of XSLT
Correction to Null Values in Nested Relational Databases by Mark A. Roth, H. F. Korth, and A. Silberschatz
Optimum Binary Search Trees
An Analysis and Implementation of an Efficient In-Place Bucket Sort
Stochastic cooperative distributed grammar systems and random graphs
Erratum: The size of random bucket trees via urn models
A Note on Multi-queue Scheduling of Two Tasks
A New Formula for Speedup and its Characterization
An Easily Testable Optimal-Time VLSI-Multiplier
On the Generalization of Higman and Kruskal's Theorems to Regular Languages and Rational Trees
On the Costs of Optimal and Near-Optimal Binary Search Trees
A Unified Approach to the Generation and the Acception of Formal Languages
Some Average Performance Measures for the B-Tree
Graph Complexity
The descriptional power of queue automata of constant length
Computing Extremal and Approximate Distances in Graphs Having Unit Cost Edges
Generating Binary Trees of Bounded Height
Classifications of Dense Languages
Type-based information flow analysis for the pi-calculus
Arbitration Without Common Modifiable Variables
Space Sweep Solves Intersection of Convex Polyhedra
Online edge coloring of paths and trees with a fixed number of colors
Sequential Method in Propositional Dynamic Logic
A Probabilistic Analysis of the Height of Tries and of the Complexity of Triesort
A Petri Nets Semantics for Data Flow Networks
Relational Heuristics for the Design of Deterministic Programs
Data Encodings and Their Costs
On the Synchronization in Parallel Communicating Grammar Systems
Hybridization methods for the analysis of nonlinear systems
An encoding of the λ-calculus in the String MultiSet Rewriting calculus
A Formal Identification between Tuples and Lists with an Application to List-Arithmetic Categories
Lazy Structure Sharing for Query Optimization
Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2
On Merging Software Extensions
Grammarforms and Grammarhomomorphisms
On Huang and Wong's algorithm for generalized binary split trees
Causality for Debugging Mobile Agents
Compiling quantum programs
A Paxos based algorithm to minimize the overhead of process recovery in consensus
Algebraic Program Testing
An Algorithmic and Complexity Analysis of Interpolation Search
On Correct Procedure Parameter Transmission in Higher Programming Languages
The Instability of Self-Stabilization
Types in concurrency
Disambiguating Grammars by Exclusion of Sub-Parse Trees
On Sentential Forms of Context-Free Grammars
Proving Programs Correct through Refinement
Correction to: Sound reasoning in tock-CSP
Fast deterministic parsers for transition networks
Indecision and delays are the parents of failure - taming them algorithmically by synthesizing delay-resilient control
A Hierarchy Theorem for Multihead Stack-Counter Automata
Disjunctive languages related to p-primitive words
Äquivalente Transformationen für Flußdiagramme
Least Upper Bound on the Cost of Optimum Binary Search Trees
A Distributed Operational Semantics for CCS Based on Condition/Event Systems
Direction Controlled Programmed Grammars
Extracting unsatisfiable cores for LTL via temporal resolution
Extended Linear Macro Grammars, Iteration Grammars, and Register Programs
Least common container of tree pattern queries and its applications
A new bound for the D0L language equivalence problem
On the Average Internal Path Length of m -ary Search Trees
A decomposition theorem for finite persistent transition systems
Nonlinear Pattern Theory
Proportional lumpability and proportional bisimilarity
do Considered od: A Contribution to the Programming Calculus
Concurrent Access to Data
Constrained polynomial zonotopes
A Characterization of Set Representable Labeled Partial 2-Structures Through Decompositions
Optimal Merging of 2 Elements with n Elements
On the incremental growth and shrinkage of LR goto-graphs
Fault-tolerance in distance-edge-monitoring sets
Static versus dynamic reversibility in CCS
Using Graph Coloring in an Algebraic Compiler
Comparative genomics with succinct colored de Bruijn graphs
Letter from the Managing Editor
The Derivation of Systolic Implementations of Programs
Parallel Integer Sorting and Simulation Amongst CRCW Models
On the Complementation Rule for Multivalued Dependencies in Database Relations
Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs
Monotone Data Flow Analysis Frameworks
High Level Tree Transducers and Iterated Pushdown Tree Transducers
Geometric analysis of nondeterminacy in dynamical systems
A theory of ultimately periodic languages and automata with an application to time granularity
COSY - A System Specification Language Based on Paths and Processes
Update Operations in Deductive Databases with Functional Dependencies
Synthesis from hyperproperties
Generalized Theory of Serializability
Erratum: Maximum Entropy Two-Station Cyclic Queues with Multiple General Servers
Improved Time and Space Bounds for Boolean Matrix Multiplication
Some Modified Algorithms for Dijkstra's Longest Upsequence Problem
Specification transformers: a predicate transformer approach to composition
Locality Based Semantics for Process Algebras
Normal Forms for Context-Sensitive Grammars
Random sprouts as internet models, and Pólya processes
Packing rectangles in a strip
Some Beautiful Arguments Using Mathematical Induction
A decision procedure for propositional projection temporal logic with infinite models
Representation of Graphs
Strongest Invariant Functions: Their Use in the Systematic Analysis of While Statements
Compositional Analysis of C/C++ Programs with VeriSoft
Concurrent Bisimulations in Petri Nets
Recognition and Selection of Idioms for Code Optimization
An Algorithm for Merging Heaps
A Practical General Method for Constructing LR(k) Parsers
The Clean Termination of Iterative Programs
Symbolic models for control systems
On the Cost-Effectiveness of PRAMs
The Reliability of Life-Critical Computer Systems
A sequential real-time refinement calculus
Axiomatic Data Type Specifications: A First Order Theory of Linear Lists
Files d'attente exponentielles ayant des parametres non-stationnaires dans le temps
Unbalanced Multiway Trees Improved by Partial Expansions
The Mathematical Analysis of the Computer System Modeled as a Two Stage Cyclic Queue
A Feedback-Coupled Resource Allocation Policy for Multiprogrammed Computer Systems
On the Number of Active-Operations Needed to Compute the Discrete Fourier Transform
Bin stretching revisited
Database Survivability Under Dynamic Constraints
A Comparison of Storage Optimizations in Automatically-Generated Attribute Evaluators
Global Storage Cells for Attributes in an Attribute Grammar
Calculi for Interaction
On Generating Database Schemes Bounded or Constant-time-maintainable by Extensibility
Branching Processes in the Analysis of the Heights of Trees
The ( n,k )-Bounded Emptiness-Problem for Probabilistic Acceptors and Related Problems
A bi-criterion single-machine scheduling problem with learning considerations
Efficient execution of dynamically controllable simple temporal networks with uncertainty
Comparing Locality and Causality Based Equivalences
On Alternation
The weakest specifunction
Semantic Routines and LR(k) Parsers
Top-Down Syntax Analysis
An Alternative Approach to the Improvement of LR(k) Parsers
Pattern Matching in Trees and Nets
Proving Correctness of Coroutines Without History Variables
On Efficient Entreeings
Multi-tilde-bar expressions and their automata
Replaceability and Computational Equivalence for Monotone Boolean Functions
On the Complexity of Concurrency Control Using Semantic Information
Compositional construction of most general controllers
Applications of a Categorical Framework for Conceptual Data Modelling
Compositional type checking of delta-oriented software product lines
On the Response Time Distribution in a Discrete Round-Robin Queue
Properties of graphs specified by a regular language
On Generators and Generative Capacity of EOL Forms
A theory of formal synthesis via inductive learning
Subrekursive Komplexität bei Gruppen: I. Gruppen mit vorgeschriebener Komplexität
Reliability Theory of Program Testing
Probabilistic Bounds for Dual Bin-Packing
On Characterizations of Recursively Enumerable Languages
Optimal Codes, n-Arcs and Laguerre Geometry
Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. Teil I: Datenstrukturen und Schemata
Bi-Catenation and Shuffle Product of Languages
An O(V5/3 E2/3) Algorithm for the Maximal Flow Problem
A 2.5 n Lower Bound on the Monotone Network Complexity of T_3^n
Concurrency and Trie Hashing
On-Line Scheduling on a Single Machine: Minimizing the Total Completion Time
Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. II. Nondeterministic Systems
Practical synthesis of reactive systems from LTL specifications via parity games
A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R
Through the Mincing Machine with a Boolean Layer Cake
Modal algebra and Petri nets
Verification conditions are code
Universal Asynchronous Iterative Arrays of Mealy Automata
On the Relationship of Minimum and Optimum Covers for a Set of Functional Dependencies
A quadratic speedup theorem for iterative arrays
Investigations on Hotz Groups for Arbitrary Grammars
My time with Rob
Standard Model Semantics for DSL A Data Type Specification Language
Recognizable Trace Languages, Distributed Automata and the Distribution Problem
Minimizing Time-Space Cost for Database Version Control
A New Explanation of the Glitch Phenomenon
A note on autodense related languages
Weighted height of random trees
Expressiveness of component-based frameworks: a study of the expressiveness of BIP
The Ultimate Equivalence Problem for DOL Systems
A Single Server Queue with Mixed Types of Interruptions
S-Invariant Analysis of General Recursive Petri Boxes
Semi-synchronous transductions
Generalized Deterministic Left To Right Parsing
Rules of Inference for Procedure Calls
Random walks for selected boolean implication and equivalence problems
A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
A Fully Abstract Semantics for Causality in the \pi-Calculus
Abstraction and Performance in the Design of Parallel Programs: An Overview of the SAT Approach
Minimal consistent DFA from sample strings
The Universe Problem for Unrestricted Flow Languages
Two-way pebble transducers for partial functions and their composition
Multiparty session types as coherence proofs
Opérations de Cylindre et applications séquentielles gauches inverses
Tight bounds for the sensitivity of CDAWGs with left-end edits
Deterministic Grammars and Grammar Morphisms
A Binary Operation on Trees and an Initial Algebra Characterization for Finite Tree Types
Erratum: Proving Properties of Pascal Programs in MIZAR 2
Local Hausdorff Dimension
Code Generation Based on Formal BURS Therory and Heuristic Search
STG decomposition strategies in combination with unfolding
HDTOL Matching of Computations of Multitape Automata
Connectivity of workflow nets: the foundations of stepwise verification
Zur Theorie der Partiell-linearen Realisierungen endlicher Automaten
Kinded Type Inference for Parametric Overloading
Algorithms for Routing in Planar Graphs
New families of Laplacian borderenergetic graphs
An axiomatization of graphs
Correction to: Expressiveness of component-based frameworks: a study of the expressiveness of BIP
Preface for the special issue for ATVA 2015
Correction to: Reactive synthesis without regret
The Log-Structured Merge-Tree (LSM-Tree)
On Some Variants of Post's Correspondence Problem
Context-Free Graph Languages of Bounded Degree are Generated by Apex Graph Grammars
Developmental Systems with Locally Catenative Formulas
Well-structured languages
A Denotational Semantics for Shared-Memory Parallelism and Nondeterminism
Correction to: A linear-time branching-time perspective on interface automata
On the 3-tree core of plane graphs
Edsger W. Dijkstra - Acta Informatica and Marktoberdorf
On the tree inclusion problem
A Note on Degrees of Context-Sensitivity
A deterministic skip list for k-dimensional range search
Parameterized complexity of three edge contraction problems with degree constraints
Modularity and Expressibility for Nets of Relations
Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms
Special issue on temporal representation and reasoning (TIME'13)
A Markov modulated multi-server queue with negative customers - The MM CPP/GE/c/L G-queue
Nested Satisfiability
Moving from interface theories to assembly theories
Metric temporal logic revisited
A Model for Data Structures and its Applications. (Part II)
Remarks on the Complexity of an Invariant of Context-Free Grammars
LR error repair using the A* algorithm
Parallel Composition of Assumption-Commitment Specifications: A Unifying Approach for Shared Variable and Distributed Message Passing Concurrency
Weighted iterated linear control
About the Collatz Conjecture
An Incremental Mechanical Development of Systolic Solutions to the Algebraic Path Problem
Using session types for reasoning about boundedness in the π-calculus
On a Covering Relation for Context-Free Grammars
Elementary Transition Systems and Refinement
CCS: It's not fair! - Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
On the Existence of Symmetric Algorithms to Find Leaders in Networks of Communicating Sequential Processes
Optimal Scheduling for Two-Processor Systems
Equilibria for games with combined qualitative and quantitative objectives
Parameterized lower bounds for the weighted vertex cover problem in trees
Toward a theory of program repair
Verification of population protocols
Infinitary rewriting: closure operators, equivalences and models
L-Systems and Mutually Recursive Function Systems
Model checking the evolution of gene regulatory networks
Efficient controller synthesis for a fragment of MTL 0,∞
A Model of the Dynamic Behavior of B-Trees
Practical LL(1)-Based Parsing of van Wijngaarden Grammars
Trial and Error. A New Approach to Space-Bounded Learning
Bounds on the Parallel Evaluation of Arithmetic Expressions Using Associativity and Commutativity
Abstractions of data types
On the number of active states in finite automata
Parametrized invariance for infinite state processes
Exhaustive generation of combinatorial objects by ECO
Effect of Data Representation on Cost of Sparse Matrix Operations
The Relaxed min-max Heap
Semantic Decomposition of Computer Programs: An Aid to Program Testing
An On-Line Algorithm for Variable-Sized Bin Packing
Equivalence checking of Petri net models of programs using static and dynamic cut-points
Yet another generation of LALR parsers for regular right part grammars
Reachability analysis of reversal-bounded automata on series-parallel graphs
Embedding linear orders in grids
Gray code orders for q-ary words avoiding a given factor
A general procedure to check conjunctive query containment
The Primitive Deficiency of two Primitive Strings
Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. Teil II: Zugriffssysteme
Efficient recognition algorithms for boundary and linear eNCE graph languages
Context-Free Hypergraph Grammars have the Same Term-Generating Power as Attribute Grammars
Reversible sessions with flexible choices
Distributed Consensus, revisited
Picture deformation
Process algebra with action dependencies
Hiérarchie et fermeture de certaines classes de tag-systèmes
On Minimizing the Forall-Not Degree of a Connective-Free Formula
Distributive laws for monotone specifications
Dense non-binary Fibonacci codes
Comparing Expressibility of Normed BPA and Normed BPP Processes
An Approach to Automating the Verification of Compact Parallel Coordination Programs I
Maximum Entropy and the G/G/1/N Queue
Some properties of the disjunctive languages contained in Q
The Lattice of Data Refinement
Order and Metric in the Stream Semantics of Elemental Concurrency
A Formal Model of Atomicity in Asynchronous Systems
Corrections to "A Synthesis of Several Sorting Algorithms" by J. Darlington
Parallel Tree Contraction and Prefix Computations on a Large Family of Interconnection Topologies
Characterization of all Optimal Networks for a Simultaneous Computation of AND and NOR
Static Main Storage Packing Problems
Program Analysis and Optimization through Kernel-Control Decomposition
Plain CHOCS: A Second Generation Calculus for Higher Order Processes
On 3-Head Versus 2-Head Finite Automata
Special issue of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2015)
Van Wijngaarden Grammars and Space Complexity Classs EXSPACE
Embedding mappings and splittings with applications
Single Machine Scheduling with Deadlines and Increasing Rates of Processing Times
Boolesche Minimalpolynome und Überdeckungsprobleme
Parameterized algorithms for the Steiner arborescence problem on a hypercube
The Parsing Problem for Affix Grammars
Decision Problems Concerning Thinness and Slenderness of Formal Languages
On the closure of pattern expressions languages under intersection with regular languages
An Incremental Primal Sieve
Specification and Verification of Database Dynamics
Information Theoretic Approximations for M/G/ 1 und G/G/ 1 Queuing Systems
Reactive synthesis without regret
Fundamentals of Modelling Concurrency Using Discrete Relational Structures
Completeness of E 0 L Forms is Decidable
Decomposition of Graphs and Monotone Formula Size of Homogeneous Functions
Remarks on "Some Comments on Concurrent Readers and Writers" by Reidar Conradi
Efficient Comparison of Program Slices
Automata-based verification of programs with tree updates
Approximate counting in SMT and value estimation for probabilistic programs
Nested antichains for WS1S
Sets with Small Generalized Kolmogorov Complexity
On the Interdependence Between Shuffle and Crossing-Over Operations
Running a job on a collection of partly available machines, with on-line restarts
Monte Carlo Circuits for the Abelian Permutation Group Intersection Problem
Analysis of Space Allocation in a Generally Fragmented Linear Store
An Analysis of two Related Loop-free Algorithms for Generating Integer Partitions
A decision procedure for string constraints with string/integer conversion and flat regular constraints
Invariants, Composition, and Substitution
A Survey of Stream Processing
Performance and Reliability Improvement by Using Asynchronous Algorithms in Disk Buffer Cache Memory
Optimization of a Subclass of Conjunctive Queries
Red-black trees with constant update time
On reversible Turing machines and their function universality
Demonic, angelic and unbounded probabilistic choices in sequential programs
Maintaining mobile transactional consistency in hybrid broadcast environments
"Backward" coinduction, Nash equilibrium and the rationality of escalation
A Comparison of Two Synchronizing Concepts
Unavoidable Binary Patterns
DNA Computing, Sticker Systems, and Universality
Exact distributed quantum algorithm for generalized Simon's problem
Instruction sequence processing operators
Two-dimensional packing with conflicts
Affine Relationships Among Variables of a Program
A queue based mutual exclusion algorithm
On the System of word equations x^i_1 x^i_2 ... x^i_m = y^i_1 y^i_2 ...y^i_n (i=1, 2, ...) in a Free Monoid
Composition and Evaluation of Attribute Coupled Grammars
Management of interval probabilistic data
Two-Symbol DOS Systems Generating Regular Languages
Context-Free Graph Grammars and Concatenation of Graphs
Generalized straight-line programs
Element distinctness on one-tape Turing machines: a complete solution
Optimal Worst Case Trees
A Characterization of Attribute Evaluation in Passes
Visualization of bipartite graphs in limited window size
Memory Fragmentation in Buddy Methods for Dynamic Storage Allocation
Automatic Correction of Syntax-Errors in Programming Languages
On the Complexity of Formal Grammars
Words, univalent factors, and boxes
A Sound and Relatively * Complete Hoare-Logic for a Language With Higher Type Procedures
Recursive descent parsing for Boolean grammars
Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm
Deterministic real-time tree-walking-storage automata
Hierarchical Ordering of Sequential Processes
Throughput analysis in wireless networks with multiple users and multiple channels
Descriptively Complete Process Logic
Category-Based Modularisation for Equational Logic Programming
Special issue: Synthesis and SYNT 2014
The Extendes Equivalence Problem for a Class of Non-Real-Time Deterministic Pushdowen Automata
Analyse et optimisation d'une procédure de reprise dans un système de gestion de données centralisées
Testing Attribute Grammars for Circularity
Exploiting colored Petri nets to decide on permutation admissibility
A Priority Queue With Interruptions of Service Permitted After a Time Quantum
Electing a Leader in a Ring with Link Failures
Hierarchies of Complete Problems
A Balanced Search Tree with O (1) Worst-case Update Time
Improving Time and Space Efficiency in Generalized Binary Search Trees
Reasoning with First Order Nondeterministic Specifications
Splitting forward simulations to copewith liveness
A Discrete-Time Round-Robin Queue with Bernoulli Input and General Arithmetic Service Time Distributions
The Expected Behaviour of B+-Trees
Parallel Approximation Schemes for Subset Sum and Knapsack Problems
Maximum Entropy Two-Station Cyclic Queues with Multiple General Servers
Relational Database Constraints as Counterexamples
On Time Computability of Functions in One-Way Cellular Automata
Reasoning about faulty quantum programs
Single Machine Flow-Time Scheduling With a Single Breakdown
A distributed resource allocation algorithm for many processes
Critical Comments on the Programming Language Pascal
On weighted first-order logics with discounting
Formal Derivation of Strongly Correct Concurrent Programs
Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds
Computational Algorithms for Networks of Queues with Rejection Blocking
EOL Systems with Control Devices
An Experience in Proving Regular Networks of Processes by Modular Model Checking
On Hierarchies of Abstract Data Types
A Gap Between the Actual Complexity of Permutations and Their Entropy Defined by Stoß
Symmetric Binary B-Trees: Data Structure and Maintenance Algorithms
A functional approach for temporal × modal logics
Die Zeitkomplexität des Normalisierungsproblems bei kontextsensitiven Grammatiken
Representing the integers with powers of 2 and 3
Testing Bag-Containment of Conjunctive Queries
On an Exponential Server with General Cyclic Arrivals
NP -Hard Problems in Hierarchical-Tree Clustering
Measuring the constrained reachability in quantum Markov chains
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
Contextual Rewriting as a Sound and Complete Proof Method for Conditional LOG-Specifications
Multi-Queue Scheduling of Two Tasks
General Purpose Schedulers for Database Systems
Query optimization in information integration