Sciweavers

6167 search results - page 17 / 1234
» Can Refinement be Automated
Sort
View
ENTCS
2008
99views more  ENTCS 2008»
13 years 10 months ago
ArcAngelC: a Refinement Tactic Language for Circus
Circus is a refinement language, in which specifications define both data and behavioural aspects of concurrent systems using a combination of Z and CSP. Its refinement theory and...
M. V. M. Oliveira, A. L. C. Cavalcanti
FLOPS
2004
Springer
14 years 1 months ago
Analysing Definitional Trees: Looking for Determinism
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
Pascual Julián Iranzo, Christian Villamizar...
LICS
1994
IEEE
14 years 1 months ago
Efficient Inference of Object Types
Abadi and Cardelli have recently investigated a calculus of objects [2]. The calculus supports a key feature of object-oriented languages: an object can be emulated by another obj...
Jens Palsberg
CSL
2010
Springer
13 years 11 months ago
Classical and Intuitionistic Subexponential Logics Are Equally Expressive
It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented i...
Kaustuv Chaudhuri
FLAIRS
2010
13 years 10 months ago
Using Intelligent Agents to Build Navigation Meshes
We present a novel algorithm that allows agents to discover a navigation mesh for an environment as they move through the environment. The Navigation-Mesh Automated Discovery (NMA...
D. Hunter Hale, G. Michael Youngblood, Nikhil S. K...