756 search results - page 115 / 152 » Using Logic Programs to Reason about Infinite Sets |
LOGCOM
2007
13 years 8 months ago
2007
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
CADE
1998
Springer
14 years 22 days ago
1998
Springer
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
ICLP
2004
Springer
14 years 1 months ago
2004
Springer
A component is the basic re-usable unit of composition to build composite systems by connecting to others through their provided and required ports. Checking the functional complia...
AGP
1994
IEEE
14 years 19 days ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
TACAS
2007
Springer
14 years 2 months ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...