2148 search results - page 203 / 430 » From process logic to program logic |
127
click to vote
SAT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
145
click to vote
BPM
2008
Springer
15 years 6 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...
148
click to vote
CADE
2002
Springer
16 years 4 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
136
click to vote
SEKE
2007
Springer
15 years 10 months ago
2007
Springer
High performance computing (HPC) is gaining popularity in solving scientific applications. Using the current programming standards, however, it takes an HPC expert to efficiently ...
150
click to vote
PLILP
1994
Springer
15 years 8 months ago
1994
Springer
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...