899 search results - page 129 / 180 » A CTL-Based Logic for Program Abstractions |
196
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
126
click to vote
ARGMAS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In this work, an agent architecture that combines defeasible argumentation and the BDI model is described. Argumentation will be used as a mechanism for reasoning about b...
95
Voted
FCT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
104
click to vote
ILP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper, we study how a logical form of scientific modelling that integrates together abduction and induction can be used to understand the functional class of unk...
86
Voted
EUROPAR
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...