Schematic Program Proofs with Abstract Execution : Theory and Applications

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: 1 Online-Ressource.

Language: Englisch

Bibliographic citation: Schematic Program Proofs with Abstract Execution ; volume:68 ; number:2 ; day:26 ; month:3 ; year:2024 ; pages:1-57 ; date:6.2024
Journal of automated reasoning ; 68, Heft 2 (26.3.2024), 1-57, 6.2024

Creator: Steinhöfel, Dominic
Hähnle, Reiner

Contributor: SpringerLink (Online service)

DOI: 10.1007/s10817-023-09692-0

URN: urn:nbn:de:101:1-2406121217251.871021507922

Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 11:02 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Steinhöfel, Dominic
Hähnle, Reiner
SpringerLink (Online service)

Other Objects (12)

Mathematics, algorithms, proofs : 05021 abstracts collection ; Dagstuhl seminar

Hochschulschrift

Refinement of Classical Proofs for Program Extraction

Program-Abstracts

Akten

Applications of formalized consitency proofs II

Proofs and fundamentals : a first course in abstract mathematics

Existence proofs by induction using methods of program synthesis

Termination proofs for a lazy functional language by abstract reduction : (draft)

Abstract Execution: Automatically Proving Infinitely Many Programs

Synthetic proofs

Reusing Proofs

Hochschulschrift

Java program analysis by symbolic execution

Konferenzschrift

Program and abstracts / ICPOC 88

Mathematics, algorithms, proofs : 05021 abstracts collection ; Dagstuhl seminar

Hochschulschrift

Refinement of Classical Proofs for Program Extraction

Program-Abstracts

Akten

Applications of formalized consitency proofs II

Proofs and fundamentals : a first course in abstract mathematics

Existence proofs by induction using methods of program synthesis

Termination proofs for a lazy functional language by abstract reduction : (draft)

Abstract Execution: Automatically Proving Infinitely Many Programs

Synthetic proofs

Reusing Proofs

Hochschulschrift

Java program analysis by symbolic execution

Konferenzschrift

Program and abstracts / ICPOC 88

Mathematics, algorithms, proofs : 05021 abstracts collection ; Dagstuhl seminar

Hochschulschrift

Refinement of Classical Proofs for Program Extraction

Program-Abstracts

Akten

Applications of formalized consitency proofs II

Proofs and fundamentals : a first course in abstract mathematics

Existence proofs by induction using methods of program synthesis

Termination proofs for a lazy functional language by abstract reduction : (draft)

Abstract Execution: Automatically Proving Infinitely Many Programs

Synthetic proofs

Reusing Proofs

Hochschulschrift

Java program analysis by symbolic execution

Konferenzschrift

Program and abstracts / ICPOC 88

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Schematic Program Proofs with Abstract Execution : Theory and Applications

Object Details

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Other Objects (12)

Mathematics, algorithms, proofs : 05021 abstracts collection ; Dagstuhl seminar

Refinement of Classical Proofs for Program Extraction

Program-Abstracts

Applications of formalized consitency proofs II

Proofs and fundamentals : a first course in abstract mathematics

Existence proofs by induction using methods of program synthesis

Termination proofs for a lazy functional language by abstract reduction : (draft)

Abstract Execution: Automatically Proving Infinitely Many Programs

Synthetic proofs

Reusing Proofs

Java program analysis by symbolic execution

Program and abstracts / ICPOC 88

Mathematics, algorithms, proofs : 05021 abstracts collection ; Dagstuhl seminar

Refinement of Classical Proofs for Program Extraction

Program-Abstracts

Applications of formalized consitency proofs II

Proofs and fundamentals : a first course in abstract mathematics

Existence proofs by induction using methods of program synthesis

Termination proofs for a lazy functional language by abstract reduction : (draft)

Abstract Execution: Automatically Proving Infinitely Many Programs

Synthetic proofs

Reusing Proofs

Java program analysis by symbolic execution

Program and abstracts / ICPOC 88

Mathematics, algorithms, proofs : 05021 abstracts collection ; Dagstuhl seminar

Refinement of Classical Proofs for Program Extraction

Program-Abstracts

Applications of formalized consitency proofs II

Proofs and fundamentals : a first course in abstract mathematics

Existence proofs by induction using methods of program synthesis

Termination proofs for a lazy functional language by abstract reduction : (draft)

Abstract Execution: Automatically Proving Infinitely Many Programs

Synthetic proofs

Reusing Proofs

Java program analysis by symbolic execution

Program and abstracts / ICPOC 88

Related objects

Reset password