232 search results - page 26 / 47 » Symbolic Bounded Conformance Checking of Model Programs |
112
click to vote
SAC
2008
ACM
14 years 11 months ago
2008
ACM
In this paper we investigate and propose a fully automated technique to perform conformance checking of Java implementations against UML class diagrams. In our approach, we reused...
KBSE
2007
IEEE
15 years 6 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
107
click to vote
FOSSACS
2007
Springer
15 years 6 months ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
110
click to vote
FUIN
2000
14 years 11 months ago
2000
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
106
click to vote
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
We explore the problem of specification and verification of compliance in agent based Web service compositions. We use the formalism of temporal-epistemic logic suitably extended ...