- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
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
- Urheber
-
Steinhöfel, Dominic
Hähnle, Reiner
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10817-023-09692-0
- URN
-
urn:nbn:de:101:1-2406121217251.871021507922
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:02 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Steinhöfel, Dominic
- Hähnle, Reiner
- SpringerLink (Online service)
Ähnliche Objekte (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