Pages that link to "Item:Q3079910"
From MaRDI portal
The following pages link to Logic Based Program Synthesis and Transformation (Q3079910):
Displaying 42 items.
- A General Framework for Variable Aliasing: Towards Optimal Operators for Sharing Properties (Q3079911) (← links)
- Two Variables per Linear Inequality as an Abstract Domain (Q3079912) (← links)
- Forward Slicing of Multi-paradigm Declarative Programs Based on Partial Evaluation (Q3079913) (← links)
- A Fixed Point Semantics for Logic Programs Extended with Cuts (Q3079915) (← links)
- Abstract Diagnosis of Functional Programs (Q3079916) (← links)
- Constraint Solver Synthesis Using Tabled Resolution for Constraint Logic Programming (Q3079917) (← links)
- Combining Logic Programs and Monadic Second Order Logics by Program Transformation (Q3079918) (← links)
- Verification in ACL2 of a Generic Framework to Synthesize SAT-Provers (Q3079919) (← links)
- A Proof System for Information Flow Security (Q3079920) (← links)
- Refinement of Higher-Order Logic Programs (Q3079921) (← links)
- A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene (Q3079922) (← links)
- Convex Hull Abstractions in Specialization of CLP Programs (Q3079923) (← links)
- An Operational Approach to Program Extraction in the Calculus of Constructions (Q3079924) (← links)
- A Generic Program for Minimal Subsets with Applications (Q3079925) (← links)
- Mapping Modular SOS to Rewriting Logic (Q3079927) (← links)
- Temporal Logic Constraints in the Biochemical Abstract Machine BIOCHAM (Q5302876) (← links)
- Declarative Programming with Function Patterns (Q5302877) (← links)
- Transformational Verification of Parameterized Protocols Using Array Formulas (Q5302878) (← links)
- Design and Implementation of ${\mathcal A}_T$ : A Real-Time Action Description Language (Q5302879) (← links)
- An Algorithm for Local Variable Elimination in Normal Logic Programs (Q5302880) (← links)
- Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs (Q5302881) (← links)
- Extension of Type-Based Approach to Generation of Stream-Processing Programs by Automatic Insertion of Buffering Primitives (Q5302882) (← links)
- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates (Q5302883) (← links)
- A Transformational Semantics of Static Embedded Implications of Normal Logic Programs (Q5302884) (← links)
- Converting One Type-Based Abstract Domain to Another (Q5302885) (← links)
- Searching Semantically Equivalent Code Fragments in Logic Programs (Q5458790) (← links)
- Determinacy Analysis for Logic Programs Using Mode and Type Information (Q5458791) (← links)
- Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs (Q5458792) (← links)
- Fully Automatic Binding-Time Analysis for Prolog (Q5458793) (← links)
- Logical Mobility and Locality Types (Q5458795) (← links)
- Unwinding Conditions for Security in Imperative Languages (Q5458796) (← links)
- Natural Rewriting for General Term Rewriting Systems (Q5458797) (← links)
- Negation Elimination for Finite PCFGs (Q5458798) (← links)
- Specialization of Concurrent Guarded Multi-set Transformation Rules (Q5458799) (← links)
- Efficient Local Unfolding with Ancestor Stacks for Full Prolog (Q5458800) (← links)
- Schema-Guided Synthesis of Imperative Programs by Constraint Solving (Q5458801) (← links)
- Run-Time Profiling of Functional Logic Programs (Q5458802) (← links)
- Constructive Specifications for Compositional Units (Q5458803) (← links)
- Input-Termination of Logic Programs (Q5458804) (← links)
- On Termination of Binary CLP Programs (Q5458805) (← links)
- From Natural Semantics to Abstract Machines (Q5458806) (← links)
- Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis (Q5458807) (← links)
