1461 search results - page 167 / 293 » Analysis of Constraint Logic Programs |
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
POPL
2010
ACM
15 years 7 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
193
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
TACAS
1999
Springer
15 years 2 months ago
1999
Springer
We present a theorem-prover based analysis tool for object-oriented database systems with integrity constraints. Object-oriented database specifications are mapped to higher-order...
CAISE
1999
Springer
15 years 2 months ago
1999
Springer
In this paper, we describe the process specification language ConGolog and show how it can be used to model business processes for requirements analysis. In ConGolog, the effects...