Sciweavers

858 search results - page 44 / 172
» Abstract Interpretation Based Verification of Logic Programs
Sort
View
POPL
2009
ACM
16 years 13 days ago
Compositional shape analysis by means of bi-abduction
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
FASE
2010
Springer
15 years 6 months ago
Proving Consistency and Completeness of Model Classes Using Theory Interpretation
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
Ádám Darvas, Peter Müller
IWFM
1998
15 years 1 months ago
Strictly Level-Decreasing Logic Programs
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
Anthony Karel Seda, Pascal Hitzler
CORR
2011
Springer
151views Education» more  CORR 2011»
14 years 6 months ago
Temporal Probabilistic Logic Programs: State and Revision
There are numerous applications where we have to deal with temporal uncertainty associated with events. The Temporal Probabilistic (TP) Logic Programs should provide support for v...
Zoran Majkic
CSMR
1998
IEEE
15 years 4 months ago
A Metrics Suite for Concurrent Logic Programs
AbstractA large body of research in the measurement of software complexity has been focused on imperative programs, but little eort has been made for logic programs. In this paper,...
Jianjun Zhao, Jingde Cheng, Kazuo Ushijima