4513 search results - page 701 / 903 » Logic programming with satisfiability |
152
Voted
FATES
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Writing specifications using Java Modeling Language has been accepted for a long time as a practical approach to increasing the correctness and quality of Java programs. ...
147
click to vote
DC
2010
15 years 3 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
247
Voted
POPL
2008
ACM
16 years 4 months ago
2008
ACM
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
130
Voted
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
227
Voted
CONCUR
2011
Springer
14 years 3 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...