Frank A. Stomp - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2006

An Assertional Correctness Proof of a Self-Stabilizing - Exclusion AlgorithmMilos Besta, Frank A. Stomp. ICECCS 2006: 199-208 [doi]

2005

A Complete Mechanization of Correctness of a String-Preprocessing AlgorithmMilos Besta, Frank A. Stomp. fmsd, 27(1-2):5-17, 2005. [doi]

Verifying Parameterized RefinementMaty Sylla, Frank A. Stomp, Willem P. de Roever. ICECCS 2005: 313-321 [doi]

2003

Safety assurance via on-line monitoringShlomi Dolev, Frank A. Stomp. dc, 16(4):269-277, 2003. [doi]

Correctness of substring-preprocessing in Boyer-Moore s pattern matching algorithmFrank A. Stomp. TCS, 290(1):59-78, 2003.

2002

Mechanization of a Proof of String-Preprocessing in Boyer-Moore s Pattern Matching AlgorithmMilos Besta, Frank A. Stomp. ICECCS 2002: 68-77 [doi]

2001

Safety Assurance via On-Line MonitoringShlomi Dolev, Frank A. Stomp. isads 2001: 101 [doi]

1999

Cache Coherency in SCI: Specification and a Sketch of CorrectnessAmy P. Felty, Frank A. Stomp. fac, 11(5):475-497, 1999. [doi]

Constructing a Reliable Test&Set BitFrank A. Stomp, Gadi Taubenfeld. tpds, 10(3):252-265, 1999. [doi]

1998

A proof theory of asynchronously communicating sequential processesFrank S. de Boer, Nissim Francez, M. van Hulst, Frank A. Stomp. procomet 1998: 49-67

Protocol Verification in NuprlAmy P. Felty, Douglas J. Howe, Frank A. Stomp. cav 1998: 428-439

1996

Constructing a Reliable Test&Set Bit (Abstract)Frank A. Stomp, Gadi Taubenfeld. podc 1996: 177

Modular Completeness: Integrating the Reuse of Specified Software in Top-down Program DevelopmentJob Zwiers, Ulrich Hannemann, Yassine Lakhnech, Willem P. de Roever, Frank A. Stomp. FM 1996: 595-608

1995

Formalizing Inductive Proofs of Network AlgorithmsRamesh Bharadwaj, Amy P. Felty, Frank A. Stomp. asian 1995: 335-349

1994

Extending the Limits of Sequentially Phased ReasoningMichael Siegel, Frank A. Stomp. fsttcs 1994: 402-413

A Principle for Sequential Reasoning about Distributed AlgorithmsFrank A. Stomp, Willem P. de Roever. fac, 6(6):716-737, 1994.

1993

Structured Design of Self-Stabilizing ProgramsFrank A. Stomp. istcs 1993: 167-176

1992

Preserving Specific Properties in Programm Development: How to Debug Programs (Conference Version)Frank A. Stomp. concur 1992: 176-191

1990

A Fast Pattern Matching Algorithm Derived by Transformational and Assertional ReasoningHelmuth Partsch, Frank A. Stomp. fac, 2(2):109-122, 1990.

A derivation of a broadcasting protocol using sequentially phased reasoningFrank A. Stomp. pstv 1990: 19-32

1989

The upsilon-Calculus as an Assertion-Language for Fairness ArgumentsFrank A. Stomp, Willem P. de Roever, Rob Gerth. iandc, 82(3):278-322, September 1989.

Designing Distributed Algorithms by Means of Formal Sequentially Phased Reasoning (Extended Abstract)Frank A. Stomp, Willem P. de Roever. wdag 1989: 242-253

A Derivation of a Broadcasting Protocol Using Sequentially Phased ReasoningFrank A. Stomp. rex 1990: 696-730

1987

A Correctness Proof of a Distributed Minimum-Weight Spanning Tree Algorithm (extended abstract)Frank A. Stomp, Willem P. de Roever. icdcs 1987: 440-447

Sign in or sign up to see more results.

runs on WebDSL