528 search results - page 59 / 106 » Transition Logic Revisited |
147
click to vote
ISKI
1994
15 years 6 months ago
1994
This paper aims at integrating techniques of non-monotonic reasoning about updates and of object-oriented specification of information systems. We present how to utilize defaults i...
138
click to vote
FASE
2008
Springer
15 years 3 months ago
2008
Springer
We introduce a logical verification framework for checking functional properties of service-oriented applications formally specified using the service specification language COWS. ...
112
click to vote
TCS
2002
15 years 1 months 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. ...
108
click to vote
LPAR
2010
Springer
15 years 12 days 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...
139
click to vote
CADE
2012
Springer
13 years 4 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...