1705 search results - page 72 / 341 » Representing Constraints with Automata |
CSCLP
2007
Springer
14 years 4 months ago
2007
Springer
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
COMPULOG
1999
Springer
14 years 2 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
POPL
2004
ACM
14 years 10 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
COMPSAC
2009
IEEE
14 years 4 months ago
2009
IEEE
Along with the popularity of software-intensive systems, the interactions between system components and between humans and software applications are becoming more and more complex...
NORDSEC
2009
Springer
14 years 4 months ago
2009
Springer
Runtime enforcement is a common mechanism for ensuring that program executions adhere to constraints specified by a security policy. It is based on two simple ideas: the enforceme...