the most important open problem in the study of termination for logic programs is that of existential termination. In this paper we present a powerful transformational methodology that provides necessary (and, under s...
详细信息
We consider abstract interpretation, and in particular the basic operators of reduced product and complementation of abstract domains, as a tool to systematically derive denotational semantics by composition and decom...
详细信息
A methodology is introduced based on first-order logic, for the design and decomposition of abstract domains for abstract interpretation. First, an assertion language is chosen that describes the properties of interes...
详细信息
In this paper we present the semantics of a functional logic language with parametric and order-sorted polymorphism. Typed programs consist of a polymorphic signature and a set of constructor-based conditional rewriti...
详细信息
We present an implementation of directed narrowing extended to the conditional framework, which is complete for two classes of conditional term rewrite systems: confluent and decreasing on one hand, level-confluent an...
详细信息
Concurrent constraint programming is classically based on asynchronous communication via a shared store. this paper presents new version of the ask and tell primitives which features synchronicity. Our approach is bas...
详细信息
Efficient implementation of advanced database programming languages call for investigating novel architectures and algorithms. In this paper, we discuss our implementation of SchemaLog, a logic-based database programm...
详细信息
ISBN:
(纸本)9780897918732
Efficient implementation of advanced database programming languages call for investigating novel architectures and algorithms. In this paper, we discuss our implementation of SchemaLog, a logic-based database programming language, capable of offering a powerful platform for a variety of database applications involving data/meta-data querying and restructuring. Our architecture for the implementation is based on compiling SchemaLog constructs into an extended version of relational algebra called SchemaLog. Based on this algebra, we develop a top-down algorithm for evaluating SchemaLog programs. We discuss three alternative storage structures for the implementation and study their effect on the efficiency of implementation. For each storage structure, we propose strategies for implementing our algebraic operators. We have implemented all these strategies on top of Microsoft Access DBMS running on Windows 3.1, and have run an extensive set of experiments for evaluating the efficiency of alternative strategies under a varied mix of querying and restructuring operations. We discuss the results of our experiments and conclude with a discussion of a graphic user interface for SchemaLog program development, that has also been implemented.
the proceedings contain 60 papers. the special focus in this conference is on Algebraic Methodology and Software Technology. the topics include: Two industrial trials of formal specification;industrial applications of...
ISBN:
(纸本)9783540614630
the proceedings contain 60 papers. the special focus in this conference is on Algebraic Methodology and Software Technology. the topics include: Two industrial trials of formal specification;industrial applications of ASF + SDF;the embedded software of an electricity meter: an experience in using formal methods in an industrial project;applying research results in the industrial environment;using heterogeneous formal methods in distributed software engineering education;introducing formal methods to software engineers through OMG’s corba environment and interface definition language;toward a classification approach to design;semantic foundations for embedding HOL in nuprl;free variable tableaux for a many sorted logic with preorders;automating induction over mutually recursive functions;pushouts of order-sorted algebraic specifications;a formal framework for modules with state;object-oriented implementation of abstract data type specifications;on the completeness of the equations for the kleene star in bisimulation;an equational axiomatization of observation congruence for prefix iteration;finite axiom systems for testing preorder and de simone process languages;constructive semantics of esterel;using ghost variables to prove refinement;tracing the origins of verification conditions;preprocessing for lnvariant validation;formal verification of SIGNAL programs;the discrete time TOOLBUS;a study on the specification and verification of performance properties;symbolic bisimulation for limed processes;approximative analysis by process algebra with graded spatial actions;boolean formalism and explanations;proving existential termination of normal logic programs;programming in lygon and some characteristics of strong innermost normalization.
the different properties characterizing the operational behavior of logic programs can be organized in a hierarchy of fixpoint semantics related by Galois insertions, having the least Herbrand model as most abstract s...
详细信息
A term rewriting system is strongly innermost normalizing if every innermost derivation of it is of finite length. this property is very important in the integration of functional and logicprogramming paradigms. Unli...
详细信息
暂无评论