Pages that link to "Item:Q2848891"
From MaRDI portal
The following pages link to Logic-Based Program Synthesis and Transformation (Q2848891):
Displayed 50 items.
- An Introduction to Search Combinators (Q2848892) (← links)
- A Declarative Pipeline Language for Complex Data Analysis (Q2848893) (← links)
- Semantic Code Clones in Logic Programs (Q2848895) (← links)
- Specialization with Constrained Generalization for Software Model Checking (Q2848896) (← links)
- Enhancing Declarative Debugging with Loop Expansion and Tree Compression (Q2848898) (← links)
- XACML 3.0 in Answer Set Programming (Q2848900) (← links)
- Types vs. PDGs in Information Flow Analysis (Q2848902) (← links)
- Computing More Specific Versions of Conditional Rewriting Systems (Q2848903) (← links)
- Improving Determinization of Grammar Programs for Program Inversion (Q2848904) (← links)
- A Framework for Guided Test Case Generation in Constraint Logic Programming (Q2848906) (← links)
- Simplifying the Verification of Quantified Array Assertions via Code Transformation (Q2848907) (← links)
- Proving Properties of Co-logic Programs with Negation by Program Transformations (Q2848908) (← links)
- Analyzing Array Manipulating Programs by Program Transformation (Q2949696) (← links)
- Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction (Q2949697) (← links)
- Confluence Modulo Equivalence in Constraint Handling Rules (Q2949698) (← links)
- Exhaustive Execution of CHR Through Source-to-Source Transformation (Q2949701) (← links)
- A Formal Semantics for the Cognitive Architecture ACT-R (Q2949702) (← links)
- Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems (Q2949703) (← links)
- Partial Evaluation for Java Malware Detection (Q2949704) (← links)
- Access Control and Obligations in the Category-Based Metamodel: A Rewrite-Based Semantics (Q2949705) (← links)
- Concolic Execution and Test Case Generation in Prolog (Q2949706) (← links)
- Liveness Properties in CafeOBJ – A Case Study for Meta-Level Specifications (Q2949707) (← links)
- A Hybrid Method for the Verification and Synthesis of Parameterized Self-Stabilizing Protocols (Q2949709) (← links)
- Drill and Join: A Method for Exact Inductive Program Synthesis (Q2949711) (← links)
- Functional Kleene Closures (Q2949712) (← links)
- On Completeness of Logic Programs (Q2949713) (← links)
- Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies (Q2949714) (← links)
- Declarative Compilation for Constraint Logic Programming (Q2949715) (← links)
- Pre-indexed Terms for Prolog (Q2949716) (← links)
- Three Syntactic Theories for Combinatory Graph Reduction (Q3003482) (← links)
- Proving with ACL2 the Correctness of Simplicial Sets in the Kenzo System (Q3003483) (← links)
- Graph Generation to Statically Represent CSP Processes (Q3003484) (← links)
- Verification of the Schorr-Waite Algorithm – From Trees to Graphs (Q3003486) (← links)
- MikiBeta : A General GUI Library for Visualizing Proof Trees (Q3003488) (← links)
- On Inductive Proofs by Extended Unfold/Fold Transformation Rules (Q3003489) (← links)
- Non-termination Analysis of Logic Programs Using Types (Q3003491) (← links)
- Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation (Q3003492) (← links)
- Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (Q3003493) (← links)
- A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs (Q3003494) (← links)
- Abstract Diagnosis of First Order Functional Logic Programs (Q3003495) (← links)
- The First-Order Nominal Link (Q3003496) (← links)
- Formalization and Execution of Linear Algebra: From Theorems to Algorithms (Q3453644) (← links)
- Information Flow in Object-Oriented Software (Q3453646) (← links)
- A Transformational Approach to Resource Analysis with Typed-Norms (Q3453647) (← links)
- A Finite Representation of the Narrowing Space (Q3453648) (← links)
- From Outermost Reduction Semantics to Abstract Machine (Q3453649) (← links)
- Towards Erlang Verification by Term Rewriting (Q3453650) (← links)
- Extending Co-logic Programs for Branching-Time Model Checking (Q3453651) (← links)
- A Logical Encoding of Timed $$\pi $$-Calculus (Q3453652) (← links)
- Compiling a Functional Logic Language: The Fair Scheme (Q3453653) (← links)