Provably Correct Systems

He, Jifeng; Hoare, C. A. R.; Fränzle, Martin; Müller-Olm, Markus; Olderog, Ernst-Rüdiger; Schenke, Michael; Hansen, Michael R.; Ravn, Anders P.; Rischel, Hans

doi:10.1007/3-540-58468-4_171

Cited by 53 publications

(15 citation statements)

References 52 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Algebraic approach to hardware/software partitioning The algebraic approach advocated in this paper to verify the correctness of the partitioning process has been successfully employed in the ProCoS project. The original ProCoS project [12] concentrated almost exclusively on the verification of standard compilers of a high-level programming language based on Occam down to a microprocessor based on Transputer [11]. Sampaio showed how to reduce the compiler design task to program transformation [26].…”

Section: Related Workmentioning

confidence: 99%

From Statecharts to Verilog: a formal approach to hardware/software co-specification

Qin

Chin

et al. 2006

Innovations Syst Softw Eng

Self Cite

View full text Add to dashboard Cite

Hardware/software co-specification is a critical phase in co-design. Our co-specification process starts with a high level graphical description in Statecharts and ends with an equivalent parallel composition of hardware and software descriptions in Verilog. In this paper, we first investigate the Statecharts formalism by providing it a formal syntax and a compositional operational semantics. Based on that, a semantics-preserving linking function is designed to compile specifications written in Statecharts into Verilog. The obtained Verilog specifications are then passed to a partitioning process to generate hardware and software subspecifications, where the correctness is guaranteed by algebraic laws of Verilog.

show abstract

Section: Related Workmentioning

confidence: 99%

From Statecharts to Verilog: a formal approach to hardware/software co-specification

Qin

Chin

et al. 2006

Innovations Syst Softw Eng

Self Cite

View full text Add to dashboard Cite

show abstract

“…By putting (10), (11) and (12) together and using h = se max + 2 · d max , we get max(len V (E)) > pos (D) − h, which means that E is visible within the standard view of D, and hence contradicts our assumption.…”

Section: Theorem 1 (Safety)mentioning

confidence: 86%

“…In [9] controller patterns were proposed to simplify safety proofs for two cooperating traffic agents. Proving system correctness across a number of different abstraction layers continues a line pioneered in the ProCoS (Provably Correct Systems) project [10], in which He Jifeng made significant contributions.…”

Section: Introductionmentioning

confidence: 99%

Proving Safety of Traffic Manoeuvres on Country Roads

Hilscher

Linker

Olderog

2013

Theories of Programming and Formal Methods

Self Cite

View full text Add to dashboard Cite

Abstract.We adapt the Multi-lane Spatial Logic MLSL, introduced in [1] for proving the safety (collision freedom) of traffic manoeuvres on multi-lane motorways, where all cars drive in one direction, to the setting of country roads with two-way traffic. To this end, we need suitably refined sensor functions and length measurement in MLSL. Our main contribution is to show that also here we can separate the purely spatial reasoning from the underlying car dynamics in the safety proof.

show abstract

“…The study of a formal approach to the development of embedded, realtime computer systems is the main goal of the ProCoS (Provably Correct Systems) project (see [28] for a survey paper on the project) funded by the CEC under the ESPRIT program. Four levels of development are considered: requirements definition and control design, transformation to a system architecture with program designs and their transformation to programs, compilation of real-time programs to conventional processors and compilation of programs to hardware.…”

Section: Other Timed Modelsmentioning

confidence: 99%

‘Closed Interval Process Algebra’ versus ‘Interval Process Algebra’

Corradini

Pistore²

2001

Acta Informatica

View full text Add to dashboard Cite

In this paper we extend the theory of processes with durational actions that has been proposed in [1,2] to describe and reason about the performance of systems. We associate basic actions with lower and upper time bounds, that specify their possible different durations. Depending on how the lower and upper time bounds are fixed, eager actions (those which happen as soon as they can), lazy actions (those which can wait arbitrarily long before firing) as well as patient actions (those which can be delayed for a while) can be modelled. Processes are equipped with a (soft) operational semantics which is consistent with the original one and is well-timed (observation traces are ordered with respect to time). The bisimulation-based equivalence defined on top of the new operational semantics, timed equivalence, turns out to be a congruence and, within the lazy fragment of the algebra, refines untimed equivalences. Decidability and automatic checking of timed equivalence are also stated by resorting to a finite alternative characterization which is amenable to an automatic treatment by using standard algorithms. The relationships with other timed calculi and equivalences proposed in the literature are also established.

show abstract

Provably Correct Systems

Cited by 53 publications

References 52 publications

From Statecharts to Verilog: a formal approach to hardware/software co-specification

From Statecharts to Verilog: a formal approach to hardware/software co-specification

Proving Safety of Traffic Manoeuvres on Country Roads

‘Closed Interval Process Algebra’ versus ‘Interval Process Algebra’

Contact Info

Product

Resources

About