This paper is directed at two central objectives. The first is to identify and establish areas of overlap between the expert and database system domains. The second is to present a view of existing and ongoing work within the expert systems community concerning the Verification and Validation (V&V) of rule bases. This review is directed towards the database community with the express aim of ide...

Panel Abstract Software fault injection (SFI) is a controversial method for identifying errors and improving software. Many respected researchers believe the method holds promise, including the members on our panel, although with careful qualifications. On the other hand, COTS software manufacturers tend to view the method with skepticism for several reasons. One problem is the difficulty in ve...

Article history: Received 30 April 2014 Received in revised form 27 September 2015 Accepted 29 September 2015 Available online xxxx

Consulting a remote blacklist as part of verifying a token should not come at the cost of privacy. In particular, the blacklist provider should be unable to identify which tokens are being verified. The contents of the blacklist should also be protected; that is, it should not be possible to learn the contents of the blacklist, for example by querying the blacklist provider a large number of ti...

I explore the history of, and lessons learned from, eighteen years of assertional methods for specifying and verifying concurrent programs. I then propose a Utopian future in which mathematics prevails.

Currently, many specialties should be mastered to produce software, consequently they fall in different levels of knowledge: project, system, program, or routine. This consideration was obtained through an epistemological approach in software development. Therefore, this article develops this consideration for students learning software production. The epistemological approach compliments the m...

With algebraic laws a process can be simplified before verifying its equivalence with another process. Also needed are laws to allow a process to be simplified before verifying that it satisfies a temporal logic formula. Most previous work on this problem is based on property-preserving mappings between transition systems. The results presented here allow direct simplification of process terms ...

The well-known and powerful proof principle by well-founded induction says that for verifying 8x : P(x) for some property P it suuces to show 8x : 8y < x : P(y)] =) P(x)] , provided < is a well-founded partial ordering on the domain of interest. Here we investigate a more general formulation of this proof principle which allows for a kind of parameterized partial orderings < x which naturally a...

data (view-n)