Pages that link to "Item:Q4305626"

The following pages link to The s-semantics approach: Theory and applications (Q4305626):

Displaying 22 items.

• Semantics of structured normal logic programs (Q444364) (← links)
• An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
• Deriving escape analysis by abstract interpretation (Q857916) (← links)
• A new generic scheme for functional logic programming with constraints (Q880985) (← links)
• A compact fixpoint semantics for term rewriting systems (Q987981) (← links)
• Abstract deduction and inferential models for type theory (Q988551) (← links)
• S-semantics for logic programming: a retrospective look (Q1035702) (← links)
• Abstract interpretation of resolution-based semantics (Q1035705) (← links)
• Compositionality properties of SLD-derivations (Q1274454) (← links)
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements (Q1275821) (← links)
• The reduced relative power operation on abstract domains (Q1285656) (← links)
• A new framework for declarative programming (Q1399960) (← links)
• Generalized metrics and uniquely determined logic programs. (Q1427780) (← links)
• Type dependencies for logic programs using ACI-unification (Q1575243) (← links)
• A polymorphic type dependency analysis for logic programs (Q1758668) (← links)
• An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. (Q1853617) (← links)
• A theory of observables for logic programs (Q1854446) (← links)
• Pair-independence and freeness analysis through linear refinement. (Q1873754) (← links)
• On collecting semantics for program analysis (Q2182314) (← links)
• On the verification of finite failure (Q2575838) (← links)
• Inference of Field-Sensitive Reachability and Cyclicity (Q2946745) (← links)
• A simple correctness proof for magic transformation (Q4897705) (← links)