Sciweavers

9626 search results - page 407 / 1926
» Invariant Based Programming
Sort
View
ICLP
1997
Springer
15 years 11 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
DALT
2004
Springer
15 years 10 months ago
Modeling and Verification of Distributed Autonomous Agents Using Logic Programming
Systems of autonomous agents providing automated services over the Web are fast becoming a reality. Often these agent systems are constructed using procedural architectures that pr...
L. Robert Pokorny, C. R. Ramakrishnan
CAV
2010
Springer
206views Hardware» more  CAV 2010»
15 years 10 months ago
Dynamic Cutoff Detection in Parameterized Concurrent Programs
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
Alexander Kaiser, Daniel Kroening, Thomas Wahl
CLIMA
2007
15 years 8 months ago
Language Constructs for Multi-agent Programming
Abstract. In this paper we are concerned with proposing, analyzing and implementing simple, yet flexible, constructs for multi-agent programming. In particular, we wish to extend ...
Louise A. Dennis, Michael Fisher, Anthony Hepple
CDC
2010
IEEE
112views Control Systems» more  CDC 2010»
15 years 1 months ago
Online Convex Programming and regularization in adaptive control
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...
Maxim Raginsky, Alexander Rakhlin, Serdar Yük...