Sciweavers

116 search results - page 14 / 24
» Operations Preserving Recognizable 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
SMI
2010
IEEE
165views Image Analysis» more  SMI 2010»
13 years 5 months ago
Designing a Topological Modeler Kernel: A Rule-Based Approach
In this article, we present a rule-based language dedicated to topological operations, based on graph transformations. Generalized maps are described as a particular class of graph...
Thomas Bellet, Mathieu Poudret, Agnès Arnou...
JLP
2011
94views more  JLP 2011»
13 years 2 months ago
Permission to speak: A logic for access control and conformance
Formal languages for policy have been developed for access control and conformance checking. In this paper, we describe a formalism that combines features that have been developed...
Nikhil Dinesh, Aravind K. Joshi, Insup Lee, Oleg S...
ICAS
2008
IEEE
274views Robotics» more  ICAS 2008»
14 years 2 months ago
Model-Driven Engineering of Multi-target Plastic User Interfaces
A Multi-target user interface is composed of a series of interconnected variations of the same user interfaces, but tailored for different targets or different contexts of use. Wh...
Benoît Collignon, Jean Vanderdonckt, Gaë...
IFL
2007
Springer
120views Formal Methods» more  IFL 2007»
14 years 1 months ago
Lazy Contract Checking for Immutable Data Structures
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...
Robert Bruce Findler, Shu-yu Guo, Anne Rogers