Sciweavers

21 search results - page 4 / 5
» Loop Formulas for Logic Programs with Arbitrary Constraint A...
Sort
View
POPL
2007
ACM
14 years 6 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
SEMCO
2007
IEEE
13 years 12 months ago
Modeling Discriminative Global Inference
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
Nicholas Rizzolo, Dan Roth
FASE
2001
Springer
13 years 10 months ago
A Logic for the Java Modeling Language JML
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
Bart Jacobs, Erik Poll
VMCAI
2004
Springer
13 years 11 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
JAR
2006
236views more  JAR 2006»
13 years 5 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard