5863 search results - page 431 / 1173 » On Model-Checking of P Systems |
155
click to vote
MOC
1998
15 years 7 months ago
1998
Consider the system of Diophantine equations x2 − ay2 = b, P (x, y) = z2, where P is a given integer polynomial. Historically, such systems have been analyzed by using Baker’s ...
240
click to vote
SIGSOFT
2007
ACM
16 years 8 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
231
click to vote
SIGSOFT
2003
ACM
16 years 8 months ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
217
Voted
CASES
2009
ACM
16 years 2 months ago
2009
ACM
Accurate estimation of the tick length of a synchronous program is essential for efficient and predictable implementations that are devoid of timing faults. The techniques to dete...
215
click to vote
HASE
2008
IEEE
16 years 2 months ago
2008
IEEE
Model-based program debugging exploits discrepancies between the program behavior anticipated by a programmer and the program’s actual behavior when executed on a set of inputs....