Realization of Events by Logical Nets
Journal of the ACM (JACM)
Design of Sequential Machines from Their Regular Expressions
Journal of the ACM (JACM)
Towards dataflow analysis of communicating finite state machines
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Data flow analysis of communicating finite state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Interprocedural may-alias analysis for pointers: beyond k-limiting
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
On the use of regular expressions for searching text
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic synthesis of interfaces between incompatible protocols
DAC '98 Proceedings of the 35th annual Design Automation Conference
A collection of software tools for analyzing designs of concurrent software systems
ICSE '85 Proceedings of the 8th international conference on Software engineering
Ultimate-Definite and Symmetric-Definite Events and Automata
Journal of the ACM (JACM)
Two Complete Axiom Systems for the Algebra of Regular Events
Journal of the ACM (JACM)
A Procedure for Checking Equality of Regular Expressions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On Decompositions of Regular Events
Journal of the ACM (JACM)
Synchronizations and General Repetitive Machines, with Applications to Ultimate Definite Automata
Journal of the ACM (JACM)
A Study of Schedules as Models of Synchronous Parallel Computation
Journal of the ACM (JACM)
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Communications of the ACM
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Normal form algorithms for extended context-free grammars
Theoretical Computer Science
Pattern-matching and rewriting rules for group indexed data structures
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Pattern-matching and rewriting rules for group indexed data structures
ACM SIGPLAN Notices
Canonical derivatives, partial derivatives and finite automaton constructions
Theoretical Computer Science
Algorithms for Computing Small NFAs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Derivation of Rational Expressions with Multiplicity
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Well-Abstracted Transition Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
An Algebraic Foundation for Adaptive Programming
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
New Finite Automaton Constructions Based on Canonical Derivatives
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Brzozowski's Derivatives Extended to Multiplicities
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Compiling Adaptive Programs by Partial Evaluation
CC '00 Proceedings of the 9th International Conference on Compiler Construction
Learning Regular Languages Using RFSA
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Computing the Equation Automaton of a Regular Expression in Space and Time
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Constructing NFA s by Optimal Use of Positions in Regular Expressions
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Tutorial: Compiling concurrent languages for sequential processors
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Well-abstracted transition systems: application to FIFO automata
Information and Computation
A Logic for Reasoning about Digital Rights
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Construction with parallel derivatives of the closure of a parallel program schema
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Uniform modular realization of sequential machines
ACM '68 Proceedings of the 1968 23rd ACM national conference
Reducing NFAs by invariant equivalences
Theoretical Computer Science
Information and Computation
Incremental execution of transformation specifications
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
Learning regular languages using RFSAs
Theoretical Computer Science - Special issue: Algorithmic learning theory
Derivatives of rational expressions and related theorems
Theoretical Computer Science - Implementation and application automata
Reducing memory requirements in reachability-based finite automata operations
Software—Practice & Experience
Minimization of unary symmetric difference NFAs
SAICSIT '04 Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
A coalgebraic approach to Kleene algebra with tests
Theoretical Computer Science - Selected papers of CMCS'03
A coinductive calculus of streams
Mathematical Structures in Computer Science
Interfaces for stack inspection
Journal of Functional Programming
Regular expression types for XML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Boolean operations and inclusion test for attribute-element constraints
Theoretical Computer Science
EDUCATIONAL PEARL: ‘Proof-directed debugging’ revisited for a first-order version
Journal of Functional Programming
Derivatives of rational expressions with multiplicity
Theoretical Computer Science
From Mirkin's Prebases to Antimirov's Word Partial Derivatives
Fundamenta Informaticae
One-unambiguity of regular expressions with numeric occurrence indicators
Information and Computation
On preventing intrusions by process behavior monitoring
ID'99 Proceedings of the 1st conference on Workshop on Intrusion Detection and Network Monitoring - Volume 1
General Repetitive Events and Machines
IEEE Transactions on Computers
Sequential Circuit Output Probabilities From Regular Expressions
IEEE Transactions on Computers
Generation of Right-Linear Grammars from Regular Expressions
IEEE Transactions on Computers
IEEE Transactions on Computers
On the State Minimization of Nondeterministic Finite Automata
IEEE Transactions on Computers
Clowns to the left of me, jokers to the right (pearl): dissecting data structures
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Boomerang: resourceful lenses for string data
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
EventScript: an event-processing language based on regular expressions with actions
Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems
Concurrency, Graphs and Models
Antimirov and Mosses's Rewrite System Revisited
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Inclusion Test Algorithms for One-Unambiguous Regular Expressions
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Provably Shorter Regular Expressions from Deterministic Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Construction of Tree Automata from Regular Expressions
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Linear time membership in a class of regular expressions with interleaving and counting
Proceedings of the 17th ACM conference on Information and knowledge management
Adapting functional programs to higher order logic
Higher-Order and Symbolic Computation
Computation Tree Regular Logic for Genetic Regulatory Networks
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Microtext: the design of a microprogrammed finite state search machine for full-text retrieval
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Regular-expression derivatives re-examined
Journal of Functional Programming
The impact of requirements changes on specifications and state machines
Software—Practice & Experience
A Kleene Theorem for Polynomial Coalgebras
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
State-complexity hierarchies of uniform languages of alphabet-size length
Theoretical Computer Science
Language operations with regular expressions of polynomial size
Theoretical Computer Science
Hedge Pattern Partial Derivative
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Deriving Syntax and Axioms for Quantitative Regular Behaviours
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Journal of Artificial Intelligence Research
Automated Analysis of Reo Circuits using Symbolic Execution
Electronic Notes in Theoretical Computer Science (ENTCS)
An axiom system for sequence-based specification
Theoretical Computer Science
On Equivalences for a Class of Timed Regular Expressions
Electronic Notes in Theoretical Computer Science (ENTCS)
Simulation of Simultaneous Events in Regular Expressions for Run-Time Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Regularity Results for FIFO Channels
Electronic Notes in Theoretical Computer Science (ENTCS)
A specification of parallel problems
Information Processing Letters
Journal of Computer and System Sciences
Closures which preserve finiteness in families of languages
Journal of Computer and System Sciences
Star height of certain families of regular events
Journal of Computer and System Sciences
General properties of star height of regular events
Journal of Computer and System Sciences
Properties of code events and homomorphisms over regular events
Journal of Computer and System Sciences
Efficient transformations from regular expressions to finite automata
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Boolean operations for attribute-element constraints
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Instrumentation of open-source software for intrusion detection
RV'07 Proceedings of the 7th international conference on Runtime verification
Solving linear equations in *-continuous action lattices
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
A Propositional Dynamic Logic for Concurrent Programs Based on the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of the ACM (JACM)
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Processing SPARQL queries with regular expressions in RDF databases
DTMBIO '10 Proceedings of the ACM fourth international workshop on Data and text mining in biomedical informatics
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On the average number of states of partial derivative automata
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Regular expression containment: coinductive axiomatization and computational interpretation
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reasoning about protocol change and knowledge
ICLA'11 Proceedings of the 4th Indian conference on Logic and its applications
Quantitative Kleene coalgebras
Information and Computation
Partial derivative automata formalized in Coq
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Partially ordered two-way büchi automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Theoretical Computer Science
Logic of information flow on communication channels
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Omega algebras and regular equations
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
On probabilistic kleene algebras, automata and simulations
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
From grammars and automata to algebras and coalgebras
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Partial derivatives of an extended regular expression
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
The average transition complexity of Glushkov and partial derivative automata
DLT'11 Proceedings of the 15th international conference on Developments in language theory
A formalisation of the Myhill-Nerode theorem based on regular expressions (proof pearl)
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Temporal higher-order contracts
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Parsing with derivatives: a functional pearl
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Realization of Coinductive Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic and parametric model checking of discrete-time markov chains
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
A finite union of DFAs in symbolic model checking of infinite systems
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Overlap-Free regular languages
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Quotient complexity of ideal languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Using proofs by coinduction to find “traditional” proofs
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
FIRE station: an environment for manipulating finite automata and regular expression views
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Combining regular expressions with (near-)optimal brzozowski automata
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Quotient complexity of closed languages
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Complexity in convex languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
The inclusion problem for regular expressions
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Verification of communication protocols using abstract interpretation of FIFO queues
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
The refinement of choreographed multi-agent systems
DALT'09 Proceedings of the 7th international conference on Declarative Agent Languages and Technologies
A decision procedure for regular expression equivalence in type theory
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Derivatives of regular expressions and an application
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Symbolic execution of Reo circuits using constraint automata
Science of Computer Programming
Construction of fuzzy automata from fuzzy regular expressions
Fuzzy Sets and Systems
Proton: multitouch gestures as regular expressions
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Approximate regular expressions and their derivatives
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Inference for transition network grammars
Computer Languages
An approach to software system modelling and analysis
Computer Languages
RockSalt: better, faster, stronger SFI for the x86
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
The validation of SGML content models
Mathematical and Computer Modelling: An International Journal
Test generation for interworking systems
Computer Communications
Proof Pearl: Regular Expression Equivalence and Relation Algebra
Journal of Automated Reasoning
On Deadlock and Fairness Decision Problems for Computations on Client-server Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Descriptional complexity of biautomata
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Iterating invertible binary transducers
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Functional programming with structured graphs
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Constructive finite trace analysis with linear temporal logic
TAP'12 Proceedings of the 6th international conference on Tests and Proofs
Regular expression sub-matching using partial derivatives
Proceedings of the 14th symposium on Principles and practice of declarative programming
From Mirkin's Prebases to Antimirov's Word Partial Derivatives
Fundamenta Informaticae
The inclusion problem for regular expressions
Journal of Computer and System Sciences
Detecting conflicts among declarative UI extensions
Proceedings of the 8th symposium on Dynamic languages
An Improved Construction of Deterministic Omega-automaton Using Derivatives
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Deciding regular expressions (in-)equivalence in coq
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Quotient complexity of ideal languages
Theoretical Computer Science
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principled parsing for indentation-sensitive languages: revisiting landin's offside rule
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
Verified decision procedures for MSO on words based on derivatives of regular expressions
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Efficient dynamic access analysis using JavaScript proxies
Proceedings of the 9th symposium on Dynamic languages
FASER Formal and Automatic Security Enforcement by Rewriting by BPA algebra with test
International Journal of Grid and Utility Computing
Kleene algebra with tests and coq tools for while programs
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Varieties and Covarieties of Languages (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Hidden protocols: Modifying our expectations in an evolving world
Artificial Intelligence
Quotient Complexity of Closed Languages
Theory of Computing Systems
Verification and enforcement of access control policies
Formal Methods in System Design
Applying string-rewriting to sequence-based specification
Formal Methods in System Design
A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions
Journal of Automated Reasoning
A Goal-Directed Decision Procedure for Hybrid PDL
Journal of Automated Reasoning
| Hi-index | 0.08 |