Sciweavers

3713 search results - page 312 / 743
» Constructing a Calculus of Programs
Sort
View
CONCUR
2006
Springer
15 years 8 months ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
ZUM
2000
Springer
132views Formal Methods» more  ZUM 2000»
15 years 8 months ago
A Formal Architecture for the 3APL Agent Programming Language
Abstract. The notion of agents has provided a way of imbuing traditional computing systems with an extra degree of flexibility that allows them to be more resilient and robust in t...
Mark d'Inverno, Koen V. Hindriks, Michael Luck
FMICS
2008
Springer
15 years 6 months ago
Extending Structural Test Coverage Criteria for Lustre Programs with Multi-clock Operators
Lustre is a formal synchronous declarative language widely used for modeling and specifying safety-critical applications in the elds of avionics, transportation or energy productio...
Virginia Papailiopoulou, Laya Madani, Lydie du Bou...
GPCE
2009
Springer
15 years 9 months ago
Extending AspectJ for separating regions
Synchronization is a good candidate for an aspect in aspectoriented programming (AOP) since programmers have to choose the best granularity of synchronization for the underlying h...
Shumpei Akai, Shigeru Chiba
ICML
2003
IEEE
16 years 5 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich