Mechanizing CSP trace theory in higher order logic

Camilleri, Albert John

doi:10.1109/32.58786

Cited by 45 publications

(17 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A related framework, action systems, has also been formalized in HOL [16]. CSP has been treated in HOL [3], Isabelle/HOL [26] and PVS [6]. CCS has been formalized in HOL [18].…”

Section: Related Workmentioning

confidence: 99%

Owicki/Gries in Isabelle/HOL

Nipkow

Nieto

1999

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. We present a formalization of the Gries/Owicki method for correctness proofs of concurrent imperative programs with shared variables in the theorem prover Isabelle/HOL. Syntax, semantics and proof rules are defined in higher-order logic. The correctness of the proof rules w.r.t. the semantics is proved. The verification of some typical example programs like producer/consumer is presented.

show abstract

“…A related framework, action systems, has also been formalized in HOL [16]. CSP has been treated in HOL [3], Isabelle/HOL [26] and PVS [6]. CCS has been formalized in HOL [18].…”

Section: Related Workmentioning

confidence: 99%

Owicki/Gries in Isabelle/HOL

Nipkow

Nieto

1999

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

“…Similarly, general-purpose theorem provers like Isabelle [25] or HOL [26] can infer steps from declarative specifications of semantic rules. Day and Joyce [27] describe a framework that, given an embedding in HOL of a notation's semantics and of a specification, formalizes the specification's next-step relation as a HOL type.…”

Section: Automated Analyzer Generatorsmentioning

confidence: 99%

Inference graphs: a computational structure supporting generation of customizable and correct analysis components

Dillon

Stirewalt

2003

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Abstract-Amalia is a generator framework for constructing analyzers for operationally defined formal notations. These generated analyzers are components that are designed for customization and integration into a larger environment. The customizability and efficiency of Amalia analyzers owe to a computational structure called an inference graph. This paper describes this structure, how inference graphs enable Amalia to generate analyzers for operational specifications, and how we build in assurance. On another level, this paper illustrates how to balance the need for assurance, which typically implies a formal proof obligation, against other design concerns, whose solutions leverage design techniques that are not (yet) accompanied by mature proof methods. We require Amaliagenerated designs to be transparent with respect to the formal semantic models upon which they are based. Inference graphs are complex structures that incorporate many design optimizations. While not formally verifiable, their fidelity with respect to a formal operational semantics can be discharged by inspection.

show abstract

“…lsl traits defined by Chalin [8] were reused here after some modification and reverification. For csp functions, the csp axiomatization developed by Camilleri [16] is adapted. Camilleri's original theories were developed in HOL [17], thus requiring translation to lsl and verification.…”

Section: Generating Semantic Modelsmentioning

confidence: 99%

A brief summary of VSPEC

Alexander

Rangarajan

Baraona

1999

FM’99 — Formal Methods

View full text Add to dashboard Cite

Abstract. This paper provides an overview of the vspec behavioral interface specification language for vhdl. Although operational specification language such as vhdl provide exceptional specification capabilities, at the systems requirements level the operational style is a hindrance. vspec provides vhdl users with a declarative mechanism for defining functional requirements and performance constraints. In the tradition of behavioral interface specification languages, vspec adds clauses to the vhdl entity construct allowing axiomatic specification of functional requirements. Because system constraints play an ever increasing role in systems design, vspec also provides performance constraint specification capability. This paper presents the basics of vspec, its semantics, semantic analysis, and briefly describes current and future applications.

show abstract

Mechanizing CSP trace theory in higher order logic

Cited by 45 publications

References 10 publications

Owicki/Gries in Isabelle/HOL

Owicki/Gries in Isabelle/HOL

Inference graphs: a computational structure supporting generation of customizable and correct analysis components

A brief summary of VSPEC

Contact Info

Product

Resources

About