Sciweavers

99 search results - page 16 / 20
» Model Checking Linear Programs with Arrays
Sort
View
COCOON
2003
Springer
14 years 26 days ago
Petri Nets with Simple Circuits
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...
Hsu-Chun Yen, Lien-Po Yu
POPL
2006
ACM
14 years 8 months ago
A fixpoint calculus for local and global program flows
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...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
SAS
2007
Springer
112views Formal Methods» more  SAS 2007»
14 years 1 months ago
Taming the Wrapping of Integer Arithmetic
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 ...
Axel Simon, Andy King
ICSOC
2010
Springer
13 years 6 months ago
Service Discovery Using Communication Fingerprints
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...
Olivia Oanea, Jan Sürmeli, Karsten Wolf
WSC
2004
13 years 9 months ago
Computer Automated Multi-Paradigm Modelling for Analysis and Design of Traffic Networks
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...
Hans Vangheluwe, Juan de Lara