Toward a theory of maximally concurrent programs (shortened version)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
A Simple, Object-Based View of Multiprogramming
Formal Methods in System Design
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Orchestrating Computations on the World-Wide Web
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Programming methodology
A reduction theorem for concurrent object-oriented programs
Programming methodology
A type and effect system for atomicity
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Atomizer: a dynamic atomicity checker for multithreaded programs
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Exploiting purity for atomicity
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Using SeSFJava in teaching introductory network courses
Proceedings of the 36th SIGCSE technical symposium on Computer science education
Exploiting Purity for Atomicity
IEEE Transactions on Software Engineering
Concurrent program design in the extended theory of Owicki and Gries
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Science of Computer Programming
Formal design of self-stabilizing programs
Journal of High Speed Networks - Self-Stabilizing Systems, Part 1
Atomizer: A dynamic atomicity checker for multithreaded programs
Science of Computer Programming
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Types for atomicity: Static checking and inference for Java
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Temporal Logic of Rewriting: A Gentle Introduction
Concurrency, Graphs and Models
Design of Complex Cyber Physical Systems with Formalized Architectural Patterns
Software-Intensive Systems and New Computing Paradigms
A general technique for proving lock-freedom
Science of Computer Programming
Model Based Testing of a Network-on-Chip Component
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Verifying lock-freedom using well-founded orders
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
The linear temporal logic of rewriting Maude model checker
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A proof-based approach to verifying reachability properties
Proceedings of the 2011 ACM Symposium on Applied Computing
Proving Reachability in B using Substitution Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A UNITY-based framework towards component based systems
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Evaluating support for features in advanced modularization technologies
ECOOP'05 Proceedings of the 19th European conference on Object-Oriented Programming
Localized fairness: a rewriting semantics
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
A distributed maximal scheduler for strong fairness
DISC'07 Proceedings of the 21st international conference on Distributed Computing
A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Specification and Verification of Concurrent Programs Through Refinements
Journal of Automated Reasoning
Taming distributed system complexity through formal patterns
Science of Computer Programming
| Hi-index | 0.00 |