Sciweavers

67 search results - page 9 / 14
» The Expressiveness of a Family of Finite Set Languages
Sort
View
ENTCS
2008
100views more  ENTCS 2008»
13 years 7 months ago
A Calculus for Team Automata
Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patter...
Maurice H. ter Beek, Fabio Gadducci, Dirk Janssens
POPL
2006
ACM
14 years 7 months ago
On flow-sensitive security types
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
Sebastian Hunt, David Sands
ECOOP
2005
Springer
14 years 1 months ago
Evaluating Support for Features in Advanced Modularization Technologies
Abstract. A software product-line is a family of related programs. Each program is defined by a unique combination of features, where a feature is an increment in program functiona...
Roberto E. Lopez-Herrejon, Don S. Batory, William ...
DM
2008
89views more  DM 2008»
13 years 7 months ago
Combinatorics of sequential dynamical systems
In this paper we study sequential dynamical systems (SDS) over words. Our main result is the classification of SDS over words for fixed graphY and family of local maps (Fvi ) by m...
Christian M. Reidys
AAAI
1998
13 years 9 months ago
Qualitative Simulation as a Temporally-extended Constraint Satisfaction Problem
qYaditionally, constraint satisfaction problems(CSPs) are characterized using a finite set of constraints expressed within a common,shared constraint language. Whenreasoning acros...
Daniel J. Clancy, Benjamin Kuipers