Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Program synthesis using realizability

From MaRDI portal
Publication:1183580
Jump to:navigation, search

zbMath0745.68030MaRDI QIDQ1183580

Makoto Tatsuta

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)


zbMATH Keywords

soundnessprogram synthesis\textbf{q}-realizability interpretationrecursively defined predicatetheory \textbf{EON}+\(\mu\)


Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)


Related Items

Realizability interpretation of generalized inductive definitions, Monotone recursive definition of predicates and its realizability interpretation, Adding proof objects and inductive definition mechanisms to frege structures, Completeness and expressiveness of pointer program verification by separation logic, Realizability interpretation of coinductive definitions and program synthesis with streams, \(QPC_ 2\): A constructive calculus with parameterized specifications



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1183580&oldid=12050152"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki