3658 search results - page 450 / 732 » The logic of proofs, semantically |
195
click to vote
BPM
2008
Springer
15 years 8 months ago
2008
Springer
A given business process may face a large number of regulatory obligations the process may or comply with. Providing tools and techniques through which an evaluation of the complia...
171
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
We introduce a calculus for handling integer arithmetic in first-order logic. The method is tailored to Java program verification and meant to be used both as a supporting procedur...
174
click to vote
FOSSACS
2007
Springer
16 years 26 days ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
177
click to vote
ISCIS
2004
Springer
16 years 1 days ago
2004
Springer
System BV is an extension of multiplicative linear logic with a non-commutative self-dual operator. In this paper we present systems equivalent to system BV where equalities for un...
153
click to vote
TPHOL
2003
IEEE
15 years 12 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...