99 search results - page 16 / 20 » Model Checking Linear Programs with Arrays |
140
click to vote
COCOON
2003
Springer
15 years 9 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
240
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
123
click to vote
SAS
2007
Springer
15 years 10 months ago
2007
Springer
Variables in programs are usually confined to a fixed number of bits and results that require more bits are truncated. Due to the use of 32-bit and 64-bit variables, inadvertent ...
144
click to vote
ICSOC
2010
Springer
15 years 2 months ago
2010
Springer
A request to a service registry must be answered with a service that fits in several regards, including semantic compatibility, non-functional compatibility, and interface compati...
133
click to vote
WSC
2004
15 years 5 months ago
2004
Computer Automated Multi-Paradigm Modelling (CAMPaM) is an enabler for domain-specific analysis and design. Traffic, a new untimed visual formalism for vehicle traffic networks, i...