Frank A. Stomp

According to our database1, Frank A. Stomp authored at least 22 papers between 1987 and 2006.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2006
An Assertional Correctness Proof of a Self-Stabilizing - Exclusion Algorithm.
Proceedings of the 11th International Conference on Engineering of Complex Computer Systems (ICECCS 2006), 2006

2005
A Complete Mechanization of Correctness of a String-Preprocessing Algorithm.
Formal Methods Syst. Des., 2005

Verifying Parameterized Refinement.
Proceedings of the 10th International Conference on Engineering of Complex Computer Systems (ICECCS 2005), 2005

2003
Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm.
Theor. Comput. Sci., 2003

Safety assurance via on-line monitoring.
Distributed Comput., 2003

2002
Mechanization of a Proof of String-Preprocessing in Boyer-Moore's Pattern Matching Algorithm.
Proceedings of the 8th International Conference on Engineering of Complex Computer Systems (ICECCS 2002), 2002

1999
Constructing a Reliable Test&Set Bit.
IEEE Trans. Parallel Distributed Syst., 1999

Cache Coherency in SCI: Specification and a Sketch of Correctness.
Formal Aspects Comput., 1999

1998
A proof theory of asynchronously communicating sequential processes.
Proceedings of the Programming Concepts and Methods, 1998

Protocol Verification in Nuprl.
Proceedings of the Computer Aided Verification, 10th International Conference, 1998

1996
Constructing a Reliable Test&Set Bit (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Modular Completeness: Integrating the Reuse of Specified Software in Top-down Program Development.
Proceedings of the FME '96: Industrial Benefit and Advances in Formal Methods, 1996

1995
Formalizing Inductive Proofs of Network Algorithms.
Proceedings of the Algorithms, 1995

1994
A Principle for Sequential Reasoning about Distributed Algorithms.
Formal Aspects Comput., 1994

Extending the Limits of Sequentially Phased Reasoning.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993
Structured Design of Self-Stabilizing Programs.
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

1992
Preserving Specific Properties in Programm Development: How to Debug Programs (Conference Version).
Proceedings of the CONCUR '92, 1992

1990
A Fast Pattern Matching Algorithm Derived by Transformational and Assertional Reasoning.
Formal Aspects Comput., 1990

A derivation of a broadcasting protocol using sequentially phased reasoning.
Proceedings of the Protocol Specification, 1990

1989
The upsilon-Calculus as an Assertion-Language for Fairness Arguments
Inf. Comput., September, 1989

Designing Distributed Algorithms by Means of Formal Sequentially Phased Reasoning (Extended Abstract).
Proceedings of the Distributed Algorithms, 1989

1987
A Correctness Proof of a Distributed Minimum-Weight Spanning Tree Algorithm (extended abstract).
Proceedings of the 7th International Conference on Distributed Computing Systems, 1987


  Loading...