About: Predicate transformer semantics

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Predicate transformer semantics Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatFormalMethods, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FPredicate_transformer_semantics

Predicate transformer semantics were introduced by Edsger Dijkstra in his seminal paper "Guarded commands, nondeterminacy and formal derivation of programs". They define the semantics of an imperative programming paradigm by assigning to each statement in this language a corresponding predicate transformer: a total function between two predicates on the state space of the statement. In this sense, predicate transformer semantics are a kind of denotational semantics. Actually, in guarded commands, Dijkstra uses only one kind of predicate transformer: the well-known weakest preconditions (see below).

Attributes	Values
rdf:type	yago:Ability105616246 yago:Abstraction100002137 yago:Cognition100023271 yago:Creativity105624700 yago:Invention105633385 yago:Know-how105616786 yago:Method105660268 yago:PsychologicalFeature100023100 yago:WikicatDutchInventions yago:WikicatFormalMethods
rdfs:label	Semàntica de transformació de predicats (ca) Wp-Kalkül (de) Semántica de transformación de predicados (es) 述語変換意味論 (ja) Predicate transformer semantics (en) Слабейшее предусловие (ru)
rdfs:comment	述語変換意味論（じゅつごへんかんいみろん、Predicate Transformer Semantics）は、エドガー・ダイクストラによるホーア論理の拡張であり、その後も他の研究者が改良を加えたものである。最初に登場したのはダイクストラの論文 "Guarded commands, nondeterminacy and formal derivation of programs" であった。 (ja) La semàntica de transformació de predicats és una extensió de la lògica de Floyd-Hoare ideada per Edsger Dijkstra i divulgada i perfeccionada per altres investigadors. Aquesta extensió va presentar-la Dijkstra en l'article "Comandaments guardats, no-determinisme i derivació formal de programes". Consisteix en un mètode per a definir la semàntica d'un llenguatge de programació imperativa amb l'assignació a cada comandament del corresponent transformador de predicats. Un transformador de predicats és una funció total entre dos predicats del conjunt d'estats d'un programa. (ca) Der wp-Kalkül ist ein Kalkül in der Informatik zur Verifikation eines imperativen Programmcodes. Die Abkürzung wp steht für weakest precondition, auf deutsch schwächste Vorbedingung. Bei der Verifikation geht es nicht darum, die Funktion mit einer bestimmten Menge an Eingabedaten auf korrekte Ergebnisse zu testen, sondern darum, eine allgemeingültige Aussage über das korrekte Ablaufen des Programms zu erhalten. Alternativ kann auch der Hoare-Kalkül benutzt werden, bei dem im Gegensatz zum wp-Kalkül eine Vorwärtsanalyse stattfindet. (de) La semántica de transformación de predicados es una extensión de Lógica de Floyd-Hoare ideada por Edsger Dijkstra y extendida y refinada por otros investigadores. Esta extensión fue presentada por Dijkstra en sus artículos titulados "Guarded commands, nondeterminacy and formal derivation of programs" ("Comandos guardados, no-determinismo y derivación formal de programas"). Consiste en un método para definir la semántica de un lenguaje de programación imperativa mediante la asignación a cada comando del correspondiente transformador de predicados. Un es una función total entre dos predicados del conjunto de estados de un programa. (es) Predicate transformer semantics were introduced by Edsger Dijkstra in his seminal paper "Guarded commands, nondeterminacy and formal derivation of programs". They define the semantics of an imperative programming paradigm by assigning to each statement in this language a corresponding predicate transformer: a total function between two predicates on the state space of the statement. In this sense, predicate transformer semantics are a kind of denotational semantics. Actually, in guarded commands, Dijkstra uses only one kind of predicate transformer: the well-known weakest preconditions (see below). (en) Преобразователи предикатов — расширение логики Флойда-Хоара, сделанное Э. Дейкстрой. Впервые появившись в [1], с помощью этого метода определяется семантика императивного программирования и соответствующего языка. В нём каждой команде языка программирования соответствует преобразователь предиката, т. е. полное функциональное соответствие между двумя предикатами в пространстве состояний программы. , получая предикат-копию R со значением x заменённым на E. Таким образом, выражение , где Т — терминальное (конечное) состояние системы, всегда обеспечит истинность R. (ru)
dcterms:subject	Edsger W. Dijkstra Program logic Formal methods
Wikipage page ID	1453583 (xsd:integer)
Wikipage revision ID	1124903239 (xsd:integer)
Link from a Wikipage to another Wikipage	Deductive reasoning Denotational semantics Algorithm Dynamic logic (modal logic) ESC/Java Loop invariant Coq Cryptography Separation logic Free variables and bound variables Monad (functional programming) Monotonic Concurrent programming Precondition Leslie Lamport Deductive system Ralph-Johan Back Symbolic execution Postcondition Total function Type theory Well-founded relation Gödel's completeness theorem Edsger W. Dijkstra First-order logic Formal semantics of programming languages Frama-C Edsger W. Dijkstra Niklaus Wirth Program logic Formal Aspects of Computing Predicate (mathematical logic) Haskell Formal methods Hoare logic Automated reasoning Axiomatic semantics B-Method Guarded Command Language Randomized algorithm Refinement calculus Satisfiability modulo theories Imperative programming Distributed systems Evaluation strategy Assertion (computing) Floyd–Hoare logic Guarded commands Interactive theorem proving
Link from a Wikipage to an external page	https://books.google.com/books%3Fid=cCbjBwAAQBAJ https://archive.org/details/disciplineofprog0000dijk https://archive.org/details/mathematicaltheo0000bakk https://archive.org/details/scienceofprogram0000grie
sameAs	Predicate transformer semantics Predicate transformer semantics Predicate transformer semantics Predicate transformer semantics Predicate transformer semantics Predicate transformer semantics Predicate transformer semantics Predicate transformer semantics Predicate transformer semantics Predicate transformer semantics
dbp:wikiPageUsesTemplate	dbt:Anchor dbt:Citation_needed dbt:Cite_book dbt:Cite_journal dbt:Mvar dbt:Refbegin dbt:Refend dbt:Reflist dbt:Short_description dbt:Semantics

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software