Sciweavers

4426 search results - page 215 / 886
» Concurrent Constraint Programming
Sort
View
PLDI
2004
ACM
15 years 12 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
CORR
2010
Springer
173views Education» more  CORR 2010»
15 years 6 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux
SARA
2009
Springer
15 years 11 months ago
Rewriting Constraint Models with Metamodels
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
Raphaël Chenouard, Laurent Granvilliers, Rica...
AMAST
2004
Springer
15 years 12 months ago
Formal JVM Code Analysis in JavaFAN
JavaFAN uses a Maude rewriting logic specification of the JVM semantics as the basis of a software analysis tool with competitive performance. It supports formal analysis of concu...
Azadeh Farzan, José Meseguer, Grigore Rosu
APLAS
2008
ACM
15 years 8 months ago
Reasoning about Java's Reentrant Locks
This paper presents a verification technique for a concurrent Java-like language with reentrant locks. The verification technique is based on permissionaccounting separation logic....
Christian Haack, Marieke Huisman, Clément H...