2152 search results - page 237 / 431 » On Automating the Calculus of Relations |
193
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
180
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
200
click to vote
LICS
2012
IEEE
13 years 8 months ago
2012
IEEE
—Hybrid systems are a fusion of continuous dynamical systems and discrete dynamical systems. They freely combine dynamical features from both worlds. For that reason, it has ofte...
276
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
159
click to vote
CPAIOR
2009
Springer
16 years 1 months ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...