Sciweavers

1179 search results - page 188 / 236
» Programming in Hybrid Constraint Languages
Sort
View
PEPM
2011
ACM
13 years 1 months ago
Calculating tree navigation with symmetric relational zipper
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
Yuta Ikeda, Susumu Nishimura
ARGMAS
2004
Springer
14 years 3 months ago
An Argument-Based Framework to Model an Agent's Beliefs in a Dynamic Environment
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...
Marcela Capobianco, Carlos Iván Chesñ...
OOPSLA
2005
Springer
14 years 3 months ago
Javari: adding reference immutability to Java
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...
Matthew S. Tschantz, Michael D. Ernst
OOPSLA
2010
Springer
13 years 8 months ago
Cross-language, type-safe, and transparent object sharing for co-located managed runtimes
As software becomes increasingly complex and difficult to analyze, it is more and more common for developers to use high-level, type-safe, object-oriented (OO) programming langua...
Michal Wegiel, Chandra Krintz
CP
2005
Springer
14 years 3 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville