The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Process algebra and Markov chains
Lectures on formal methods and performance analysis
The theory of interactive generalized semi-Markov processes
Theoretical Computer Science
Ordered SOS process languages for branching and Eager bisimulation
Information and Computation
Discrete time generative-reactive probabilistic processes with different advancing speeds
Theoretical Computer Science
A comparison of Statecharts step semantics
Theoretical Computer Science
On the Expressiveness of Event Notification in Data-Driven Coordination Languages
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Modular Specification of Concurrent Systems with Observational Logic
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Refusal Simulation and Interactive Games
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Process Calculi for Coordination: From Linda to JavaSpaces
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Comparison of Process Algebra Equivalences Using Formats
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Process Languages for Rooted Eager Bisimulation
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
PEPA Nets: A Structured Performance Modelling Formalism
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Stochastic Process Algebras Meet Eden
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
A denotational semantics for Timed Linda
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Precongruence Formats for Decorated Trace Preorders
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Bisimulation and language equivalence
Logic for concurrency and synchronisation
Precongruence formats for decorated trace semantics
ACM Transactions on Computational Logic (TOCL)
A format for semantic equivalence comparison
Theoretical Computer Science
A simple framework for real-time cryptographic protocol analysis with compositional proof rules
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Concurrent models for Linda with transactions
Mathematical Structures in Computer Science
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
SOS for higher order processes
CONCUR 2005 - Concurrency Theory
Formal specification of multi-agent e-barter systems
Science of Computer Programming
Compositionality of Hennessy-Milner logic by structural operational semantics
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
A deterministic logical semantics for pure Esterel
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Timed Linda Language and its Denotational Semantics
Fundamenta Informaticae
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
A Congruence Rule Format with Universal Quantification
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
Probabilistic bisimulation as a congruence
ACM Transactions on Computational Logic (TOCL)
Semantics and expressiveness of ordered SOS
Information and Computation
Fundamenta Informaticae - Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (I)
Structural Operational Semantics with First-Order Logic
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)
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 syntactic commutativity format for SOS
Information Processing Letters
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
A simple language for real-time cryptographic protocol analysis
ESOP'03 Proceedings of the 12th European conference on Programming
Branching vs. linear time: semantical perspective
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
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
Structural Analysis of Boolean Equation Systems
ACM Transactions on Computational Logic (TOCL)
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
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Orthogonal extensions in structural operational semantics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Rule formats for determinism and idempotence
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Congruence for structural congruences
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Timing the untimed: terminating successfully while being conservative
Processes, Terms and Cycles
Information and Computation
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
Fundamenta Informaticae - Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (I)
Behavioural equivalences over migrating processes with timers
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
A Timed Linda Language and its Denotational Semantics
Fundamenta Informaticae
Modular semantics for transition system specifications with negative premises
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 5.23 |