Sciweavers

157 search results - page 2 / 32
» A Restriction Mapping Engine Using Constraint Logic Programm...
Sort
View
LOPSTR
2004
Springer
13 years 11 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
AMAST
1998
Springer
13 years 9 months ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak
AMAI
2008
Springer
13 years 5 months ago
Stable models and difference logic
The paper studies the relationship between logic programs with the stable model semantics and difference logic recently considered in the Satisfiability Modulo Theories framework....
Ilkka Niemelä
LPNMR
2009
Springer
14 years 3 days ago
A Default Approach to Semantics of Logic Programs with Constraint Atoms
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
Yi-Dong Shen, Jia-Huai You
CASCON
2006
149views Education» more  CASCON 2006»
13 years 7 months ago
Packet decoding using context sensitive parsing
Protocol tester is a project at RMC and Queen's that applies program transformation techniques to protocol data to evaluate the security of network applications. As part of t...
Sylvain Marquis, Thomas R. Dean, Scott Knight