Sciweavers

2649 search results - page 452 / 530
» Temporal Theories of Reasoning
Sort
View
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
14 years 3 days ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
ICFP
2000
ACM
14 years 1 days ago
Intersection types and computational effects
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
Rowan Davies, Frank Pfenning
AGENTCL
2000
Springer
14 years 1 days ago
Semantics of Communicating Agents Based on Deduction and Abduction
Intelligent agents in the agent language 3APL are computational entities consisting of beliefs and goals which make up their mental state. In this paper, we integrate communicatio...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...
HASE
1998
IEEE
13 years 12 months ago
Estimating the Number of Residual Defects
Residual defects is one of the most important factors that allow one to decide if a piece of software is ready to be released. In theory, one can find all the defects and count th...
Yashwant K. Malaiya, Jason Denton
KBSE
1998
IEEE
13 years 12 months ago
Planning Equational Verification in CCS
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
Raul Monroy, Alan Bundy, Ian Green