Look ma, no hashing, and no arrays neither
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient gateway synthesis from formal specifications
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Online minimization of transition systems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A toolbox for the verification of LOTOS programs
ICSE '92 Proceedings of the 14th international conference on Software engineering
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A polynomial algorithm for gateway generation from formal specifications
IEEE/ACM Transactions on Networking (TON)
An incremental approach to structural testing of concurrent software
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
An Efficient Algorithm for Minimizing Real-Time Transition Systems
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
High level reading and data structure compilation
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Parallel Algorithms for Relational Coarsest Partition Problems
IEEE Transactions on Parallel and Distributed Systems
Checking safety properties using compositional reachability analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
Journal of Experimental Algorithmics (JEA)
Static checking of system behaviors using derived component assumptions
ACM Transactions on Software Engineering and Methodology (TOSEM)
Sets and constraint logic programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficiency by Incrementalization: An Introduction
Higher-Order and Symbolic Computation
Analysis of Timed Systems Using Time-Abstracting Bisimulations
Formal Methods in System Design
Forced simulation: A technique for automating component reuse in embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Covering indexes for branching path queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Statistical synopses for graph-structured XML databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
ACM Transactions on Computational Logic (TOCL)
Operational and abstract semantics of the query language G-Log
Theoretical Computer Science
Behaviour Analysis of Distributed Systems Using the Tracta Approach
Automated Software Engineering
Reduction of Timed Hybrid Systems
Discrete Event Dynamic Systems
Bisimulation, the Supervisory Control Problem and StrongModel Matching for Finite State Machines
Discrete Event Dynamic Systems
Bisimulation Minimization and Symbolic Model Checking
Formal Methods in System Design
Making Changes to Formal Specifications: Requirements and an Example
IEEE Transactions on Software Engineering
Canonical derivatives, partial derivatives and finite automaton constructions
Theoretical Computer Science
Integrating TwoTowers and GreatSPN through a compact net semantics
Performance Evaluation - Unified specification and performance evaluation using stochastic process algebras
Proving Deadlock Freedom in Component-Based Programming
FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
Index Structures for Path Expressions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming
Proceedings of the 17th International Conference on Logic Programming
State Space Reduction Using Partial tau-Confluence
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Deriving Symbolic Representations from Stochastic Process Algebras
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Abstraction in Software Model Checking: Principles and Practice (Tutorial Overview and Bibliography)
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Data Structures for Maintaining Set Partitions
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Modular State Level Analysis of Distributed Systems Techniques and Tool Support
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
On the Benefits of Using the Up-To Techniques for Bisimulation Verification
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Finite State Verification for the Asynchronous pi-Calculus
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Simulation as Coarsest Partition Problem
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Hereditary History Preserving Bisimilarity Is Undecidable
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
An Abstract Schema for Equivalence-Checking Games
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Proofs Methods for Bisimulation Based Information Flow Security
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Bisimulation and Unwinding for Verifying Possibilistic Security Properties
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Designing the Minimal Structure of Hidden Markov Model by Bisimulation
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
``Next'' Heuristic for On-the-Fly Model Checking
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Techniques for Decidability and Undecidability of Bisimilarity
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Weak Bisimulation for Probabilistic Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Decision Algorithms for Probabilistic Bisimulation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Compositional Reasoning in Model Checking
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Bisimulation and Model Checking
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Norm Functions for Probabilistic Bisimulations with Delays
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
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
P-Hardness of Equivalence Testing on Finite-State Processes
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
New Finite Automaton Constructions Based on Canonical Derivatives
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
On the Complexity of Bisimulation Problems for Pushdown Automata
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Model Checking with Formula-Dependent Abstract Models
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Computing the Equation Automaton of a Regular Expression in Space and Time
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
A Logical Viewpoint on Process-Algebraic Quotients
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Compositional Performance Modelling with TIPPtool
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Partially-Ordered Knapsack and Applications to Scheduling
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Model-Checking Based Data Retrieval
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
On the Complexity of Bisimulation Problems for Basic Parallel Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
UnQL: a query language and algebra for semistructured data based on structural recursion
The VLDB Journal — The International Journal on Very Large Data Bases
On the computational complexity of bisimulation, redux
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Handbook of automated reasoning
Information Flow Security in Dynamic Contexts
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Information Processing Letters
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
D(k)-index: an adaptive structural summary for graph-structured data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Weak bisimulation for (max/+) automata and related models
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Undecidability of domino games and hhp-bisimilarity
Information and Computation
From a simple elimination ordering to a strong elimination ordering in linear time
Information Processing Letters
Optimal state-space lumping in Markov chains
Information Processing Letters
From Bisimulation to Simulation: Coarsest Partition Problems
Journal of Automated Reasoning
Probabilistic weak simulation is decidable in polynomial time
Information Processing Letters
Multiresolution Indexing of XML for Frequent Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
An efficient algorithm for computing bisimulation equivalence
Theoretical Computer Science
Security check: a formal yet practical framework for secure software architecture
Proceedings of the 2003 workshop on New security paradigms
Incremental maintenance of XML structural indexes
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
An algorithmic view of gene teams
Theoretical Computer Science
Imperative program optimization by partial evaluation
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Ackermann encoding, bisimulations and OBDDs
Theory and Practice of Logic Programming
Twig query processing over graph-structured XML data
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Efficient Verification of Sequential and Concurrent C Programs
Formal Methods in System Design
Model-Based Evaluation: From Dependability to Security
IEEE Transactions on Dependable and Secure Computing
Towards the hierarchical verification of reactive systems
Theoretical Computer Science - Logic, semantics and theory of programming
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Data structures for maintaining set partitions
Random Structures & Algorithms
A simple linear time algorithm for cograph recognition
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Linear-time modular decomposition of directed graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Higher-order rank analysis for web structure
Proceedings of the sixteenth ACM conference on Hypertext and hypermedia
Stepwise Development of Process-Algebraic Specifications in Decorated Trace Semantics
Formal Methods in System Design
Checking Timed Büchi Automata Emptiness Efficiently
Formal Methods in System Design
Incrementalization across object abstraction
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Construction of Aho Corasick automaton in linear time for integer alphabets
Information Processing Letters
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Fast algorithms for identifying maximal common connected sets of interval graphs
Discrete Applied Mathematics
XSKETCH synopses for XML data graphs
ACM Transactions on Database Systems (TODS)
SYNERGY: a new algorithm for property checking
Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering
Coalgebraic minimization of HD-automata for the π-calculus using polymorphic types
Theoretical Computer Science - Formal methods for components and objects
Experiments with deterministic ω-automata for formulas of linear temporal logic
Theoretical Computer Science - Implementation and application of automata
Algorithmic Verification of Noninterference Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
What You Lose is What You Leak: Information Leakage in Declassification Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Partially ordered knapsack and applications to scheduling
Discrete Applied Mathematics
Information flow security in dynamic contexts
Journal of Computer Security
Discrete Applied Mathematics
Priority and abstraction in process algebra
Information and Computation
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Structure and value synopses for XML data graphs
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Covering indexes for XML queries: bisimulation - simulation = negation
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Pattern detection from web using AFA set theory
Proceedings of the 9th annual ACM international workshop on Web information and data management
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Enabling structural summaries for efficient update and workload adaptation
Data & Knowledge Engineering
Bisimulation relations for weighted automata
Theoretical Computer Science
Generalizing the Paige--Tarjan algorithm by abstract interpretation
Information and Computation
Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Incremental verification methodology for DEVS models
ISPRA'05 Proceedings of the 4th WSEAS International Conference on Signal Processing, Robotics and Automation
Fast equation automaton computation
Journal of Discrete Algorithms
Generic discrimination: sorting and paritioning unshared data in linear time
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Probe Matrix Problems: Totally Balanced Matrices
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Program Repair Suggestions from Graphical State-Transition Specifications
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
History Dependent Automata for Service Compatibility
Concurrency, Graphs and Models
The Tractability Frontier for NFA Minimization
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Composed Bisimulation for Tree Automata
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
A Space-Efficient Probabilistic Simulation Algorithm
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
On the Minimisation of Acyclic Models
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Towards State Space Reduction Based on T-Lumpability-Consistent Relations
EPEW '08 Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering
Exploiting shared correlations in probabilistic databases
Proceedings of the VLDB Endowment
Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
State Space Reduction Techniques for Component Interfaces
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Applying model-checking to solve queries on semistructured data
Computer Languages, Systems and Structures
Approximated Reachability on Hybrid Automata: Falsification meets Certification
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantifying Timing Leaks and Cost Optimisation
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
Engineering Radix Sort for Strings
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Modelling and Verifying Mobile Systems Using π -Graphs
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
(Bi)simulations up-to characterise process semantics
Information and Computation
Signed and minus clique-transversal functions on graphs
Information Processing Letters
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Minimization Algorithm for Symbolic Bisimilarity
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Phylogenetic graph models beyond trees
Discrete Applied Mathematics
Algorithmic aspects of a general modular decomposition theory
Discrete Applied Mathematics
A bisimulation-based approach to the analysis of human-computer interaction
Proceedings of the 1st ACM SIGCHI symposium on Engineering interactive computing systems
Bisimilarity Minimization in O(m logn) Time
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
On determinism in modal transition systems
Theoretical Computer Science
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
On the complexity of signed and minus total domination in graphs
Information Processing Letters
Optimizing Pointer Analysis Using Bisimilarity
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Backward and forward bisimulation minimization of tree automata
Theoretical Computer Science
The Future of Formal Methods and GALS Design
Electronic Notes in Theoretical Computer Science (ENTCS)
Model minimization, regression, and propositional STRIPS planning
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
An efficient simulation algorithm based on abstract interpretation
Information and Computation
A linear-time algorithm for paired-domination problem in strongly chordal graphs
Information Processing Letters
From partially to fully lumped Markov chains in stochastic well formed Petri nets
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
A simple linear time algorithm for cograph recognition
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Linear-time modular decomposition of directed graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Discrete Applied Mathematics
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time
Electronic Notes in Theoretical Computer Science (ENTCS)
Checking Integrity via CoPS and Banana: the E-Commerce Case Study
Electronic Notes in Theoretical Computer Science (ENTCS)
Analysis of Real-Time Systems with CTL Model Checkers
Electronic Notes in Theoretical Computer Science (ENTCS)
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Filling Out the Gaps: A Padding Algorithm for Transforming Out Timing Leaks
Electronic Notes in Theoretical Computer Science (ENTCS)
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Referring expressions as formulas of description logic
INLG '08 Proceedings of the Fifth International Natural Language Generation Conference
On the computational complexity of bisimulation, redux
Information and Computation
Construction of Aho Corasick automaton in linear time for integer alphabets
Information Processing Letters
Finding the set of all hinge vertices for strongly chordal graphs in linear time
Information Sciences: an International Journal
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
Discrete Applied Mathematics
A proof system for information flow security
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
State class constructions for branching analysis of time Petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
A survey of Markovian behavioral equivalences
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
SAM: an efficient algorithm for F&B-index construction
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Bisimulation minimisation for weighted tree automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Reducing acyclic cover transducers
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Backward and forward bisimulation minimisation of tree automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
An implementation of deterministic tree automata minimization
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Recognizing bipartite tolerance graphs in linear time
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Unifying two graph decompositions with modular decomposition
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
An incremental bisimulation algorithm
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Deriving bisimulations by simplifying partitions
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Automatic synthesis of computation interference constraints for relative timing verification
ICCD'09 Proceedings of the 2009 IEEE international conference on Computer design
Computing simulations over tree automata: efficient techniques for reducing tree automata
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Exploring XML web collections with DescribeX
ACM Transactions on the Web (TWEB)
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
Action Prefixes: Reified Synchronization Paths in Minimal Component Interaction Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Path-hop: efficiently indexing large graphs for reachability queries
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Weak bisimulation for Probabilistic Timed Automata
Theoretical Computer Science
Proceedings of the 1st International Conference on Intelligent Semantic Web-Services and Applications
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Bisimilarity of one-counter processes is PSPACE-complete
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Lumping partially symmetrical stochastic models
Performance Evaluation
Connection between logical and algebraic approaches to concurrent systems†
Mathematical Structures in Computer Science
A good characterization of squares of strongly chordal split graphs
Information Processing Letters
Synoptic: summarizing system logs with refinement
SLAML'10 Proceedings of the 2010 workshop on Managing systems via log analysis and machine learning techniques
Relative expressive power of navigational querying on graphs
Proceedings of the 14th International Conference on Database Theory
On the Complexity of Finding a Sun in a Graph
SIAM Journal on Discrete Mathematics
Bisimulation minimisations for boolean equation systems
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
The algorithmic complexity of mixed domination in graphs
Theoretical Computer Science
Clone detection through process algebras and Java bytecode
Proceedings of the 5th International Workshop on Software Clones
Querying contract databases based on temporal behavior
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Optimizing incremental maintenance of minimal bisimulation of cyclic graphs
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Computing the maximum bisimulation with spiking neural P systems
Computation, cooperation, and life
Using bisimulations for optimality problems in model refinement
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Leveraging existing instrumentation to automatically infer invariant-constrained models
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
Using logic in the generation of referring expressions
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Probabilistic bisimulation and simulation algorithms by abstract interpretation
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Strongly chordal and chordal bipartite graphs are sandwich monotone
Journal of Combinatorial Optimization
Better algorithms for analyzing and enacting declarative workflow languages using LTL
BPM'11 Proceedings of the 9th international conference on Business process management
A fully symbolic bisimulation algorithm
RP'11 Proceedings of the 5th international conference on Reachability problems
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
A succinct canonical register automaton model
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Learning system abstractions for human operators
Proceedings of the International Workshop on Machine Learning Technologies in Software Engineering
SemSearchPro - Using semantics throughout the search process
Web Semantics: Science, Services and Agents on the World Wide Web
The tractability frontier for NFA minimization
Journal of Computer and System Sciences
Simulation for interactive markov chains
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
Homogeneity vs. adjacency: generalising some graph decomposition algorithms
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
An abstract interpretation perspective on linear vs. branching time
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Fast brief practical DFA minimization
Information Processing Letters
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
Discrete Applied Mathematics
Visibly pushdown automata: from language equivalence to simulation and bisimulation
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Bisimulation minimization of tree automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Construction of aho corasick automaton in linear time for integer alphabets
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Reducing the size of NFAs by using equivalences and preorders
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Modelling declassification policies using abstract domain completeness
Mathematical Structures in Computer Science - Programming Language Interference and Dependence
An abstract interpretation-based refinement algorithm for strong preservation
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Model checking for nominal calculi
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
ExpLOD: summary-based exploration of interlinking and RDF usage in the linked open data cloud
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
Combining tree structure indexes with structural indexes in query evaluation on XML data
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
On the complexity of hopcroft’s state minimization algorithm
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Arboricity, h-index, and dynamic algorithms
Theoretical Computer Science
Timing-sensitive information flow analysis for synchronous systems
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Efficient processing SAPE queries using the dynamic labelling structural indexes
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Sigref: a symbolic bisimulation tool box
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Simple O(m log n) time Markov chain lumping
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Minimization of non-deterministic automata with large alphabets
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Experiments with deterministic ω-automata for formulas of linear temporal logic
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Very fast instances for concept generation
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Query preserving graph compression
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Efficient external-memory bisimulation on DAGs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Algorithms for some h-join decompositions
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Belief bisimulation for hidden markov models: logical characterisation and decision algorithm
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Verifying persistent security properties
Computer Languages, Systems and Structures
Survey: A survey of the algorithmic aspects of modular decomposition
Computer Science Review
Formal Methods in System Design
Reduction Techniques for Acyclic Cover Transducers
Fundamenta Informaticae
On decidability of prebisimulation for timed automata
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Weak markovian bisimulation congruences and exact CTMC-Level aggregations for sequential processes
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
On a Connection Between Cooperating Distributed Grammar Systems and Basic Process Algebra
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
EXPTIME-completeness of thorough refinement on modal transition systems
Information and Computation
Partition refinement of Component Interaction Automata
Science of Computer Programming
Complexity of distance paired-domination problem in graphs
Theoretical Computer Science
Deadlock-freedom in component systems with architectural constraints
Formal Methods in System Design
Equivalence checking for infinite systems using parameterized Boolean equation systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Fast answering of XPath query workloads on web collections
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
Rough set analysis of relational structures
Information Sciences: an International Journal
Feedback vertex set on graphs of low clique-width
European Journal of Combinatorics
A succinct canonical register automaton model for data domains with binary relations
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Two observations in dioid based model refinement
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
The quest for minimal quotients for probabilistic automata
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Rainbow domination and related problems on strongly chordal graphs
Discrete Applied Mathematics
Efficiently anonymizing social networks with reachability preservation
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
External memory K-bisimulation reduction of big graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Efficient computation of program equivalence for confluent concurrent constraint programming
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Efficiency and precision trade-offs in graph summary algorithms
Proceedings of the 17th International Database Engineering & Applications Symposium
Bisimulation reduction of big graphs on mapreduce
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
Effective verification of confidentiality for multi-threaded programs
Journal of Computer Security - Foundational Aspects of Security
Hi-index | 0.02 |