899 search results - page 142 / 180 » A CTL-Based Logic for Program Abstractions |
118
Voted
POPL
1997
ACM
15 years 4 months ago
1997
ACM
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
DLOG
2007
15 years 2 months ago
2007
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
AMAST
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Declarative debugging has been applied to many declarative programming paradigms; in this paper, a declarative debugger for rewriting logic specifications, embodied in th...
ENTCS
2006
15 years 13 days ago
2006
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
202
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...