The Formal Semantics of Programming Languages

Winskel, Glynn

doi:10.7551/mitpress/3054.001.0001

Cited by 673 publications

(328 citation statements)

References 0 publications

Supporting

Mentioning

322

Contrasting

Unclassified

Order By: Relevance

“…The denotational semantics of a history expression is a set H. The intended meaning is that the behaviour of λ req expression is approximated by H. Technically, H belongs to the lifted cpo of sets of histories [62], ordered by (lifted) set inclusion ⊆ ⊥ (where ⊥ ⊆ ⊥ H for all H, and H ⊆ ⊥ H whenever H ⊆ H ). The least upper bound between two elements of the cpo is standard set union.…”

Section: Examplementioning

confidence: 99%

Planning and verifying service composition

Bartoletti

Degano

Ferrari

2009

JCS

View full text Add to dashboard Cite

A static approach is proposed to study secure composition of services. We extend the λ-calculus with primitives for selecting and invoking services that respect given security requirements. Security-critical code is enclosed in policy framings with a possibly nested, local scope. Policy framings enforce safety and liveness properties. The actual run-time behaviour of services is over-approximated by a type and effect system. Types are standard, and effects include the actions with possible security concerns -as well as information about which services may be invoked at run-time. An approximation is model checked to verify policy framings within their scopes. This allows for removing any run-time execution monitor, and for determining the plans driving the selection of those services that match the security requirements on demand.

show abstract

Section: Examplementioning

confidence: 99%

Planning and verifying service composition

Bartoletti

Degano

Ferrari

2009

JCS

View full text Add to dashboard Cite

show abstract

“…If the computer system as a state transition system, then the semantics of each machine instruction by the instruction in the implementation process for the machine status updates to describe. Customary for people to understand the behavior of the program will virtually build an intuitive model, the main idea of the model to "The contents of the storage unit decided machine state" structured operational semantics classics program behavior the formal description also reflects this idea [10]. You can do this by describing the instruction storage unit contents in the implementation process to change the situation and to describe the effect of the operation of the instruction.…”

Section: B Instruction Semantic Descriptionmentioning

confidence: 99%

MSI-SDL: A semantic description language for multi-source binary translation systems

Liu

Pang

Yin

et al. 2013

2013 8th International Conference on Computer Science &Amp; Education

View full text Add to dashboard Cite

Multi-source binary translation system (MBT) pro vides a multi-source platform code to a single target platform migration solution. Do not know the source code, you can achieve the multi-source platform, multi-compiled version of the executable file on another platform. In order to achieve the special semantic mapping function of the MBT system, the need for a unified, compatible with multiple target platform differences, atomic semantic description language. In this paper, we design an atomic semantic description language MSI-SDL (multi-source instruction semantic description language), the x86-32, x86-64, power platform code, to class alpha platform architecture code semantic mapping function in the migration process. MBT base on MSI-SDL are evaluated wholly and partIy across the SPEC 2006 under the Alpha multi-core environment, test results verify the MSI-SDL correctness and validity.

show abstract

“…Most books present abstract syntax, axioms and inference rules in the same way as we have done above [3,[16][17][18]. However, some texts [19] leave out embellishments, and represent an abstract syntax purely as an algebraic data type.…”

Section: Alternative Approachesmentioning

confidence: 99%

LETOS - a lightweight execution tool for operational semantics

Hartel

1999

Softw: Pract. Exper.

View full text Add to dashboard Cite

A lightweight tool is proposed to aid in the development of operational semantics. To use LETOS an operational semantics must be expressed in its meta-language, which itself is a superset of Miranda. The LETOS compiler is smaller than comparable tools, yet LETOS is powerful enough to support publication quality rendering using L AT E X, fast enough to provide competitive execution using Haskell, and versatile enough to support browsing of execution traces using Netscape. LETOS can be characterised as an experiment in 'creative laziness', showing how far one can get by gluing existing components together. The major specifications built using LETOS to-date are a smart card version of the Java Virtual Machine, a deterministic version of the π-calculus, and an electronic payment protocol. In addition, we have specified the semantics of many small programming languages and systems, totaling over 9000 lines of formal text. LETOS is unique in that it helps to check that a specification is operationally conservative. P. H. HARTELimplement her semantics. The RML system [6] covers middle ground in that RML offers only one facility: the compilation of operational semantics specifications into C. Concentrating on one aspect pays off; the RML system executes an operational semantics faster than its competitors.The three approaches above represent as many points in a spectrum of possibilities. The sophisticated tools provide comprehensive facilities, but not without imposing limitations. The ASF+SDF system, for example, is not polymorphic, and it is also first order. This makes it awkward to work with denotational semantics [7]. The complexity of a system such as ASF+SDF makes it less than straightforward to experiment with, say, a higher order version of the system. The Typol subsystem [8] of Centaur is slow [6]. Recent work on the Minotaur [9] version of Typol has shown that imposing restrictions on the full generality of the Typol inference rules makes speed improvements of a factor of about 10-15 possible. This still leaves the performance of Typol wanting. The RML system does well on one aspect: speed of execution. However, the lack of rendering and execution tracing facilities does not make for a user-friendly system [6].The systems referred to above have one factor in common: they are not small. For example, in 1988 the Centaur system was reported to consist of 32,000 lines of code [10] and in 1996 the RML compiler and runtime system together comprised 15,000 lines of code [11].The approach advocated in this paper is to build a lightweight tool that offers the most important facilities at a minimal cost. This implies a small size of the meta-language compiler and minimal runtime support, a quick edit-compile-run cycle and a short learning period. The low cost is achieved by making maximum use of existing components, and by judiciously selecting essential features. The proposed LETOS program is small (2000 lines of lex, yacc and C). It takes as input a superset of Miranda. LETOS is capable of producing a proper declarati...

show abstract

The Formal Semantics of Programming Languages

Cited by 673 publications

References 0 publications

Planning and verifying service composition

Planning and verifying service composition

MSI-SDL: A semantic description language for multi-source binary translation systems

LETOS - a lightweight execution tool for operational semantics

Contact Info

Product

Resources

About