Logic based program synthesis and transformation
Autoři
Parametry
Více o knize
InhaltsverzeichnisVerification and Analysis.Searching Semantically Equivalent Code Fragments in Logic Programs.Determinacy Analysis for Logic Programs Using Mode and Type Information.Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs.Fully Automatic Binding-Time Analysis for Prolog.Theory and Security.Logical Mobility and Locality Types.Unwinding Conditions for Security in Imperative Languages.Natural Rewriting for General Term Rewriting Systems.Transformations.Negation Elimination for Finite PCFGs.Specialization of Concurrent Guarded Multi-set Transformation Rules.Efficient Local Unfolding with Ancestor Stacks for Full Prolog.Program Development.Schema-Guided Synthesis of Imperative Programs by Constraint Solving.Run-Time Profiling of Functional Logic Programs.Constructive Specifications for Compositional Units.Termination.Input-Termination of Logic Programs.On Termination of Binary CLP Programs.Program Development and Synthesis.From Natural Semantics to Abstract Machines.Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis.
Nákup knihy
Logic based program synthesis and transformation, Sandro Etalle
- Jazyk
- Rok vydání
- 2005
Doručení
Platební metody
2021 2022 2023
Navrhnout úpravu
- Titul
- Logic based program synthesis and transformation
- Jazyk
- anglicky
- Autoři
- Sandro Etalle
- Vydavatel
- Springer
- Rok vydání
- 2005
- ISBN10
- 3540266550
- ISBN13
- 9783540266556
- Série
- Lecture notes in computer science
- Kategorie
- Počítače, IT, programování
- Anotace
- InhaltsverzeichnisVerification and Analysis.Searching Semantically Equivalent Code Fragments in Logic Programs.Determinacy Analysis for Logic Programs Using Mode and Type Information.Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs.Fully Automatic Binding-Time Analysis for Prolog.Theory and Security.Logical Mobility and Locality Types.Unwinding Conditions for Security in Imperative Languages.Natural Rewriting for General Term Rewriting Systems.Transformations.Negation Elimination for Finite PCFGs.Specialization of Concurrent Guarded Multi-set Transformation Rules.Efficient Local Unfolding with Ancestor Stacks for Full Prolog.Program Development.Schema-Guided Synthesis of Imperative Programs by Constraint Solving.Run-Time Profiling of Functional Logic Programs.Constructive Specifications for Compositional Units.Termination.Input-Termination of Logic Programs.On Termination of Binary CLP Programs.Program Development and Synthesis.From Natural Semantics to Abstract Machines.Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis.