Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning about fair concurrent programs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Specification and verification of concurrent programs by A∀automata
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Appraising fairness in distributed languages
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Modular verification of asynchronous networks
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Interleaving set temporal logic
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Fairness in parallel programs: the transformational approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying temporal properties without temporal logic
ACM Transactions on Programming Languages and Systems (TOPLAS)
A lattice-structured proof of a minimum spanning
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency
IEEE Transactions on Software Engineering
Progress measures and stack assertions for fair termination
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
An introduction to assertional reasoning for concurrent systems
ACM Computing Surveys (CSUR)
A superimposition control construct for distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compositional specification and verification of distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modalities for model checking (extended abstract): branching time strikes back
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Checking progress with action priority: is it fair?
ESEC/FSE-7 Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Concepts and Notations for Concurrent Programming
ACM Computing Surveys (CSUR)
Termination of Probabilistic Concurrent Program
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the complexity of verifying concurrent transition systems
Information and Computation
Termination of probabilistic concurrent programs: (extended abstract)
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Liveness and Fairness in Process-Algebraic Verification
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Verifying Liveness by Augmented Abstraction
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
A Deductive Proof System for CTL
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Handbook of automated reasoning
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Fair termination of communicating processes
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Transition logic: How to reason about temporal properties in a compositional way
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A general result on infinite trees and its applications
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On the extremely fair treatment of probabilistic algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Proving nets correct via cause-effect structures (an experiment)
Fundamenta Informaticae - Concurrency specification and programming
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Verification of distributed programs using representative interleaving sequences
Distributed Computing
CONCUR 2005 - Concurrency Theory
Model Checking with Strong Fairness
Formal Methods in System Design
A compositional approach to CTL* verification
Theoretical Computer Science - Formal methods for components and objects
Best Fairness Hierarchy in Elementary Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
An Axiomatic Framework for Proving Correctness of Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Trace Nets and Conflict-free Computations
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Transition predicate abstraction and fair termination
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special issue on POPL 2005
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of just/fair computations in term rewriting
Information and Computation
On Ethics of Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Verifying liveness for asynchronous programs
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On conditions for the liveness of weakly persistent nets
Information Processing Letters
PAT: Towards Flexible Verification under Fairness
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
ACM Computing Surveys (CSUR)
Information and Computation
Liveness and fairness properties in multi-agent systems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Quantitative Analysis under Fairness Constraints
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Scalable Multi-core Model Checking Fairness Enhanced Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Model-checking behavioral programs
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Quantitatively fair scheduling
Theoretical Computer Science
Termination of fair computations in term rewriting
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Separating fairness and well-foundedness for the analysis of fair discrete systems
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Complementation constructions for nondeterministic automata on infinite words
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Using fairness constraints in process-algebraic verification
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Explicit fair scheduling for dynamic control
Concurrency, Compositionality, and Correctness
Defining Fairness in Reactive and Concurrent Systems
Journal of the ACM (JACM)
Proving liveness property under strengthened compassion requirements
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
On Ethics of Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Trace Nets and Conflict-free Computations
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
An Axiomatic Framework for Proving Correctness of Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Best Fairness Hierarchy in Elementary Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Proving Nets Correct via Cause-Effect Structures (An Experiment)
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
An algorithm on fairness verification of mobile sink routing in wireless sensor network
Personal and Ubiquitous Computing
Model checking with fairness assumptions using PAT
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |