Sciweavers

322 search results - page 7 / 65
» Combinations of Abstract Domains for Logic Programming
Sort
View
CAV
2010
Springer
156views Hardware» more  CAV 2010»
14 years 12 months ago
A Logical Product Approach to Zonotope Intersection
We define and study a new abstract domain which is a fine-grained combination of zonotopes with (sub-)polyhedric domains such as the interval, ocinear template or polyhedron domain...
Khalil Ghorbal, Eric Goubault, Sylvie Putot
LISP
2007
124views more  LISP 2007»
14 years 11 months ago
A new generic scheme for functional logic programming with constraints
In this paper we propose a new generic scheme CFLP(D ), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given co...
Francisco Javier López-Fraguas, Mario Rodr&...
AAAI
1990
15 years 24 days ago
Inductive Synthesis of Equational Programs
An equational approach to the synthesis of functional and logic programs is taken. Typically, a target program contains equations that are only true in the standard model of the g...
Nachum Dershowitz, Eli Pinchover
VL
1995
IEEE
110views Visual Languages» more  VL 1995»
15 years 3 months ago
Heterogeneous Visual Languages-Integrating Visual and Textual Programming
After more than a decade of research, visual languages have still not become everyday programming tools. On a short term, an integration of visual languages with well-established ...
Martin Erwig, Bernd Meyer
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
15 years 3 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi