318 search results - page 30 / 64 » Temporal Disjunctive Logic Programming |
CADE
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
AAAI
2007
13 years 10 months ago
2007
Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordin...
ISSTA
2004
ACM
14 years 1 months ago
2004
ACM
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
LOGCOM
2010
13 years 2 months ago
2010
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
POPL
2010
ACM
14 years 5 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...