Sciweavers

639 search results - page 86 / 128
» Dominance Constraints with Set Operators
Sort
View
PPOPP
2009
ACM
16 years 5 months ago
Safe open-nested transactions through ownership
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha
CAV
2008
Springer
158views Hardware» more  CAV 2008»
15 years 6 months ago
Linear Arithmetic with Stars
We consider an extension of integer linear arithmetic with a "star" operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We...
Ruzica Piskac, Viktor Kuncak
ACTA
2010
191views more  ACTA 2010»
15 years 4 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
IANDC
2008
105views more  IANDC 2008»
15 years 4 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...
ICLP
2004
Springer
15 years 9 months ago
Applying CLP to Predict Extra-Functional Properties of Component-Based Models
A component is the basic re-usable unit of composition to build composite systems by connecting to others through their provided and required ports. Checking the functional complia...
Olivier Defour, Jean-Marc Jézéquel, ...