Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming

Delzanno, Giorgio; Giacobazzi, Roberto; Ranzato, Francesco

doi:10.1007/978-3-642-14309-0_7

Cited by 5 publications

(3 citation statements)

References 78 publications

(94 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In a nutshell, abstract interpretation (Delzanno et al ., 2010) is a theory of sound approximation of the semantics of computer programs, based on monotonic functions over ordered sets, especially lattices. It can be viewed as a partial execution of a computer program which gains information about its semantics (e.g.…”

Section: Discussionmentioning

confidence: 99%

“…Transitions are the actions of the rules. As we mentioned before, they can be generic actions with external changes, A i : YD → Y (where D = D 1, …, Dn are data types that may be needed for the definition of the actions of a specific rule based system) or some of the predefined actions assert : Y Fact → Y (add a fact to KB), retract : Y Fact → Y (remove a fact from KB), update : Y Fact Fact → Y (remove/add a fact), with the semantics those given by rule markup languages (Delzanno et al ., 2010). The production rules are defined as transitions through the following steps: Step 1 : If A i is an assert action, its effect on the knowledge observer is defined as knowledge(assert(u,ki,d1, .…”

Section: Proposed Frameworkmentioning

confidence: 99%

See 1 more Smart Citation

Formal analysis and verification support for reactive rule-based Web agents

Ksystra

Stefaneas

2016

IJWIS

View full text Add to dashboard Cite

Purpose Reactive rules are used for programming rule-based Web agents, which have the ability to detect events and respond to them automatically and can have complex structure and unpredictable behavior. The aim of this paper is to provide an appropriate formal framework for analyzing such rules. Design/methodology/approach To achieve this goal, the authors give two alternative semantics for the basic reactive rules’ families which allow us to specify reactive rule-based agents and verify their intended behavior. The first approach expresses the functionality of production and event condition action rules in terms of equations, whereas the second methodology is based in the formalism of rewriting logic. Both semantics can be expressed within the framework of CafeOBJ algebraic specification language, which then offers the verification support and have their advantages and downsides. Findings The authors report on experiences gained by applying those methodologies in a reactive rule-based system and compare the two methodologies. Originality/value Finally, the authors demonstrate a tool that translates a set of reactive rules into CafeOBJ rewrite rules, thus making the verification of reactive rules possible for inexperienced users.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Proposed Frameworkmentioning

confidence: 99%

Formal analysis and verification support for reactive rule-based Web agents

Ksystra

Stefaneas

2016

IJWIS

View full text Add to dashboard Cite

show abstract

“…This is further studied in [14], where bottom-up evaluation is extended to first order LO programs with universally quantified goals and possibly empty heads. See for more details the Chapter [29] in this volume.…”

Section: Lomentioning

confidence: 99%

Proof-Theoretic and Higher-Order Extensions of Logic Programming

Momigliano

Ornaghi

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstraction mechanisms such as higher-order programming, scoping constructs and forms of information hiding. Those extensions were based on the Deduction and Computation paradigm as formulated in Miller et al's approach [51], which built logic programming around the notion of focused uniform proofs The Italian contribution has been both foundational and applicative, in terms of language extensions, implementation techniques and usage of the new features to capture various computation models. We argue that the emphasis has now moved to the theory and practice of logical frameworks, carrying with it a better understanding of the foundations of proof search.

show abstract