Direct semantics of concurrent languages in the SMoLCS approach

Astesiano, Egidio; Reggio, Gianna

doi:10.1147/rd.315.0512

Cited by 12 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…-specifications of case studies, as in [8,11,19,60,61]; -its usage as a base for formally defining other formalisms, e.g., [24], for formalizing in a modular way various kinds of higher-order algebraic Petri nets, [31] for a variant of extended shared Prolog, [6] for objectoriented features, and, more recently, [59] for parts of UML; -for defining the semantics of concurrent/parallel programming languages, as Ada, [2,10,13,15].…”

Section: Extension To Concurrency Of Techniques/results Of Algebraic mentioning

confidence: 99%

“…The original approach addressing the design phases was developed in connection with and applied to the specification of a prototype Campus Net, in the project CNET [8]. Then the approach was extended to deal with semantic issues of languages with concurrent features and applied to give the first complete formal definition of Ada, within an EEC-MAP project (see, e.g., [13,2,10]). Finally, in a four years long project partially supported by ENEL (the National Electricity Company of Italy), two test cases have been addressed, which have been influential for the requirement phase and methodological aspects, discussed jointly with the people on the industry side.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Labelled transition logic: an outline

Astesiano

Reggio

2001

Acta Informatica

View full text Add to dashboard Cite

In the last ten years we have developed and experimented in a series of projects, including industry test cases, a method for the specification of reactive/concurrent/parallel/distributed systems both at the requirement and at the design level. We present here in outline its main technical features, providing pointers to appropriate references for more detailed presentations of single aspects, applications and documentation.The overall main feature of the method is its logical (algebraic) character, because it extends to labelled transition systems the logical/algebraic specification method of abstract data types; moreover systems are viewed as data within first-order structures called LT-structures. Some advantages of the approach are the full integration of the specification of static data and of dynamic systems, which includes by free higher-order concurrency, and the exploitation of well-explored classical techniques in many respects, including implementation and tools.On the other hand the use of labelled transition systems for modelling systems, inspired by CCS, allows us to take advantage, with appropriate extensions, of some important concepts, like communication mechanisms and observational semantics, developed in the area of concurrency around CCS, CSP and related approaches.

show abstract

Section: Extension To Concurrency Of Techniques/results Of Algebraic mentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

Labelled transition logic: an outline

Astesiano

Reggio

2001

Acta Informatica

View full text Add to dashboard Cite

show abstract

“…The dynamic semantics [BNK87, GMRZ86] was specified using SMoLCS [AR87], which uses a "VDM-like" style of denotational semantics to map Ada programs into a semantic algebra, where behaviour (including concurrency) is specified using a combination of labelled transition rules and algebraic axioms. The semantic algebra includes the combinators used in VDM.…”

Section: Pl/imentioning

confidence: 99%

VDM semantics of programming languages: combinators and monads

Mosses

2011

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. VDM was developed in the early 1970s as a variant of denotational semantics. VDM descriptions of programming languages differ from the original Scott-Strachey style by making extensive use of combinators which have a fixed operational interpretation. After recalling the main features of denotational semantics and the Scott-Strachey style, we examine the combinators of the VDM specification language, and relate them to monads, which were introduced more than 15 years later. We also suggest that use of further monadic combinators in VDM could be beneficial. Finally, we provide an overview of published VDM semantic descriptions of major programming languages.

show abstract

An outline of the SMoLCS approach

Astesiano

Reggio

1987

Mathematical Models for the Semantics of Parallelism

View full text Add to dashboard Cite

Direct semantics of concurrent languages in the SMoLCS approach

Cited by 12 publications

References 11 publications

Labelled transition logic: an outline

Labelled transition logic: an outline

VDM semantics of programming languages: combinators and monads

An outline of the SMoLCS approach

Contact Info

Product

Resources

About