How to share concurrent wait-free variables
Journal of the ACM (JACM)
I/O automata based verification of finite state distributed systems: complexity issues
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Eventually-serializable data services
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Specifying and using a partitionable group communication service
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394
Formal Methods in System Design
Using TAME to prove invariants of automata models: Two case studies
FMSP '00 Proceedings of the third workshop on Formal methods in software practice
A formal approach to component based development of synchronous programs
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Specifying and using a partitionable group communication service
ACM Transactions on Computer Systems (TOCS)
Foundations of the Trace Assertion Method of Module Interface Specification
IEEE Transactions on Software Engineering
Synthesis of concurrent programs for an atomic read/write model of computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Forced simulation: A technique for automating component reuse in embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Representation independence, confinement and access control [extended abstract]
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Branching time controllers for discrete event systems
Theoretical Computer Science
Formal specification and verification of safety and performance of TCP selective acknowledgment
IEEE/ACM Transactions on Networking (TON)
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
A Timed Verification of the IEEE 1394 Leader Election Protocol
Formal Methods in System Design
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
Theoretical Computer Science
Proving Invariants of I/O Automata with TAME
Automated Software Engineering
Comparing refinements for failure and bisimulation semantics
Fundamenta Informaticae
Refinement Based Validation of an Algorithm for Detecting Distributed Termination
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Mechanical Translation of I/O Automaton Specifications into First-Order Logic
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Compositional Verification of Randomized Distributed Algorithms
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Forward Simulation for Data Refinement of Classes
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Efficiency of Token-Passing MUTEX-Solutions - Some Experiments
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Eternity Variables to Simulate Specifications
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Nonblocking k-compare-single-swap
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Information and Computation
Information and Computation
DCAS is not a silver bullet for nonblocking algorithm design
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A theory of normed simulations
ACM Transactions on Computational Logic (TOCL)
Safe compositional specification of networking systems
ACM SIGCOMM Computer Communication Review
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Distributed Computing
Eternity variables to prove simulation of specifications
ACM Transactions on Computational Logic (TOCL)
Turing machines, transition systems, and interaction
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Theoretical Computer Science - Selected papers of CMCS'03
ASM Refinement and generalizations of forward simulation in data refinement: a comparison
Theoretical Computer Science - Abstract state machines and high-level system design and analysis
Comparative branching-time semantics for Markov chains
Information and Computation
Ownership confinement ensures representation independence for object-oriented programs
Journal of the ACM (JACM)
Cones and foci: A mechanical framework for protocol verification
Formal Methods in System Design
Backward Bisimulation in Markov Chain Model Checking
IEEE Transactions on Software Engineering
Theorem-proving anonymity of infinite-state systems
Information Processing Letters
A formal treatment of an abstract channel implementation using java sockets and TCP
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Universal extensions to simulate specifications
Information and Computation
Verifying Michael and Scott's lock-free queue algorithm using trace reduction
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Simulation Refinement for Concurrency Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Completeness of ASM Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
General Refinement, Part One: Interfaces, Determinism and Special Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
The power of simulation relations
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A Rigorous Approach to Networking: TCP, from Implementation to Protocol to Service
FM '08 Proceedings of the 15th international symposium on Formal Methods
Compositional Abstraction in Real-Time Model Checking
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Refinement of State-Based Systems: ASMs and Big Commuting Diagrams (Abstract)
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Automatically transforming and relating Uppaal models of embedded systems
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Category Theoretic Models of Data Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a real-time distributed computing model
Theoretical Computer Science
An Adversary Model for Simulation-Based Anonymity Proof
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On Backward-Style Anonymity Verification
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Transformations for write-all-with-collision model
Computer Communications
Relational Concurrent Refinement: Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Concise Graphs and Functional Bisimulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparative branching-time semantics for Markov chains
Information and Computation
Turing machines, transition systems, and interaction
Information and Computation
Remarks on Thatte's transformation of term rewriting systems
Information and Computation
Efficiency of asynchronous systems that communicate asynchronously
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Cones and foci for protocol verification revisited
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Safe compositional network sketches: formal framework
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Probabilistic anonymity via coalgebraic simulations
ESOP'07 Proceedings of the 16th European conference on Programming
Probabilistic anonymity via coalgebraic simulations
Theoretical Computer Science
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
Nonblocking algorithms and backward simulation
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Towards Formally Specifying and Verifying Transactional Memory
Electronic Notes in Theoretical Computer Science (ENTCS)
Simpler backward simulation proofs
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Incompleteness of relational simulations in the blocking paradigm
Science of Computer Programming
Generic forward and backward simulations II: probabilistic simulation
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Simulation refinement for concurrency verification
Science of Computer Programming
Completeness of fair ASM refinement
Science of Computer Programming
Relational concurrent refinement: timed refinement
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Büchi automata can have smaller quotients
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On the refinement of liveness properties of distributed systems
Formal Methods in System Design
Verifying fence elimination optimisations
SAS'11 Proceedings of the 18th international conference on Static analysis
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Reverse observation equivalence between labelled state transition systems
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Assertion-based encapsulation, object invariants and simulations
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Formal verification of a lazy concurrent list-based set algorithm
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Parameterized verification of deadlock freedom in symmetric cache coherence protocols
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Generic forward and backward simulations
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
CBSE'06 Proceedings of the 9th international conference on Component-Based Software Engineering
Adaptive techniques for specification matching in embedded systems: a comparative study
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
On construction of a library of formally verified low-level arithmetic functions
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
How to prove algorithms linearisable
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
Comparing Refinements for Failure and Bisimulation Semantics
Fundamenta Informaticae
Note: Finite and infinite implementation of transition systems
Theoretical Computer Science
A theory of history dependent abstractions for learning interface automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
A framework for formally verifying software transactional memory algorithms
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Logical relations for fine-grained concurrency
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modular verification of linearizability with non-fixed linearization points
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
CompCertTSO: A Verified Compiler for Relaxed-Memory Concurrency
Journal of the ACM (JACM)
On construction of a library of formally verified low-level arithmetic functions
Innovations in Systems and Software Engineering
ACM Computing Surveys (CSUR)
Generalizing simulation to abstract domains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
Hi-index | 0.01 |