In this paper a formal model for program dependence analysis of concurrent logic programs is proposed with the following contributions. First, two languageindependent program representations are presented for explicitly representing control ows and/or data ows in a concurrent logic program. Then based on these representations, program dependences between literals in concurrent logic programs ar...

Traditional worst-case execution time (WCET) analysis methods based on static program analysis require a precise timing model of a target processor. The construction of such a timing model is expensive and time consuming. In this paper we present a hybrid WCET analysis framework using runtime measurements together with static program analysis. The novel aspect of this framework is that it uses ...

Efficient decomposition of program and data on a scalable MIMD processor is necessary in order to minimize communication and synchronization costs while preserving sufficient parallelism to balance the workload of the processors. Programmer management of these runtime aspects of computation often proves to be very tedious and error-prone, and produces non-scalable, non-portable code. Previous e...

We have developed an approach to apply formal methods to represent program source code as a model and use an automated theorem prover to detect runtime violations by doing static analysis. Unlike other proof-based program verification approaches, this approach is based on a hypothesis to develop the implicit specification information, such as invariants, preconditions, postconditions, then usin...

This paper is to show how mechanical theorem proving can be used to verify even complex and heuristic programs like mission critical expert systems. Our approach is mechanical in two ways: The basic idea of runtime result verification is to validate each program result (at runtime) rather than to verify the program itself beforehand. Filtering each result by a sufficient algorithmic correctness...

The eld of theory update has seen some improvement, in what regards updating, by allowing desired updates to be speci ed by update programs. The updating of models is governed by update rules, as well as by inertia applied to those literals not directly a ected by the update program. Though this is important, it remains necessary to tackle too the updating of theories speci ed by programs. In t...

Mobile code suffers from the malicious host problem. When an adversary receives code he is able to effectively tamper with the code if he is able to relate the operations of the program with the appropriate context, that is, understanding the semantics of the program. In order to thwart an adversary from effectively tampering with a program he must be given an encrypted version such that he may...

> This paper presents an overview and a survey of logic program synthesis. Logic program synthesis is interpreted here in a broad way; it is concerned with the following question: given a speciication, how do we get a logic program satisfying the speciication? Logic programming provides a uniquely nice and uniform framework for program synthesis since the speciication, the synthesis process and...

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 decomposition. Reduced product allows to perform the logical conjunction of semantics, while complementation characterizes what is left from a semantics when the information concerning ...