The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
From SOS rules to proof principles: an operational metatheory for functional languages
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundational aspects of syntax
ACM Computing Surveys (CSUR)
Register-machine based processes
Journal of the ACM (JACM)
From rewrite rules to bisimulation congruences
Theoretical Computer Science
Compositional SOS and beyond: a coalgebraic view of open systems
Theoretical Computer Science
Dynamic connectors for concurrency
Theoretical Computer Science
Ordered SOS process languages for branching and Eager bisimulation
Information and Computation
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
Observational Equivalence for Synchronized Graph Rewriting with Mobility
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Modular Specification of Concurrent Systems with Observational Logic
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Comparison of Process Algebra Equivalences Using Formats
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Congruent Weak Conformance, a Partial Order among Processes
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
2-Nested Simulation Is Not Finitely Equationally Axiomatizable
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Verifying Performance Equivalence for Timed Basic Parallel Processes
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
Open Ended Systems, Dynamic Bisimulation and Tile Logic
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Concurrent Constraint Programming with Process Mobility
CL '00 Proceedings of the First International Conference on Computational Logic
Tile Transition Systems as Structured Coalgebras
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Precongruence Formats for Decorated Trace Preorders
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Precongruence formats for decorated trace semantics
ACM Transactions on Computational Logic (TOCL)
A format for semantic equivalence comparison
Theoretical Computer Science
On the bisimulation proof method
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Nested semantics over finite trees are equationally hard
Information and Computation
Behavioral abstraction is hiding information
Theoretical Computer Science - Selected papers of CMCS'03
Observational congruences for dynamically reconfigurable tile systems
Theoretical Computer Science - Process algebra
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
SOS for higher order processes
CONCUR 2005 - Concurrency Theory
A theory of stochastic systems: part II: process algebra
Information and Computation
Compositionality of Hennessy-Milner logic by structural operational semantics
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
On Well-Foundedness and Expressiveness of Promoted Tyft
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational semantics for Petri net components
Theoretical Computer Science
A Congruence Rule Format with Universal Quantification
Electronic Notes in Theoretical Computer Science (ENTCS)
Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Weak parametric failure equivalences and their congruence formats
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Correcting a Space-Efficient Simulation Algorithm
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Probabilistic bisimulation as a congruence
ACM Transactions on Computational Logic (TOCL)
Generating priority rewrite systems for OSOS process languages
Information and Computation
Semantics and expressiveness of ordered SOS
Information and Computation
Structural Operational Semantics with First-Order Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Congruence of Bisimulation in a Non-Deterministic Call-By-Need Lambda Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Prototyping SOS Meta-theory in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
A Congruence Format for Name-passing Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Divide and Congruence Applied to η-Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
A theory of Stochastic systems. Part II: Process algebra
Information and Computation
A syntactic commutativity format for SOS
Information Processing Letters
Theoretical Computer Science
On the axiomatizability of ready traces, ready simulation, and failure traces
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Ready to preorder: get your BCCSP axiomatization for free!
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
What semantic equivalences are suitable for non-interference properties in computer security
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Non-strongly stable orders also define interesting simulation relations
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Similarity quotients as final coalgebras
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Transforming SOS specifications to linear processes
FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
Beyond bisimulation: the "up-to" techniques
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Divide and congruence: from decomposition of modalities to preservation of branching bisimulation
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Nested nets for adaptive systems
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Representing and reasoning with operational semantics
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Congruence for structural congruences
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Probabilistic congruence for semistochastic generative processes
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Information and Computation
Incremental pattern-based coinduction for process algebra and its isabelle formalization
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Towards bialgebraic semantics for the linear time --- branching time spectrum
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Rule formats for determinism and idempotence
Science of Computer Programming
Probabilistic transition system specification: congruence and full abstraction of bisimulation
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Parameterized Structured Operational Semantics
Fundamenta Informaticae
A COMPLETE AXIOMATIZATION FOR PREFIX ITERATION IN BRANCHING BISIMULATION
Fundamenta Informaticae
Modular bisimulation theory for computations and values
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Modular semantics for transition system specifications with negative premises
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.01 |