2540 search results - page 316 / 508 » Abstract Logics as Dialgebras |
104
Voted
TCS
2002
15 years 9 days ago
2002
oole.stanford.edu/pub/ABSTRACTS Pratt, V.R., "Transition and Cancellation in Concurrency and Branching Time", Math. Structures in Comp. Sci., 13:4, 485-529, August 2003. ...
101
Voted
LPAR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
156
Voted
LPAR
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...
113
click to vote
ICTAC
2010
Springer
14 years 10 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
99
Voted
CADE
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...