1117 search results - page 132 / 224 » Partial Models of Extended Generalized Logic Programs |
120
click to vote
SAC
2002
ACM
15 years 1 months ago
2002
ACM
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
126
click to vote
ICFP
2003
ACM
16 years 1 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
131
click to vote
APLAS
2010
ACM
15 years 1 months ago
2010
ACM
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
114
click to vote
POPL
2010
ACM
15 years 10 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
DAC
2005
ACM
16 years 2 months ago
2005
ACM
This paper presents a unifying framework for the modeling of asynchronous pipeline circuits. A pipeline protocol is captured in a graph-based model which defines the partial order...