Proving concurrent constraint programs correct
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving concurrent constraint programs correct
ACM Transactions on Programming Languages and Systems (TOPLAS)
Trace and testing equivalence on asynchronous processes
Information and Computation
Model and Algorithm for Efficient Verification of High-Assurance Properties of Real-Time Systems
IEEE Transactions on Knowledge and Data Engineering
A Trace-Based Refinement Calculus for Shared-Variable Parallel Programs
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Generic Process Algebras for Asynchronous Communication
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Need for Compositional Proof Systems: A Survey
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
A Theory of "May" Testing for Asynchronous Languages
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Proving Correctness of Timed Concurrent Constraint Programs
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Towards a Unified Development Methodology for Shared-Variable Parallel and Distributed Programs
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
A denotational semantics for Timed Linda
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Proving correctness of timed concurrent constraint programs
ACM Transactions on Computational Logic (TOCL)
A compositional semantics for CHR
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
A compositional semantics for CHR
ACM Transactions on Computational Logic (TOCL)
Fully abstract models and refinements as tools to compare agents in timed coordination languages
Theoretical Computer Science
Efficiency of asynchronous systems that communicate asynchronously
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
A trace-based view on operating guidelines
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
A fresh look at testing for asynchronous communication
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Specifying stateful asynchronous properties for distributed programs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |